Reliable Critical Infrastructure: Multiple Failures for Multicast using Multi-Objective Approach


  • Ferney A. Maldonado-Lopez Universidad de los Andes, Bogota
  • Yezid Donoso Universidad de los Andes, Bogota


resilience, protection, survivability networks, multi-objective evolutionary algorithm


Multicast is the keystone for multimedia Internet. Multicast is one of the new and most used services in telecommunication networks. However, these networks meet big challenges when facing failures from diverse factors, including natural disasters and bad configurations. Networks operators need to establish mechanisms to maintain available multicast services, and plan actions to handle incidents. We study and implement an elitist evolutionary algorithm based on Strength Pareto Evolutionary Algorithm - SPEA. Our implementation recalculates network routes, even when there are multiple failures. The results indicate that our product finds lower-cost and higheravailability multicast tree to protect multicast services.


James P.G. Sterbenz, David Hutchison, Egemen K. Çetinkaya, Abdul Jabbar, Justin P. Rohrer, Marcus Schller, Paul Smith, Resilience and survivability in communication networks: Strategies, principles, and survey of disciplines, Computer Networks, 54(8):1245-1265, 2010.

M. Zotkiewicz, and W. Ben-Ameur, and M. Pióro, Finding Failure-Disjoint Paths for Path Diversity Protection in Communication Networks, Communications Letters, IEEE 14:776- 778, 2010.

Jia Weijia, Cao Jiannong, Jia Xiaohua, H. Lee Chan, Design and analysis of an efficient and reliable atomic multicast protocol, Computer Communications, 21:37-53, 1988.

Medard, M. and Finn, S.G. and Barry, R.A. and Gallager, R.G., Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs, Networking, IEEE/ACM Transactions on, 5(7):641-652, 1999.

A. V. Panyukov, The Steiner Problem in Graphs: Topological Methods of Solution, Automation and Remote Control, 65:439-448, 2004.

H. Takahashi, and A. Matsuyama, An approximate solution for the Steiner problem in graphs, Math Japonica, 24:573-577, 1980.

K. Singhal Narendra, and Ou Canhui, and Mukherjee Biswanath, Cross-sharing s. self-sharing trees for protecting multicast sessions in mesh networks, Computer Networks, 50:200-206, 2006.

Yang Chyi-Bao, and Wen Ue-Pyng, Applying tabu search to backup path planning for multicast networks, Computers & Operations Research, 32:2875-2889, 2005.

E. Zitzler, and L. Thiele, Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach, Evolutionary Computation, IEEE Transactions on, 3:257- 271, 1999.

Deb Kalyanmoy, Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach, Wiley, Chichestr, New York, 2001.

Yezid Donoso and Ramon Fabregat, Multi-Objective Optimization in Computer Networks Using Metaheuristics, Auerbach Publications, 2007.

Chern Maw-Sheng, On the computational complexity of reliability redundancy allocation in a series system, Operations Research Letters. 11:309-315, 1992.



Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.