Optimizing overlay topology by reducing cut vertices

Overlay networks provide base infrastructures for many areas including multimedia streaming and content distributions. Since most overlay networks are highly decentralized and self-organized, cut vertices may exist in such systems due to the lack of centralized management. A cut vertex is defined as a network node whose removal increases the number of network components. Failure of these nodes can break an overlay into a large number of disconnected components and greatly downgrade the upper layer services like media streaming. We propose here a distributed mechanism, CAM, which efficiently detects the cut vertices before they fail and neutralizes them into normal overlay nodes with slight overhead so that the possibility of network decomposition is minimized after they fail. We prove the correctness of this algorithm and evaluate the performance of our design through trace driven simulations.

[1]  Hui Zhang,et al.  A case for end system multicast (keynote address) , 2000, SIGMETRICS '00.

[2]  Jia Wang,et al.  Analyzing peer-to-peer traffic across large networks , 2002, IMW '02.

[3]  Srinivasan Seshan,et al.  A case for end system multicast , 2002, IEEE J. Sel. Areas Commun..

[4]  Samir Khuller,et al.  Construction of an efficient overlay multicast infrastructure for real-time applications , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[5]  Bobby Bhattacharjee,et al.  Scalable application layer multicast , 2002, SIGCOMM '02.

[6]  Jibin Zhan,et al.  Early Experience with an Internet Broadcast System Based on Overlay Multicast , 2004, USENIX Annual Technical Conference, General Track.

[7]  Brian Neil Levine,et al.  Supporting P2P gaming when players have heterogeneous resources , 2005, NOSSDAV '05.

[8]  Krishna P. Gummadi,et al.  An analysis of Internet content delivery systems , 2002, OPSR.

[9]  Hai Jin,et al.  AnySee: Scalable Live Stream-ing Service Based on Inter-Overlay Optimization , 2006, INFOCOM 2006.

[10]  Li Xiao,et al.  Reliable response delivery in peer-to-peer systems , 2004, The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, 2004. (MASCOTS 2004). Proceedings..

[11]  Helen J. Wang,et al.  Resilient peer-to-peer streaming , 2003, 11th IEEE International Conference on Network Protocols, 2003. Proceedings..

[12]  Brian Larson,et al.  Peer Pressure: Distributed Recovery from Attacks in Peer-to-Peer Systems , 2002, NETWORKING Workshops.

[13]  Stefan Saroiu,et al.  A Measurement Study of Peer-to-Peer File Sharing Systems , 2001 .

[14]  Daeyeon Park,et al.  Mirinae: A peer-to-peer overlay network for large-scale content-based publish/subscribe systems , 2005, NOSSDAV '05.

[15]  Bharat K. Bhargava,et al.  On peer-to-peer media streaming , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[16]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[17]  Cristina L. Abad,et al.  A survey and comparison of end-system overlay multicast solutions suitable for network-centric warfare , 2004, SPIE Defense + Commercial Sensing.

[18]  Fred Buckley,et al.  A Friendly Introduction to Graph Theory , 2002 .

[19]  Li Xiao,et al.  A distributed approach to solving overlay mismatching problem , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..