Analysis of the performance of dynamic multicast routing algorithms

In this article, three new dynamic, low delay multicast routing algorithms based on the greedy tree technique are proposed; Source Optimised Tree (SOPT), Topology based Optimisation Tree (TOPT) and Minimum Diameter Tree (MDT). A simulation analysis is presented showing the various performance aspects of the algorithms, in which a comparison is made with the greedy and Core Based Tree (CBT) techniques. The effects of the tree source location on dynamic membership change are also examined. The simulations demonstrate that the SOPT algorithm achieves a significant improvement in terms of delay and link usage when compared to the CBT, and the greedy algorithm.

[1]  Stephen E. Deering,et al.  Multicast routing in datagram internetworks and extended LANs , 1990, TOCS.

[2]  Oktay Günlük,et al.  Optimal packing of group multicastings , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[3]  K. Bharath-Kumar,et al.  Routing to Multiple Destinations in Computer Networks , 1983, IEEE Trans. Commun..

[4]  Ellen W. Zegura,et al.  Core selection methods for multicast routing , 1995, Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95.

[5]  Makoto Imase,et al.  Dynamic Steiner Tree Problem , 1991, SIAM J. Discret. Math..

[6]  Niki Pissinou,et al.  Efficient solutions to multicast routing in communication networks , 1996, Mob. Networks Appl..

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

[8]  T. C. Hu.  Optimum Communication Spanning Trees , 1974, SIAM J. Comput..

[9]  Paul Francis,et al.  Core based trees (CBT) , 1993, SIGCOMM 1993.

[10]  Bernard M. Waxman,et al.  Performance evaluation of multipoint routing algorithms , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[11]  George C. Polyzos,et al.  Multicasting for multimedia applications , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[12]  George N. Rouskas,et al.  Multicast Routing with End-to-End Delay and Delay Variation Constraints , 1997, IEEE J. Sel. Areas Commun..

[13]  Ian M. Leslie,et al.  How bad is naive multicast routing? , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[14]  George C. Polyzos,et al.  Multicast routing for multimedia communication , 1993, TNET.

[15]  Daniel J. Rosenkrantz,et al.  An Analysis of Several Heuristics for the Traveling Salesman Problem , 1977, SIAM J. Comput..

[16]  Ellen W. Zegura,et al.  Center selection and migration for wide-area multicast routing , 1997, J. High Speed Networks.

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

[18]  D. W. Wall.  Mechanisms for broadcast and selective broadcast , 1980 .

[19]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[20]  Jaihyung Cho,et al.  A flood routing method for data networks , 1997, Proceedings of ICICS, 1997 International Conference on Information, Communications and Signal Processing. Theme: Trends in Information Systems Engineering and Wireless Multimedia Communications (Cat..