Restricted dynamic Steiner trees for scalable multicast in datagram networks

The paper addresses the issue of minimizing the number of nodes involved in the routing over a multicast tree and in the maintenance of such a tree in a datagram network. It presents a scheme where the tree routing and maintenance burden is laid only upon the source node and the destination nodes associated with the multicast tree. The main concepts behind this scheme is to view each multicast tree as a collection of unicast paths, and to locate only the multicast source and destination nodes on the junctions of their multicast tree. The paper shows that despite of this restriction, the cost of the created multicast trees is not necessarily higher than the cost of the trees created by other algorithms that do not impose the restriction and therefore require all the nodes along the data path of a tree to participate in the routing over the tree and in the maintenance of the tree.

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

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

[3]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[4]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1994, JACM.

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

[6]  Anujan Varma,et al.  ARIES: A Rearrangeable Inexpensive Edge-Based On-Line Steiner Algorithm , 1997, IEEE J. Sel. Areas Commun..

[7]  V. Jacobson,et al.  Protocol Independent Multicast (PIM): Motivation and Architecture , 1995 .

[8]  H. Pollak,et al.  Steiner Minimal Trees , 1968 .

[9]  Anujan Varma,et al.  ARIES: a rearrangeable inexpensive edge-based on-line Steiner algorithm , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

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

[11]  Anujan Varma,et al.  Distributed algorithms for multicast path setup in data networks , 1996, TNET.

[12]  William Allen Simpson,et al.  IP in IP Tunneling , 1995, RFC.

[13]  Graham Knight,et al.  Comparison of dynamic multicast routing algorithms for wide-area packet switched (asynchronous transfer mode) networks , 1995, Proceedings of INFOCOM'95.

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

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

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

[17]  Reuven Cohen,et al.  Restricted dynamic Steiner trees for scalable multicast in datagram networks , 1998, TNET.

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

[19]  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.

[20]  John Moy,et al.  Multicast routing extensions for OSPF , 1994, CACM.

[21]  Stephen E. Deering,et al.  Distance Vector Multicast Routing Protocol , 1988, RFC.

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