A Sequential Algorithm for Constructing Delay-Constrained Multirings for Multipoint-to-Multipoint Communications

IP multicast is a packet distribution technology which allows efficient distribution of information to groups of users. In this paper, we propose a novel ring-based two-level hierarchical structure called a multiring. A multiring is a set of satellite subrings connecting subgroups of users interconnected by a backbone ring. It solves many problems such as ordering, scalability, delay and reliability. We give a mathematical formulation of the delay-constrained multiring construction problem and propose a solution method based on Lagrangean relaxation, which leads to the description of the Multiring Construction Algorithm (MCA). We propose approximate approaches to solve several subproblems in order to accelerate the convergence of the algorithm. We finally show that the multiring topology has many important features that improve network performance and simplify topology rearrangements.

[1]  Oktay Günlük,et al.  The multicast packing problem , 2000, TNET.

[2]  Ellen W. Zegura,et al.  How to model an internetwork , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[3]  Louise E. Moser,et al.  The Totem multiple-ring ordering and topology maintenance protocol , 1998, TOCS.

[4]  S. V. Raghavan,et al.  Survey of multicast routing algorithms and protocols , 2002 .

[5]  Katia Obraczka,et al.  Multicast transport protocols: a survey and taxonomy , 1998, IEEE Commun. Mag..

[6]  Martin Vetterli,et al.  Receiver-driven layered multicast , 1996, SIGCOMM 1996.

[7]  Maria Ramalho,et al.  Intra- and inter-domain multicast routing protocols: A survey and taxonomy , 2000, IEEE Communications Surveys & Tutorials.

[8]  Yoram Ofek,et al.  Reliable Concurrent Multicast from Bursty Sources , 1997, IEEE J. Sel. Areas Commun..

[9]  Donghan Kang,et al.  Design of local networks using USHRs , 2000, Telecommun. Syst..

[10]  Moti Yung,et al.  "Time-driven priority" flow control for real-time heterogeneous internetworking , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[11]  Tony Ballardie,et al.  Core Based Trees (CBT version 2) Multicast Routing - Protocol Specification - , 1997, RFC.

[12]  Christophe Diot,et al.  Deployment issues for the IP multicast service and architecture , 2000, IEEE Netw..

[13]  Paolo Toth,et al.  Exact solution of large-scale, asymmetric traveling salesman problems , 1995, TOMS.

[14]  Louise E. Moser,et al.  The Totem single-ring ordering and membership protocol , 1995, TOCS.

[15]  Jo-Mei Chang,et al.  Reliable broadcast protocols , 1984, TOCS.

[16]  Manuel Laguna,et al.  Clustering for the design of SONET rings in interoffice telecommunications , 1994 .

[17]  Christophe Diot,et al.  Consideration of receiver interest for IP multicast delivery , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[18]  O. J. Wasem,et al.  An algorithm for designing rings for survivable fiber networks , 1991 .

[19]  J. J. Garcia-Luna-Aceves,et al.  Organizing multicast receivers deterministically by packet-loss correlation , 1998, MULTIMEDIA '98.

[20]  Yoram Ofek,et al.  A comparison of ring and tree embedding for real-time group multicast , 2003, TNET.

[21]  Paolo Toth,et al.  Algorithm 750: CDT: a subroutine for the exact solution of large-scale, asymmetric traveling salesman problems , 1995, TOMS.

[22]  David Thaler,et al.  Protocol Independent Multicast-Sparse Mode (PIM-SM): Protocol Specification , 1997, RFC.

[23]  Michael Zyda,et al.  Exploiting reality with multicast groups , 1995, IEEE Computer Graphics and Applications.

[24]  Yoram Ofek,et al.  Performance trade-offs in reliable group multicast protocols , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).