Measuring Link Bandwidths Using a Deterministic Model of Packet Delay (2000)
Cached
Download Links
- [www.cs.berkeley.edu]
- [gunpowder.stanford.edu]
- [mosquitonet.stanford.edu]
- [mechatronics.ece.usu.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | IN PROCEEDINGS OF ACM SIGCOMM |
| Citations: | 223 - 3 self |
BibTeX
@INPROCEEDINGS{Lai00measuringlink,
author = {Kevin Lai},
title = {Measuring Link Bandwidths Using a Deterministic Model of Packet Delay},
booktitle = {IN PROCEEDINGS OF ACM SIGCOMM},
year = {2000},
pages = {283--294},
publisher = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We describe a deterministic model of packet delay and use it to derive both the packet pair [2] property of FIFO-queueing networks and a new technique (packet tailgating) for actively measuring link bandwidths. Compared to previously known techniques, packet tailgating usually consumes less network bandwidth, does not rely on consistent behavior of routers handling ICMP packets, and does not rely on timely delivery of acknowledgments. Preliminary empirical measurements in the Internet indicate that compared to current measurement tools, packet tailgating sends an order of magnitude fewer packets, while maintaining approximately the same accuracy. Unfortunately, for all currently available measurement tools, including our prototype implementation of packet tailgating, accuracy is low for paths longer than a few hops.
Keyphrases
deterministic model link bandwidth packet delay network bandwidth new technique fifo-queueing network current measurement tool icmp packet packet tailgating consistent behavior packet pair prototype implementation internet indicate available measurement tool timely delivery preliminary empirical measurement
