End-to-end packet delay and loss behavior in the internet
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Measuring bottleneck link speed in packet-switched networks
Performance Evaluation
End-to-end internet packet dynamics
IEEE/ACM Transactions on Networking (TON)
Using pathchar to estimate Internet link characteristics
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Measuring link bandwidths using a deterministic model of packet delay
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
End-to-end available bandwidth: measurement methodology, dynamics, and relation with TCP throughput
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Evaluation of a Novel Two-Step Server Selection Metric
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
A measurement study of available bandwidth estimation tools
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Single-hop probing asymptotics in available bandwidth estimation: sample-path analysis
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
Supporting time-sensitive applications on a commodity OS
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Stochastic analysis of packet-pair probing for network bandwidth estimation
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Network modelling and simulation
Evaluation and characterization of available bandwidth probing techniques
IEEE Journal on Selected Areas in Communications
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
The packet pair technique is a widely used method for estimating the available bandwidth of an end-to-end network path. We characterize the stochastic nature of the packet pair dispersion caused by bursty cross traffic and its adverse effect on available bandwidth estimation. In order to overcome this difficulty, we introduce a novel concept of the relative distance, which can be obtained from the relation between input and output gaps of packet pairs. By exploiting the quasi-invariant characteristic of the relative distance, we develop a feedback-assisted, robust and non-intrusive approach for estimating the available bandwidth. The method entitled bTrack periodically sends two pairs of probe packets of different sizes and exploits the relative distance for accurate estimation of the available bandwidth. The amount of the probing traffic is independent of the available bandwidth and is adjustable by tuning of the probing period, which shows the non-intrusive nature of bTrack. We give the convergence analysis of bTrack based on the theory of the stochastic approximation, which guarantees the robust performance of bTrack under bursty cross traffic. We verify via extensive ns-2 simulations and empirical experiments (over campus intranets and the Internet) that bTrack tracks the available bandwidth very well and is not intrusive.