Abstract
With the proliferation of multimedia group applications, the construction of multicast trees satisfying QoS requirements is becoming a problem of prime importance. In this paper, we study the delay- and delay variation-bounded multicast tree (DVBMT) problem which is NP-complete. The problem is to construct a spanning tree for destination node, which has the minimized multicast delay variation, and the delay on the path from the source to each destination is bounded. A solution to this problem is required to provide decent real-time communication services such as on-line games, shopping, and teleconferencing. Performance comparison shows that the proposed scheme outperforms DDVCA which is known to be effective so far in any network topology. The enhancement is up to about 3.6%~11.1% in terms of normalized surcharge for DDVCA. The time complexity of our algorithm is O(mn 2).
This paper was supported in part by Brain Korea 21 and University ITRC project. Dr. H. Choo is the corresponding author.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271 (1959)
Gilbert, E.N., Pollak, H.O.: Steiner minimal tree. SIAM J. Appl. Math. 16 (1968)
Hakimi, S.L.: Steiner’s problem in graphs and its implication. Networks 1, 113–133 (1971)
Garey, M.R., Graham, R.L., Johnson, D.S.: The complexity of computing steiner minimal trees. SIAM J. Appl. Math. 32(4), 835–859 (1977)
Takahashi, H., Matsuyame, A.: An approximate solution for the steiner problem in graphs. Mathematica Japonica 24(6), 573–577 (1980)
Kou, L., Markowsky, G., Berman, L.: A fast algorithm for steiner trees. Acta Informatica 15, 141–145 (1981)
Bharath-Kumar, K., Jaffe, J.M.: Routing to multiple destinations in computer networks. IEEE Trans. Commun. COMM-31(3), 343–351 (1983)
Waxman, B.W.: Routing of multipoint connections. IEEE JSAC 6(9), 1617–1622 (1988)
Ballardie, T., Francis, P., Crowcroft, J.: Core based trees (CBT): An architecture for scalable inter-domain multicast routing. Computer Commun. Rev. 23(4), 85–95 (1993)
Kompella, V.P., Pasquale, J.C., Polyzos, G.C.: Multicast routing for multimedia communication. IEEE/ACM Trans. Networking 1(3), 286–292 (1993)
Zhu, Q., Parsa, M., Garcia-Luna-Aceves, J.J.: A source-based algorithm for near-optimum delay-constrained multicasting. In: Proc. IEEE INFOCOM 1995, March 1995, pp. 377–385 (1995)
Rouskas, G.N., Baldine, I.: Multicast routing with end-to-end delay and delay variation constraints. IEEE JSAC 15(3), 346–356 (1997)
Gilbert, E.N., Pollak, H.O.: Steiner minimal tree. SIAM J. Appl. Math. 16 (1968)
Bang, Y.-C., Choo, H.: On multicasting with minimum costs for the Internet topology. In: Monien, B., Feldmann, R.L. (eds.) Euro-Par 2002. LNCS, vol. 2400, pp. 736–744. Springer, Heidelberg (2002)
Rodionov, A.S., Choo, H.: On generating random network structures: Trees. In: Sloot, P.M.A., Abramson, D., Bogdanov, A.V., Gorbachev, Y.E., Dongarra, J., Zomaya, A.Y. (eds.) ICCS 2003. LNCS, vol. 2658, pp. 879–887. Springer, Heidelberg (2003)
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
Kim, M., Bang, YC., Choo, H. (2004). Efficient Algorithm for Reducing Delay Variation on Bounded Multicast Trees. In: Kahng, HK., Goto, S. (eds) Information Networking. Networking Technologies for Broadband and Mobile Networks. ICOIN 2004. Lecture Notes in Computer Science, vol 3090. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25978-7_45
Download citation
DOI: https://doi.org/10.1007/978-3-540-25978-7_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23034-2
Online ISBN: 978-3-540-25978-7
eBook Packages: Springer Book Archive