Quasi-hierarchical evolutionary algorithm for flow optimization in survivable MPLS networks

Authors:
Michał Przewozniczek;Krzysztof Walkowiak
Affiliations:
Faculty of Computer Science and Management, Wroclaw University of Technology, Wroclaw, Poland;Chair of Systems and Computer Networks, Faculty of Electronics, Wroclaw University of Technology, Wroclaw, Poland
Venue:
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
Year:
2007

Citing 4
Cited 0

Topological design of local-area networks using genetic algorithms

IEEE/ACM Transactions on Networking (TON)
Routing, Flow, and Capacity Design in Communication and Computer Networks

Routing, Flow, and Capacity Design in Communication and Computer Networks
Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking

Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking
Evolutionary algorithm for congestion problem in connection-oriented networks

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.