Abstract
Multicast routing problem in computer networks, with more than one objective to consider, like cost and delay, is usually treated as a mono-objective Optimization Problem, where the cost of the tree is minimized subject to a priori restrictions on the delays from the source to each destination. This paper presents a new multicast algorithm based on the Strength Pareto Evolutionary Algorithm (SPEA), which simultaneously optimizes the cost of the tree, the maximum end-to-end delay and the average delay from the source node to each destination node. Simulation results show that the proposed algorithm is able to find Pareto optimal solutions. In addition, they show that for the problem of minimum cost with constrained end-to-end delay, the proposed algorithm provides better solutions than other well-known alternatives as Shortest Path and KPP algorithms.
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
Tanenbaum, A.: Computer Networks. Prentice-Hall, Englewood Cliffs (2003)
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.: Multicast Routing with Quality of Service and Traffic Engineering Requirements in the Internet, Based On Genetic Algorithm. 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). A Multicast Routing Algorithm Using Multiobjective Optimization. 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_144
Download citation
DOI: https://doi.org/10.1007/978-3-540-27824-5_144
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22571-3
Online ISBN: 978-3-540-27824-5
eBook Packages: Springer Book Archive