Abstract
Multicasting is an important communication mechanism for implementing real-time multimedia applications, which usually require the underlying network to provide a number of quality-of-service (QoS) guarantees to users. In this paper, we study the problem concerning how to find a feasible multicast tree in which all the multicast paths satisfy the given set of QoS constraints. This problem is referred as the multi-constrained multicast tree (MCMT) problem. Based on tabu-search technique, a heuristic algorithm named MCMTS for the MCMT problem is proposed in this study. According to the experimental results, the probability of finding a feasible multicast tree by our MCMTS method is more than 99% if one exists. Furthermore, the MCMTS is also shown to be a simple and highly efficient method. As a result, it would be a practical approach for developing multicast routing protocol.
Chapter PDF
Similar content being viewed by others
References
Chen, S., Nahrstedt, K.: On Finding Multi-constrained Paths. In: The Proceedings of the ICC 1998 Conference, pp. 874–979. IEEE, Los Alamitos (1998)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Dordrecht (1997)
Jaffe, J.M.: Algorithms for finding paths with multiple constraints. Networks 14, 95–116 (1984)
Korkmaz, T., Krunz, M.: A Randomized Algorithm for Finding a Path Subject to Multiple QoS Constraints. In: The Proceedings of the IEEE Global Telecommunications Conference, pp. 1694–1698. IEEE, Los Alamitos (1999)
Korkmaz, T., Krunz, M., Tragoudas, S.: An efficient algorithm for finding a path subject to two additive constraints. Computer Communications 25, 225–238 (2002)
Kuipers, F., Van Mieghem, P.: MAMCRA: a constrained-based multicast routing algorithm. Computer Communications 25, 802–811 (2002)
Salama, H.: Multicast Routing for Real-Time Communication on High-Speed Networks. Ph.D. dissertation, Dept. of Electrical and Computer Engineering, North Carolina State University (1996)
Salama, H.F., Reeves, D.S., Viniotis, Y.: Evaluation of Multicast Routing Algorithms for Real-Time Communication on High-Speed Networks. IEEE Journal on Selected Areas in Communications 15(3), 332–345 (1997)
Rouskas, G.N., Baldine, I.: Multicast routing with end-to-end delay and delay variation constraints. IEEE Journal on Selected Areas in Communications 15(3), 346–356 (1997)
Verma, S., Pankaj, R.K., Leon-Garica, A.: QoS based multicast routing algorithms for real time applications. Performance Evaluation 34, 273–294 (1998)
Wang, Z., Crowcroft, J.: Quality-of-service routing for supporting multimedia applications. IEEE Journal on Selected Areas in Communications 14(7), 1228–1234 (1996)
Waxman, B.M.: Routing of multicast connections. IEEE Journal on Selected Areas in Communications 6(9), 1617–1622 (1988)
Wu, J.-J., Hwang, R.-H., Lu, H.-I.: Multicast routing with multiple QoS constraints in ATM networks. Information Sciences 124, 29–57 (2000)
Yang, W.-L.: Solving the MCOP Problem Optimally. In: Proceedings of the 27th Annual IEEE Conference on Local Computer Networks (LCN 2002), pp. 100–109. IEEE, Los Alamitos (2002)
Yang, W.-L.: Exact and Heuristic Algorithms for Multi-Constrained Path Selection Problem. In: Chen, Y.-C., Chang, L.-W., Hsu, C.-T. (eds.) PCM 2002. LNCS, vol. 2532, pp. 952–959. Springer, Heidelberg (2002)
Yuan, X., Liu, X.: Heuristic Algorithms for Multi-Constrained Quality of Service Routing. In: The Proceedings of the IEEE INFOCOM Conference, pp. 844–853. IEEE, Los Alamitos (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 IFIP International Federation for Information Processing
About this paper
Cite this paper
Yang, WL. (2003). A Heuristic Algorithm for the Multi-constrained Multicast Tree. In: Marshall, A., Agoulmine, N. (eds) Management of Multimedia Networks and Services. MMNS 2003. Lecture Notes in Computer Science, vol 2839. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39404-4_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-39404-4_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20050-5
Online ISBN: 978-3-540-39404-4
eBook Packages: Springer Book Archive