On inferring autonomous system relationships in the internet
IEEE/ACM Transactions on Networking (TON)
Measuring ISP topologies with rocketfuel
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
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
Measuring Bottleneck Link Speed in Packet-Switched Networks
Measuring Bottleneck Link Speed in Packet-Switched Networks
Towards an accurate AS-level traceroute tool
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
A measurement study of available bandwidth estimation tools
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Vivaldi: a decentralized network coordinate system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Locating internet bottlenecks: algorithms, measurements, and implications
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Efficient algorithms for large-scale topology discovery
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Optimizing Network Performance In Replicated Hosting
WCW '05 Proceedings of the 10th International Workshop on Web Content Caching and Distribution
Evaluation and characterization of available bandwidth probing techniques
IEEE Journal on Selected Areas in Communications
Lessons from resource allocators for large-scale multiuser testbeds
ACM SIGOPS Operating Systems Review
iPlane: an information plane for distributed services
OSDI '06 Proceedings of the 7th symposium on Operating systems design and implementation
CHESS: An application-aware space for enhanced scalable services in overlay networks
Computer Communications
Synergy: sharing-aware component composition for distributed stream processing systems
Proceedings of the ACM/IFIP/USENIX 2006 International Conference on Middleware
On the Impact of Clustering on Measurement Reduction
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
ThunderDome: discovering upload constraints using decentralized bandwidth tournaments
Proceedings of the 5th international conference on Emerging networking experiments and technologies
Collaborative measurements of upload speeds in P2P systems
INFOCOM'10 Proceedings of the 29th conference on Information communications
Large scale probabilistic available bandwidth estimation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Mitigating interference in a network measurement service
Proceedings of the Nineteenth International Workshop on Quality of Service
Using the last-mile model as a distributed scheme for available bandwidth prediction
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part I
Synergy: sharing-aware component composition for distributed stream processing systems
Middleware'06 Proceedings of the 7th ACM/IFIP/USENIX international conference on Middleware
CCIPCA-OPCSC: An online method for detecting shared congestion paths
Computer Networks: The International Journal of Computer and Telecommunications Networking
Path similarity evaluation using Bloom filters
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
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 the BRoute architecture and evaluate the performance of its components. Initial experiments show that BRoute can infer path edges with an accuracy of over 80%. In a small case study on Planetlab, 80% of the available bandwidth estimates obtained from BRoute are accurate within 50%.