Comparison of dynamic multicast routing algorithms for wide-area packet switched (asynchronous transfer mode) networks

This paper compares three dynamic multipoint routing algorithms for wide-area packet switched networks like asynchronous transfer mode (ATM) networks. The three algorithms compared are the greedy algorithm, the source rooted shortest path (SP) algorithm and the geographic spread dynamic multicast (GSDM) routing algorithm. We present simulation results over random graphs that demonstrate the performance of these algorithms. The algorithms are evaluated via a series of multiple simulations in terms of the number of packet copies per node and their (in)efficiency. A near optimal Steiner tree heuristic algorithm called the KMB algorithm is used as a measure of the (in)efficiency of the algorithms.

[1]  Hideki Tode,et al.  Multicast routing algorithm for nodal load balancing , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

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

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

[4]  Tony T. Lee.  Nonblocking copy networks for multicast packet switching , 1988, IEEE J. Sel. Areas Commun..

[5]  James Kadirire.  Dynamic multicast routing in the Asynchronous Transfer Mode environment , 1996 .

[6]  James Kadirire.  Minimising packet copies in multicast routing by exploiting geographic spread , 1994, CCRV.

[7]  Jonathan S. Turner,et al.  Design of a broadcast packet switching network , 1988, IEEE Trans. Commun..

[8]  J. Kadirire,et al.  Exploiting geographic spread (GS) for wide-area asynchronous transfer mode (ATM) dynamic multipoint routing , 1995 .

[9]  Béla Bollobás,et al.  Random Graphs , 1985 .

[10]  Robert Metcalfe,et al.  Reverse path forwarding of broadcast packets , 1978, CACM.

[11]  Pawel Winter,et al.  Steiner problem in networks: A survey , 1987, Networks.

[12]  Kwang-Ting Cheng,et al.  Virtual path assignment and virtual circuit routing in ATM networks , 1993, Proceedings of GLOBECOM '93. IEEE Global Telecommunications Conference.

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

[14]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[15]  Keith W. Ross,et al.  Routing in virtual path based ATM networks , 1992, [Conference Record] GLOBECOM '92 - Communications for Global Users: IEEE.

[16]  Mostafa H. Ammar,et al.  Routing multipoint connections using virtual paths in an ATM network , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

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