Multiobjective network design for realistic traffic models

Authors:
Nilanjan Banerjee;Rajeev Kumar
Affiliations:
University of Massachusetts, Amherst, MA;Indian Institute of Technology Kharagpur, Kharagpur, WB, India
Venue:
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Year:
2007

Citing 14
Cited 7

Wide area traffic: the failure of Poisson modeling

IEEE/ACM Transactions on Networking (TON)
Approximation algorithms for NP-hard problems

Approximation algorithms for NP-hard problems
Multi-Objective Optimization Using Evolutionary Algorithms

Multi-Objective Optimization Using Evolutionary Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Introduction to Algorithms

Introduction to Algorithms
Using Genetic Algorithms to Design Mesh Networks

Computer
Improved sampling of the Pareto-front in multiobjective genetic optimizations by steady-state evolution: a Pareto converging genetic algorithm

Evolutionary Computation
Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem

Proceedings of the 2003 ACM symposium on Applied computing
Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)

Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)
Multicriteria network design using evolutionary algorithm

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Multiobjective EA approach for improved quality of solutions for spanning tree problem

EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
Applying an evolutionary algorithm to telecommunication networkdesign

IEEE Transactions on Evolutionary Computation
An integrated system for designing minimum cost survivable telecommunications networks

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Multiobjective optimization and multiple constraint handling with evolutionary algorithms. I. A unified formulation

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

Concurrent topology and routing optimization in automotive network integration

Proceedings of the 45th annual Design Automation Conference
Review: Topological network design: A survey

Journal of Network and Computer Applications
Designing heterogeneous ECU networks via compact architecture encoding and hybrid timing analysis

Proceedings of the 46th Annual Design Automation Conference
Solving multi-objective routing and wavelength assignment in WDM network using hybrid evolutionary computation approach

Computer Communications
On a multi-objective evolutionary algorithm for optimizing end-to-end performance of scientific workflows in distributed environments

Proceedings of the 45th Annual Simulation Symposium
Network topology planning using MOEA/D with objective-guided operators

PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part II
Design of network topology based on delay-cost sink tree

International Journal of Communication Networks and Distributed Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

Network topology design problems find application in several reallife scenarios. However, most designs in the past either optimize for a single criterion like delay or assume simplistic traffic models like Poisson. Such assumptions make the solutions inapplicable in the practical world.In this paper, we formulate and solve a multiobjective network topology design problem for a realistic Internet traffic model which is assumed to be self similar. We optimize for the average packet delivery delay and network layout cost to construct realistic network topologies. We present a multiobjective evolutionary algorithm (MOEA) to obtain the diverse near-optimal network topologies. For fair comparison, we design a multiobjective deterministic heuristic based on branch exchange -- we call the heuristic Pareto Branch Exchange (PBE). We empirically show that the MOEA used performs well for real networks of various sizes, and generated topologies are quite different with significantly larger delays for the self similar traffic model.