pathChirp Efficient Available Bandwidth Estimation.ppt

pathChirp Efficient Available Bandwidth Estimation Vinay Ribeiro Rice University Rolf Riedi Jiri Navratil Rich Baraniuk Les Cottrell (Rice) (SLAC) Network Model Packet delay = constant term (propagation, service time) + variable term (queuing delay) Available Bandwidth Unused capacity along path Applications Network monitoring Available Bandwidth Probing Tool Requirements Fast estimate within few RTTs Unobtrusive introduce light probing load Accurate Principle of Self-Induced Congestion Advantages No topology information required Robust to multiple bottlenecks TCP-Vegas uses self-induced congestion principle Trains of Packet-Pairs (TOPP) [Melander et al] Vary sender packet-pair spacing Compute avg. receiver packet-pair spacing Constrained regression based estimate Pathload [Jain Dovrolis] CBR packet trains Vary rate of successive trains Converge to available bandwidth Chirp Packet Trains Exponentially decrease packet spacing within packet train Wide range of probing rates Efficient: few packets Chirps vs. Packet-Pairs Each chirp train of N packets contains N-1 packet pairs at different spacings Reduces load by 50% Chirps: N-1 packet spacings, N packets Packet-pairs: N-1 packet spacings, 2N-2 packets Captures temporal queuing behavior Chirps vs. CBR Trains Multiple rates in each chirping train Allows one estimate per-chirp Potentially more efficient estimation CBR Cross-Traffic Scenario Point of onset of increase in queuing delay gives available bandwidth Bursty Cross-Traffic Scenario Goal: exploit information in queuing delay signature PathChirp Methodology Per-packet pair available bandwidth, (k=packet number) Per-chirp available bandwidth Smooth per-chirp estimate over sliding time window of size Self-Induced Congestion Heuristic Definitions: delay of packet k