Locating Available Bandwidth Bottlenecks

Authors:
Vinay J. Ribeiro;Rudolf H. Riedi;Richard G. Baraniuk
Affiliations:
Rice University;Rice University;Rice University
Venue:
IEEE Internet Computing
Year:
2004

Citing 7
Cited 5

On the self-similar nature of Ethernet traffic (extended version)

IEEE/ACM Transactions on Networking (TON)
Measuring link bandwidths using a deterministic model of packet delay

Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Detecting shared congestion of flows via end-to-end measurement

IEEE/ACM Transactions on Networking (TON)
End-to-end available bandwidth: measurement methodology, dynamics, and relation with TCP throughput

IEEE/ACM Transactions on Networking (TON)
An empirical evaluation of wide-area internet bottlenecks

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
Evaluation and characterization of available bandwidth probing techniques

IEEE Journal on Selected Areas in Communications

Accurate packet-by-packet measurement and analysis of video streams across an Internet tight link

Image Communication
Combined terminal and network measurement system for bottleneck localization

Proceedings of the 4th International Conference on Testbeds and research infrastructures for the development of networks & communities
On the Identifiability of Link Service Curves from End-Host Measurements

Network Control and Optimization
Evolving toward the perfect schedule: co-scheduling job assignments and data replication in wide-area systems using a genetic algorithm

JSSPP'05 Proceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing
Measuring bandwidth between planetlab nodes

PAM'05 Proceedings of the 6th international conference on Passive and Active Network Measurement

Quantified Score

Hi-index	0.00

Visualization

Abstract

STAB is a new edge-based probing tool to locate thin links on an end-to-end network path in space and over time. Thin links are those links with less available bandwidth than all links preceding them on the path. STAB uses special chirp-probing trains that allow accurate estimation of available bandwidth using few packets. Thin-link localization helps network operations and troubleshooting, provides insight into the causes of network congestion, as well as aids network-aware applications. The authors review the current state-of-the-art available bandwidth tools, describe the working of STAB, and validate it through Internet experiments and simulations.