Abstract
With the rapid evolution of real time multimedia applications like audio/video conferencing, interactive distributed games and real time remote control system, a certain Quality of Service (QoS) needs to be guaranteed in underlying networks. Multicast routing algorithms should support the required QoS. There are two important QoS parameters, bounded delay and delay variation, that need to be guaranteed in order to support the real time multimedia applications. Here we solve Delay and delay Variation Bounded Multicast Tree (DVBMT) problem which has been proved to NP-complete. In this paper, we propose an efficient algorithm for DVBMT. The performance enhancement is up to about 21.7% in terms of delay variation as compared to the well-known algorithm, KBC [9].
This research was supported by the Ministry of Information and Communication, Korea under the Information Technology Research Center support program supervised by the Institute of Information Technology Assessment, IITA-2005- (C1090-0501-0019) and the Ministry of Commerce, Industry and Energy under Next-Generation Growth Engine Industry. Dr. Choo is the corresponding author and Dr. Bang is the co-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
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)
Kou, L., Markowsky, G., Berman, L.: A fast algorithm for Steiner trees. Acta Informatica 15, 141–145 (1981)
Takahashi, H., Matsuyama, A.: An Approximate Solution for the Steiner Problem in Graphs. Mathematica Japonica 24(6), 573–577 (1980)
Kompella, V.P., Pasquale, J.C., Polyzos, G.C.: Multicast routing for multimedia communication. IEEE/ACM Trans. Networking 1(3), 286–292 (1993)
Rouskas, G.N., Baldine, I.: Multicast routing with end-to-end delay and delay variation constraints. IEEE JSAC 15(3), 346–356 (1997)
Kim, M., Bang, Y.-C., Choo, H.: On Estimation for Reducing Multicast Delay Variation. In: Yang, L.T., Rana, O.F., Di Martino, B., Dongarra, J. (eds.) HPCC 2005. LNCS, vol. 3726, pp. 117–122. Springer, Heidelberg (2005)
Sheu, P.-R., Chen, S.-T.: A Fast and Efficient Heuristic Algorithm for the Delay- and Delay Variation-Bounded Multicast Tree Problem. Computer Communications 25(8), 825–833 (2002)
Ballardie, A., Cain, B., Zhang, Z.: Core Based Trees (CBT version 3) Multicast Routing protocol specification, Internet Draft, IETF (August 1998)
Kim, M., Bang, Y.-C., Choo, H.: Efficient Algorithm for Reducing Delay Variation on Bounded Multicast Trees. In: Kahng, H.-K., Goto, S. (eds.) ICOIN 2004. LNCS, vol. 3090, pp. 440–450. Springer, Heidelberg (2004)
Kim, M., Bang, Y.-C., Choo, H.: On Algorithm for Efficiently Combining Two Independent Measures in Routing Paths. In: Gervasi, O., Gavrilova, M.L., Kumar, V., Laganá, A., Lee, H.P., Mun, Y., Taniar, D., Tan, C.J.K. (eds.) ICCSA 2005. LNCS, vol. 3483, pp. 989–998. Springer, Heidelberg (2005)
Waxman, B.W.: Routing of multipoint connections. IEEE JSAC 6(9), 1617–1622 (1988)
Doar, M.: Multicast in the ATM environment, Ph.D dissertation, Cambridge University, Computer Lab. (September 1993)
Doar, M.: A Better Mode for Generating Test Networks. In: IEEE Proc. GLOBECOM 1996, pp. 86–93 (1996)
Toh, C.-K.: Performance Evaluation of Crossover Switch Discovery Algorithms for Wireless ATM LANs. In: IEEE Proc. INFOCOM 1996, pp. 1380–1387 (1996)
Zegura, E.W., Calvert, K.L., Bhattacharjee, S.: How to model an Internetwork. In: IEEE Proc. INFOCOM 1996, pp. 594–602 (1996)
Calvert, K.L., Doar, M.: Modelling Internet Topology. IEEE Communications Magazine, 160–163 (June 1997)
Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A., Upfal, E.: Stochastic models for the Web graph. In: Proc. 41st Annual Symposium on Foundations of Computer Science, pp. 57–65 (2000)
Rodionov, A.S., Choo, H.: On Generating Random Network Structures: Connected Graphs. In: Kahng, H.-K., Goto, S. (eds.) ICOIN 2004. LNCS, vol. 3090, pp. 483–491. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, M., Bang, YC., Yang, J.S., Choo, H. (2006). An Efficient Multicast Tree with Delay and Delay Variation Constraints. In: Gavrilova, M., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3982. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751595_118
Download citation
DOI: https://doi.org/10.1007/11751595_118
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34075-1
Online ISBN: 978-3-540-34076-8
eBook Packages: Computer ScienceComputer Science (R0)