Exploiting Internet Route Sharing for Large Scale Available Bandwidth Estimation

Recent progress in active measurement techniques has made it possible to estimate end-to-end path available bandwidth. However, how to efficiently obtain available bandwidth information for the N2 paths in a large N-node system remains an open problem. While researchers have developed coordinate-based models that allow any node to quickly and accurately estimate latency in a scalable fashion, no such models exist for available bandwidth. In this paper we introduce BRoute — a scalable available bandwidth estimation system that is based on a route sharing model. The characteristics of BRoute are that its overhead is linear with the number of end nodes in the system, and that it requires only limited cooperation among end nodes. BRoute leverages the fact that most Internet bottlenecks are on path edges, and that edges are shared by many different paths. It uses AS-level source and sink trees to characterize and infer path-edge sharing in a scalable fashion. In this paper, we describe ...

• Type: Conference
• Year: 2005
• Where: IMC
• Authors: Ningning Hu, Peter Steenkiste
• Keywords: Available Bandwidth, IMC 2005, Path Available Bandwidth, Scalable Available Bandwidth