On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A case for end system multicast (keynote address)
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Topology-aware overlay networks for group communication
NOSSDAV '02 Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video
Managing End-to-End Network Performance via Optimized Monitoring Strategies
Journal of Network and Systems Management
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Measuring ISP topologies with rocketfuel
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Scalable application layer multicast
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
Backup Path Allocation Based on a Correlated Link Failure Probability Model in Overlay Networks
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
A Distributed Approach to Topology-Aware Overlay Path Monitoring
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
An algebraic approach to practical and scalable overlay network monitoring
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Underlay-aware overlay networks
Underlay-aware overlay networks
Service Clouds: A Distributed Infrastructure for Constructing Autonomic Communication Services
DASC '06 Proceedings of the 2nd IEEE International Symposium on Dependable, Autonomic and Secure Computing
Approximation algorithms for combinatorial problems
Journal of Computer and System Sciences
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
An OSPF topology server: design and evaluation
IEEE Journal on Selected Areas in Communications
Empirical tests of anonymous voice over IP
Journal of Network and Computer Applications
| Hi-index | 0.24 |
Path probing is essential to maintaining an efficient overlay network topology. However, the cost of a full-scale probing is as high as O(n^2), which is prohibitive in large-scale overlay networks. Several methods have been proposed to reduce probing overhead, although at a cost in terms of probing completeness. In this paper, an orthogonal solution is proposed that trades probing overhead for estimation accuracy in sparse networks such as the Internet. The proposed solution uses network-level path composition information (for example, as provided by a topology server) to infer path quality without full-scale probing. The inference metrics include latency, loss rate and available bandwidth. This approach is used to design several probing algorithms, which are evaluated through extensive simulation. The results show that the proposed method can reduce probing overhead significantly while providing bounded quality estimations for all of the nx(n-1) overlay paths. The solution is well suited to medium-scale overlay networks in the Internet. In other environments, it can be combined with extant probing algorithms to further improve performance.