Abstract
Multimedia applications, such as videoconferences, require an efficient management of the Quality of Service (QoS) and consist of a great number of participants which requires the use of multicast routing protocol. Unlike unicast protocol, multicast protocol handles a great number of users while minimizing both network overhead and bandwidth consumption. However, combining multicast routing and QoS guarantee is a hard challenging task, known as the delay and delay variation multicast problem. This problem is considered as an NP-complete problem, and is resolved only by heuristic solutions. In this paper, we propose a scalable multicast algorithm that tackle the delay and delay variation by exploiting the Hierarchic Tree construction concepts. In fact, the proposal algorithm guarantees QoS by: (i) reducing the network charge; (ii) decreasing the multicast delay variation. We compare the performance of our algorithm against the DDVCA (Delay and Delay Variation Constraint Algorithm) scheme and demonstrate lower multicast delay variation and efficient bandwidth utilization while maintaining lower time complexity.
Chapter PDF
References
Ksentini, A., et al.: Novel Architecture for reliable H.26L video transmission over IEEE 802.11e. In: Proc. IEEE PIMRC 2005, Barcelona, Spain (2005)
Weitzman, D., Partridge, C.: Distance Vector Multicast Routing Protocol. RFC 1075 (November 1998)
Deering, S., et al.: Protocol Independent Multicast-Dense Mode (PIM-DM): Protocol Specification. RFC 2365 (July 1998)
Moy, J.: Multicast Extension to OSPF. RFC 1584, Mars (1994)
Estrin, D., et al.: Protocol Independent Multicast-Sparse Mode (PIM-SM): Protocol Specification. IETF RFC 2362 (June 1998)
Striegel, A., Manimaran, G.: Survey of QoS Multicasting Issues. IEEE Communications Magazine, 82–87 (June 2002)
Rouskas, G.N., Baldine, I.: Multicast routing with end-to-end delay and delay variation constraints. In: IEEE JSAC, pp. 346–356 (April 1997)
Sheu, P.-R., Chen, S.-T.: A fast and efficient heuristic algorithm for the delay and delay variation bound multicast tree problem. In: Information Networking, Proc. ICOIN-15, pp. 611–618 (January 2001)
Benslimane, A., Moussaoui, O.: A scalable Multicast Protocol with QoS guarantees. In: Proc. of IEEE/IFIP Net-Con 2003, Muscat, Oman (October 2003)
Wang, B., Hou, J.C.: Multicast Routing and its QoS Extension: Problems, Algorithms, and Protocols. IEEE Networks (January/ February 2000)
Ballardie, A.: Core Based Trees (CBT Version 2) Multicast Routing: protocol specification. IETF RFC 2189 (September 1997)
Dijkstra, E.W.: A note on two problems in connection with graphs. Numeric Mathematic 1, 269–271 (1959)
Network Simulator 2, ns-2, http://www.isi.edu/nsnam
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 IFIP International Federation for Information Processing
About this paper
Cite this paper
Moussaoui, O., Ksentini, A., Naïmi, M., Gueroui, A. (2005). Multicast Tree Construction with QoS Guaranties. In: Dalmau Royo, J., Hasegawa, G. (eds) Management of Multimedia Networks and Services. MMNS 2005. Lecture Notes in Computer Science, vol 3754. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11572831_9
Download citation
DOI: https://doi.org/10.1007/11572831_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29641-6
Online ISBN: 978-3-540-32090-6
eBook Packages: Computer ScienceComputer Science (R0)