Computer
On the topological design of a computer network
Computer Networks and ISDN Systems
Topological design of local-area networks using genetic algorithms
IEEE/ACM Transactions on Networking (TON)
Heuristic algorithms for the terminal assignment problem
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Computer Communications Network Design and Analysis
Computer Communications Network Design and Analysis
Genetic Algorithms
Genetic AlgorithmsNumerical Optimizationand Constraints
Proceedings of the 6th International Conference on Genetic Algorithms
Designing B-ISDN Network Topologies Using The Genetic Algorithm
MASCOTS '97 Proceedings of the 5th International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
MPLS Network Topology Design Using Genetic Algorithms
AICCSA '06 Proceedings of the IEEE International Conference on Computer Systems and Applications
IEEE Transactions on Evolutionary Computation
Applying an evolutionary algorithm to telecommunication networkdesign
IEEE Transactions on Evolutionary Computation
Using a OMNET++ network based simulator as test-bed for network design algorithms
SMO'08 Proceedings of the 8th conference on Simulation, modelling and optimization
A hybrid grouping genetic algorithm for the multiple-type access node location problem
IDEAL'09 Proceedings of the 10th international conference on Intelligent data engineering and automated learning
Computers and Operations Research
A novel grouping harmony search algorithm for the multiple-type access node location problem
Expert Systems with Applications: An International Journal
Hi-index | 0.25 |
This paper proposes a design methodology based on the application of genetic algorithms (GA) to find a minimal-cost topological structure of MPLS-based networks. MPLS technology is currently deployed in designing the backbone infrastructure of service provider networks whereas other parts of the network are still operated using the traditional IP protocol. This makes the overall topological structure of MPLS-based networks naturally breaks into two prime sub-problems: access network design and backbone network design. The ultimate goal is to identify the locations of label-edge routers and label-switching routers, and to determine the interconnection links and their capacities to accommodate expected traffic demands. The locations of label edge routers depend on the demands of a given set of terminal networks which in turn affect the design of the backbone network. This problem is a highly constrained NP-hard optimization problem for which exact solution approaches do not scale well. We first present a multilevel design model that divides the optimal topology design into a set of linear programs. Then, we propose GA-based meta-heuristics for solving them. We also discuss the impact of encoding methods and genetic operators and parameters on the performance. Numerical results for the considered cases show that the proposed methodology is effective and gives optimal or close to optimal solutions as compared with the exact branch and bound method.