On investigating overlay service topologies

Recently, a moderate amount of work has been reported on the use of overlay networks to support value-added network services, such as multicasting, Quality-of-Service (QoS), security, etc. To design an overlay network, the first step is to choose an overlay topology connecting all the overlay service nodes. When considering overlay topologies, several questions need to be answered first: How overlay topologies affect overlay routing performance? Which topologies can provide satisfactory performance? How can we construct efficient overlay topologies connecting all the overlay nodes? In this paper, we focus on the overlay network topology construction issue. First, we evaluate and compare the performance and overhead of the existing overlay topologies. Second, we formalize the overlay topology construction problem and propose two new heuristic methods to construct efficient overlay topologies. Simulation results have demonstrated the efficiency of the two proposed approaches. It is shown that overlay service performance varies significantly with respect to different overlay topologies. Thus, it is important to choose an appropriate overlay network topology. The knowledge of IP-layer topology information also benefits significantly in constructing efficient overlay topologies as inferred from the results.

[1]  Robert Tappan Morris,et al.  Resilient overlay networks , 2001, SOSP.

[2]  David Watson,et al.  Topology aware overlay networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[3]  Ratul Mahajan,et al.  Measuring ISP topologies with rocketfuel , 2002, TNET.

[4]  Prasant Mohapatra,et al.  QRON: QoS-aware routing in overlay networks , 2004, IEEE Journal on Selected Areas in Communications.

[5]  Amin Vahdat,et al.  Opus: an overlay peer utility service , 2002, 2002 IEEE Open Architectures and Network Programming Proceedings. OPENARCH 2002 (Cat. No.02EX571).

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

[7]  Steven McCanne,et al.  RMX: reliable multicast for heterogeneous networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[8]  Kirk L. Johnson,et al.  Overcast: reliable multicasting with on overlay network , 2000, OSDI.

[9]  Yin Zhang,et al.  On selfish routing in internet-like environments , 2006, TNET.

[10]  Eranda Çela,et al.  The quadratic assignment problem : theory and algorithms , 1999 .

[11]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

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

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

[14]  Akihiro Nakao,et al.  A routing underlay for overlay networks , 2003, SIGCOMM '03.

[15]  Lixia Zhang,et al.  Host multicast: a framework for delivering multicast to end users , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[16]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[17]  Randy H. Katz,et al.  OverQoS: offering Internet QoS using overlays , 2003, CCRV.

[18]  Yiwei Thomas Hou,et al.  Bandwidth provisioning for service overlay networks , 2002, SPIE ITCom.

[19]  Bobby Bhattacharjee,et al.  Scalable application layer multicast , 2002, SIGCOMM 2002.

[20]  John G. Apostolopoulos,et al.  On multiple description streaming with content delivery networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[21]  Ben Y. Zhao,et al.  Exploiting routing redundancy via structured peer-to-peer overlays , 2003, 11th IEEE International Conference on Network Protocols, 2003. Proceedings..

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

[23]  Huai-Rong Shao,et al.  A new multi-path selection scheme for video streaming on overlay networks , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[24]  Anthony Young,et al.  Overlay mesh construction using interleaved spanning trees , 2004, IEEE INFOCOM 2004.

[25]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[26]  Hans Eriksson,et al.  MBONE: the multicast backbone , 1994, CACM.

[27]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

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

[29]  Ben Y. Zhao,et al.  Tapestry: a resilient global-scale overlay for service deployment , 2004, IEEE Journal on Selected Areas in Communications.

[30]  Paul Francis,et al.  Yoid: Extending the Internet Multicast Architec-ture , 2000 .

[31]  Prasant Mohapatra,et al.  HostCast: a new overlay multicasting protocol , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[32]  Roger Wattenhofer,et al.  The impact of Internet policy and topology on delayed routing convergence , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[33]  Aravind Srinivasan,et al.  Resilient multicast using overlays , 2003, IEEE/ACM Transactions on Networking.