Abstract
The CRMR, which is an algorithm for updating multicast tree dynamically, is presented. It constructs an initial multicast tree using KPP and builds a virtual trunk (VT) simultaneously. The nodes of the VT are relatively stable and nodes changes are based on the VT. The algorithm employs trigger function (TF) that associates QoS reduction caused by members update in this region, at the same time the algorithm satisfies delay constraints. We compare the performance of CRMR algorithm, by simulation, with others. The simulation results indicate that CRMR algorithm provides better balance between cost performance and changes in the multicast tree after each update. We also introduce into bandwidth indication function to alter CRMR algorithm to multiple QoS guaranteed algorithm, which can deal with the constraints of bandwidth and delay.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dreyfus, S.E., Wagner, R.A.: The Steiner Problem in graphs. Networks 1(3), 195–207 (1971)
Garey, M.L., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NPCompleteness. W H Freeman, San Francisco (1979)
Winter, P.: Steiner problem in networks: A survey. Networks 17(2), 129–167 (1987)
Waxman, B.: Routing of multipoint connections. IEEE J. Select. Areas Commun. 6, 1617–1622 (1988)
Lin, H., Lai, S.: VTDM-A dynamic multicast routing algorithm. In: Proc. of IEEE INFOCOM 1998, San Francisco, California, USA, March 31-April 2, pp. 1426–1432 (1998)
Imase, M., Waxman, B.: Dynamic Steiner Tree Problems. SIAM J. Disc. Math. 4(3), 369–384 (1991)
Kadirire, J., Knight, G.: Comparison of Dynamic Multicast Routing Algorithm for Wide-area Packet Switched (Asynchronous Transfer Mode) Networks. In: Proc. of IEEE INFOCOM, April 1995, pp. 212–219 (1995)
Bauer, F., Varma, A.: ARIES: A Rearrangeable Inexpensive Edge-Based On-Line Steiner Algorithm. IEEE J. Select. Areas Commun. 15(3), 382–397 (1999)
Raghavan, S., Manimaran, G., Siva Ram Murthy, C.: A Rearrangeable Algorithm for the Construction of Delay-Constrained Dynamic Multicast Trees. IEEE/ACM Trans. Networking 7(4), 514–529 (1999)
Kompella, V.P., Pasquale, J.C., Polyzos, G.C.: Multimedia Routing for Multimedia Communication[J]. IEEE/ACM Trans. Networking 1(3), 286–292 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, X., Huan, D., Dong, Y., Zhou, X. (2004). A Multicast Routing Algorithm for CSCW. In: Li, M., Sun, XH., Deng, Q., Ni, J. (eds) Grid and Cooperative Computing. GCC 2003. Lecture Notes in Computer Science, vol 3033. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24680-0_159
Download citation
DOI: https://doi.org/10.1007/978-3-540-24680-0_159
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21993-4
Online ISBN: 978-3-540-24680-0
eBook Packages: Springer Book Archive