Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
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
Server Selection Using Dynamic Path Characterization in Wide-Area Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Virtual Queueing Techniques for ABR Service: Improving ABR/VBR Interaction
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
A measurement study of available bandwidth estimation tools
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Locating internet bottlenecks: algorithms, measurements, and implications
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Ten fallacies and pitfalls on end-to-end available bandwidth estimation
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
Bandwidth estimation in broadband access networks
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
Packet-dispersion techniques and a capacity-estimation methodology
IEEE/ACM Transactions on Networking (TON)
Bandwidth estimation: metrics, measurement techniques, and tools
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
This paper presents a novel methodology, called COPP, to estimate available bandwidth over a given network path. We first present a rigorous definition of available bandwidth, from which the novel two-steps estimating methodology, e.g. partial and final step, can be derived. In partial step, COPP deploys a particular probe scheme, namely chirp of packet pairs, which is composed of several packet pairs with decremental inter-packet spacing. After each chirp is sent, a partial estimate can be obtained and equal to the weighted average of all turning bandwidth within the chirp. In the second step, the final estimate is the weighted amount of all partial results of all chirps in a measurement episode. Additionally, we develop a heuristic though efficient rule to determine whether a packet pair is turning point. Finally, the evaluation of COPP in various simulations shows that COPP can provide accurate results with relatively less overhead while adapt to network variations rapidly.