Paper Info
Title
A Distributed Approach to Topology-Aware Overlay Path Monitoring
Abstract
Path probing is essential to maintaining an efficient overlay network topology. However, the cost of complete probing can be as high as (n2) which is prohibitive in largescale overlay networks. Recently we proposed a method that trades probing overhead for inference accuracy in sparse networks such as the Internet. The method uses physical path information to infer path quality for all of the n 脳 (n-1) overlay paths, while actually probing only a subset of the paths. In this paper we propose and evaluate a distributed approach to implementing this method. We describe a minimum diameter, link-stress bounded overlay spanning tree, which is used to collect and disseminate path quality information. All nodes in the tree collaborate to infer the quality of all paths. Simulation results show this approach can achieve a high-level of inference accuracy while reducing probing overhead and balancing link stress on the spanning tree.
Year
DOI
Venue
2004
10.1109/ICDCS.2004.1281575
ICDCS
Keywords
Field
DocType
link-stress bounded overlay,path quality information,physical path information,path quality,efficient overlay network topology,minimum diameter,largescale overlay network,overlay path,inference accuracy,topology-aware overlay path monitoring,link stress,overlay network,network topology,routing,stress,bandwidth,software engineering,spanning tree,internet
Topology,Inference,Computer science,Computer network,Network topology,Dissemination,Spanning tree,Overlay,Overlay network,Distributed computing,The Internet,Bounded function
Conference
ISSN
ISBN
Citations 
1063-6927
0-7695-2086-3
12
PageRank 
References 
Authors
0.68
14
2
Name
Order
Citations
PageRank
Chiping Tang11489.87
P. K. McKinley21397121.87