Abstract
This paper presents a new multiobjective multicast routing algorithm (MMA) based on the Strength Pareto Evolutionary Algorithm (SPEA), which simultaneously optimizes the cost of the tree, the maximum end-to-end delay, the average delay and the maximum link utilization. In this way, a set of optimal solutions, known as Pareto set, is calculated in only one run, without a priori restrictions. Simulation results show that MMA is able to find Pareto optimal solutions. They also show that for the constrained end-to-end delay problem in which the traffic demands arrive one by one, MMA outperforms the shortest path algorithm in maximum link utilization and total cost metrics.
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.
References
Tanenbaum, A.: Computer Networks. Prentice-Hall, Englewood Cliffs (2003)
Lee, Y., Seok, Y., Choi, Y.: Explicit Multicast Routing Algorithm for Constrained Traffic Engineering. In: Proc. of 7th Int. Symp. on Computer and Comm, ISCC 2002 (2002)
Kompella, V., Gupta, A.: Multicast routing in multimedia communication. IEEE/ACM Transactions on Networking 1(3), 286–291 (1993)
Ravikumar, C.P., Bajpai, R.: Source-based delay bounded multicasting in multimedia networks. Computer Communications 21, 126–132 (1998)
Zhengying, W., Bingxin, S., Erdun, Z.: Bandwidth-delay-constraint least-cost multicast routing based on heuristic genetic algorithm. Computer Communications 24, 685–692 (2001)
de Araujo, P.T., Barbosa, G.M.: Proceedings of the VII Brazilian Symposium on Neural Networks (SBRN 2002). In: Proceedings of the VII Brazilian Symposium on Neural Networks, SBRN 2002 (2002)
Zitzler, E., Thiele, L.: Multiobjective Evolutionary Algorithms: A comparative Case Study and the Strength Pareto Approach. IEEE Trans. Evolutionary Computation 3(4), 257–271 (1999)
Goldberg, D.: Genetic Algorithm is Search, Optimization & Machine Learning. Addison-Wesley, Reading (1989)
Hwang, R.H., Do, W.Y., Yang, S.C.: Multicast Routing Based on Genetic Algorithms. Journal of Information Science and Engineering 16, 885–901 (2000)
Yen, J.: Finding the k shortest loopless path in a network. Management Science 17, 712–716 (1971)
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
Crichigno, J., Barán, B. (2004). Multiobjective Multicast Routing Algorithm. In: de Souza, J.N., Dini, P., Lorenz, P. (eds) Telecommunications and Networking - ICT 2004. ICT 2004. Lecture Notes in Computer Science, vol 3124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27824-5_134
Download citation
DOI: https://doi.org/10.1007/978-3-540-27824-5_134
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22571-3
Online ISBN: 978-3-540-27824-5
eBook Packages: Springer Book Archive