Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bauer, F., Varma, A., 1997. ARIES: A rearrangeable inexpensive edge-based on-line Steiner algorithm. IEEE JSAC, 15(3):382–397.
Feng, G., Peter, T., 1999. Efficient multicast routing with delay constraint. International Journal of Communication Systems, 12(3):181–195. [doi:10.1002/(SICI)1099-1131 (199905/06)12:3〈181::AID-DAC394〉3.0.CO;2-Y]
Fujinoki, H., Christensen, K.J., 2000. A routing algorithm for dynamic multicast trees with end-to-end path length control. Computer Communications, 23(2):101–114. [doi:10.1016/S0140-3664(99)00167-X]
Hong, S., Lee, H., Park, B.H., 1998. An Efficient Multicast Routing Algorithm for Delay-sensitive Applications with Dynamic Membership. Proc. of IEEE INFOCOM, p. 1433–1440.
Imase, M., Waxman, B., 1991. Dynamic Steiner tree problems. SIAM J. Disc. Math., 4(3):369–384. [doi:10.1137/0404033]
Kadirire, J., Knight, G., 1995. Comparison of Dynamic Multicast Routing Algorithms for Wide-Area Packet Switched (Asynchronous Transfer Mode). Networks, IEEE INFOCOM, p.212-219.
Kadtie, J., 1994. Minimizing packet copies in multicast routing by exploiting geographic spread. ACM SIGCOMM Computer Communication Review, 24:47–63.
Kheong, C., Siew, D., Feng, G., 2001. Efficient Setup for Multicast Connections Using Tree Caching. Proc. IEEE INFOCOM, p.249-258.
Korkmaz, T., Krunz, M., 2001. A randomized algorithm for finding a path subject to multiple QoS constraints. Computer Networks, 36(2-3):251–268. [doi:10.1016/S1389-1286(00)00209-7]
Lin, H.C., Lai, S.C., 1998. VTDM—A Dynamic Multicast Routing Algorithm. Proc. IEEE INFOCOM’98.
Raghavan, S., Manimaran, G., Siva Ram Murthy, C., 1999. A rearrangeable algorithm for the construction of delay-constrained dynamic multicast trees. IEEE/ACM Trans. Networking, 7(4):514–529. [doi:10.1109/90.793020]
Wang, F.H., Richards, D., 1992. Steiner tree problems. Networks, 22:55–89.
Wang, Z., Shi, B., Zhao, E., 2001. Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm. Computer Communications, 24(7-8):685–692. [doi:10.1016/S0140-3664(00)00273-5]
Waxman, B.M., 1988. Routing of multipoint connections. IEEE Journal on Selected Areas in Communications, 6(9):1617–1622. [doi:10.1109/49.12889]
Winter, P., 1987. Steiner problem in networks: a survey. Networks, 17(2):129–167.
Xiang, F., Luo, J.Z., Wu, J.Y., Gu, G.Q., 1999. QoS routing based on genetic algorithm. Computer Communications, 22(15–16):1392–1399. [doi:10.1016/S0140-3664(99)00113-9]
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chen, L., Xu, Zq. Effective multicasting algorithm for dynamic membership with delay constraint. J. Zhejiang Univ. - Sci. A 7, 156–163 (2006). https://doi.org/10.1631/jzus.2006.A0156
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1631/jzus.2006.A0156