Effective multicasting algorithm for dynamic membership with delay constraint

This paper proposes an effective heuristic algorithm for dynamic multicast routing with delay-constrained DDMR. The tree constructed by DDMR has the following characteristics: (1) multicast tree changes with the dynamic memberships; (2) the cost of the tree is as small as possible at each node addition/removal event; (3) all of the path delay meet a fixed delay constraint; (4) minimal perturbation to an existing tree. The proposed algorithm is based on “damage” and “usefulness” concepts proposed in previous work, and has a new parameter bf (Balancing Factor) for judging whether or not to rearrange a tree region when membership changes. Mutation operation in Genetic Algorithm (GA) is also employed to find an attached node for a new adding node. Simulation showed that our algorithm performs well and is better than static heuristic algorithms, in term of cost especially.

[1]  Gang Feng,et al.  Efficient setup for multicast connections using tree-caching , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[2]  Heesang Lee,et al.  An efficient multicast routing algorithm for delay-sensitive applications with dynamic membership , 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]  Gang Feng,et al.  Efficient multicast routing with delay constraints , 1999, Int. J. Commun. Syst..

[4]  Marwan Krunz,et al.  A randomized algorithm for finding a path subject to multiple QoS requirements , 2001, Comput. Networks.

[5]  Kenneth J. Christensen,et al.  A routing algorithm for dynamic multicast trees with end-to-end path length control , 2000, Comput. Commun..

[6]  Peng Song.  QoS Routing Based on Genetic Algorithm , 2004 .

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

[8]  Erdun Zhao,et al.  Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm , 2001, Comput. Commun..

[9]  Wang Zhengying,et al.  Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm , 2001 .

[10]  Gang Feng,et al.  Efficient multicast routing with delay constraints , 1999, Int. J. Commun. Syst..

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

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

[13]  Marwan Krunz,et al.  A randomized algorithm for finding a path subject to multiple QoS constraints , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

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

[15]  C. Siva Ram Murthy,et al.  A rearrangeable algorithm for the construction of delay-constrained dynamic multicast trees , 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).

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

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

[18]  Hwa-Chun Lin,et al.  VTDM-a dynamic multicast routing algorithm , 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.

[19]  Dana S. Richards,et al.  Steiner tree problems , 1992, Networks.