Measuring link bandwidths using a deterministic model of packet delay

By Kevin Lai, Mary Baker. Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, 2000

474 citations recorded by the source corpus.

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.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering, Management Information Systems

View Paper: https://www.semanticscholar.org/paper/821ffd450311ea686ee5a5e208f1b333254c7229

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Electrical and Electronic Engineering

In Management Information Systems

Citations in the corpus

A Cross-Layer (Layer 2 + 3) Handoff Management Protocol for Next-Generation Wireless Systems (2006, methodology): “For example, techniques such as [16], [ 17 ] can be used to estimate the delay between different networkentitiesthatareinvolvedinthehandoffprocessand, using this information, the handoff signaling delay for intra and intersystem handoff can be estimated.”
UDT: UDP-based data transfer for high-speed wide area networks (2007, background): “The receiver records the inter-arrival time of each packet pair or train and uses a median filter (more complex mechanisms can be found in [44, 50]) on them to compute link capacity.”
End-to-end available bandwidth: measurement methodology, dynamics, and relation with TCP throughput (2002, unknown): “technique of [24] measure per-hop capacity.”
Nettimer: A Tool for Measuring Bottleneck Link Bandwidth (2001, background): “The intuitive rationale for this equation (a full proof is given in [ LB00 ]) is that if two packets are sent close enough together in time to cause the packets to queue together at the bottleneck link (s”
Low-rate TCP-targeted denial of service attacks and counter strategies (2003, methodology): “To generate double-rate DoS streams in real networks, an attacker can use a number of existing techniques to estimate th e bottleneck link capacity [3, 4, 16, 19, 27], bottleneck-bandwi th queue size [21] and secondary bottleneck rate [26].”
Resilient overlay networks (2001, background): “8 Link Bandwidth Probe Tools Nettimer [27] provides both sender and receiver–based bottleneck li nk bandwidth estimation, and, as of this writing, appears to provide the best balance o f accuracy and number of packets required to sample.”
Bandwidth estimation: metrics, measurement techniques, and tools (2003, methodology): “Subsequent work improved the technique in several ways [10], [11], [12].”
Performance evaluation and comparison of Westwood+, New Reno, and Vegas TCP congestion control (2004, background): “Lai and Baker propose an evolution of the PP algorithm for measuring the link bandwidth in FIFO-queuing networks [26].”