In this paper we address the problem of working paths optimization in survivable MPLS network. We focus on an existing facility network, in which only network flows can be optimized to provide network survivability using the local repair strategy. The main goal of our work is to develop an effective evolutionary algorithm (EA) for considered optimization problem. The novelty is that the proposed algorithm consists of two levels. The "high" level applies typical EA operators. The "low" level idea is based on the hierarchical algorithm idea. However, the presented approach is not a classical hierarchical algorithm. Therefore, we call the algorithm quasi-hierarchical. We present a precise description of the algorithm and results of simulations run over various networks. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Przewoźniczek, M., & Walkowiak, K. (2007). Quasi-hierarchical evolutionary algorithm for flow optimization in survivable MPLS networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4707 LNCS, pp. 330–342). Springer Verlag. https://doi.org/10.1007/978-3-540-74484-9_29
Mendeley helps you to discover research relevant for your work.