Abstract
Recent work on multicast routing algorithms in the Internet has introduced new notions of building online multicast tree without a priori knowledge of the future requests. Most of the online multicast routing algorithms aimed to satisfy more number of requests by preserving bandwidth on frequently used links and generate long-hop multicast trees by compromising the hop length. In this paper, we propose an online multicast routing algorithm, wherein rerouting of multicast session is incorporated instead of preserving bandwidth on frequently used links in order to satisfy more number of requests. This enables individual request to have different treatments based on their delay tolerance subject to policy restrictions. Our work focuses on classifying the requests into three classes namely Class-I, Class-II and Class-III and providing the maximum, the best possible and if possible service level in terms of bandwidth and end-to-end delay bound to efficiently utilize the network resources and accepting more user requests. Extensive simulations show that our algorithm provides service level guarantee to the three classes of requests, out performs the existing algorithms in terms of call acceptance ratio and improves the resource utilization.
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.
Similar content being viewed by others
References
L. Sahasrabuddhe and B. Mukherjee, Multicast Routing Algorithms and Protocols: A Tutorial, IEEE Network, Jan./Feb 2000
Striegel, A., Manimaran, G.: A Survey of QoS Multicasting Issues. IEEE Communications Magazine (June 2002)
Wei, L., Estrin, D.: The Trade-offs of Multicast Trees and Algorithms. In: Proceedings of the 1994 International Conference on Computer Communications and Networks, pp. 17–24 (1994)
Fei, A., Gerla, M.: Receiver-initiated multicasting with multiple QoS constraints. In: Proceedings, IEEE INFOCOM 2000 (2000)
Wang, B., Hou, J.C.: Multicast Routing and it QoS Extension: Problems, Algorithms, and Protocols. IEEE Network 14(1), 22–36 (2000)
Chen, S., Nahrstedt, K.: An overview of quality-of-service routing for the next generation high-speed networks: Problems and solutions. IEEE Network, Special Issue on Transmission and Distribution of DigitalVideo (November/December 1998)
Kodialam, M., Lakshman, T.V., Sengupta, S.: Online Multicast Routing With Bandwidth Guarantees: A New Approach Using Multicast Network Flow. IEEE/ACM Transactions on Networking 11(4) (August 2003)
Zappala, D.: Alternate Path Routing for Multicasting. IEEE/ACM Transactions on Networking 12(1) (February 2004)
Faloutsos, M., Banerjea, A., Pankaj, R.: QoSMIC: Quality of service sensitive multicast Internet protocol. In: Proceedings, ACM SIGCOMM (September 1998)
Chen, S., Nahrstedt, K., Shavitt, Y.: A QoS-Aware Multicast Routing Protocol. IEEE JSAC 18(12) (December 2000)
Rouskas, R.N., Baldine, I.: Multicast Routing with End-to-End Delay and Delay Variation Constraints. IEEE JSAC, 346–356 (April 1997)
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
Manoharan, R., Thambidurai, P., Pradhiba, S. (2004). QoS Driven Online Multicast Routing Algorithm. In: Das, G., Gulati, V.P. (eds) Intelligent Information Technology. CIT 2004. Lecture Notes in Computer Science, vol 3356. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30561-3_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-30561-3_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24126-3
Online ISBN: 978-3-540-30561-3
eBook Packages: Computer ScienceComputer Science (R0)