A distributed approach to topology-aware overlay path monitoring

Path probing is essential to maintain an efficient overlay network topology. However, the cost of complete probing can be as high as O(n/sup 2/), which is prohibitive in large-scale 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/spl times/(n-1) overlay paths, while actually probing only a subset of the paths. We propose and evaluate a distributed approach to implement 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.

[1]  Robert D. Nowak,et al.  Passive network tomography using EM algorithms , 2001, 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221).

[2]  Hari Balakrishnan,et al.  Resilient overlay networks , 2001, SOSP.

[3]  Randy H. Katz,et al.  Backup path allocation based on a correlated link failure probability model in overlay networks , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

[4]  Donald F. Towsley,et al.  Network tomography on general topologies , 2002, SIGMETRICS '02.

[5]  Jonathan S. Turner,et al.  Routing in overlay multicast networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[6]  Ratul Mahajan,et al.  Measuring ISP topologies with Rocketfuel , 2004, IEEE/ACM Transactions on Networking.

[7]  Albert G. Greenberg,et al.  An OSPF topology server: design and evaluation , 2002, IEEE J. Sel. Areas Commun..

[8]  Robert Nowak,et al.  Internet tomography , 2002, IEEE Signal Process. Mag..

[9]  Sonia Fahmy,et al.  Topology-aware overlay networks for group communication , 2002, NOSSDAV '02.

[10]  Philip K. McKinley,et al.  On the cost-quality tradeoff in topology-aware overlay path probing , 2003, 11th IEEE International Conference on Network Protocols, 2003. Proceedings..

[11]  Philip K. McKinley,et al.  Switch-aided flooding operations in ATM networks , 1997, Proceedings of INFOCOM '97.

[12]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[13]  Helen J. Wang,et al.  Server-based inference of Internet link lossiness , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[14]  Robert D. Nowak,et al.  Maximum likelihood network topology identification from edge-based unicast measurements , 2002, SIGMETRICS '02.

[15]  Narsingh Deo,et al.  Random-tree Diameter and the Diameter-constrained MST , 2002, Int. J. Comput. Math..

[16]  FaloutsosMichalis,et al.  On power-law relationships of the Internet topology , 1999 .

[17]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[18]  Donald F. Towsley,et al.  Inferring link loss using striped unicast probes , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[19]  Yin Zhang,et al.  On the constancy of internet path properties , 2001, IMW '01.