Optimization algorithms for multi-service IP network planning

  • Authors:
  • Thi-Thanh-Mai Hoang

  • Affiliations:
  • University of Potsdam, Potsdam, Germany

  • Venue:
  • SpringSim '07 Proceedings of the 2007 spring simulation multiconference - Volume 2
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Multi-service IP network planning aims to determine a cost-effective network resource needed to carry current volumes of both real-time and elastic traffic under consideration of their service differentiation and QoS requirements. Determining where to add bandwidth or expand routing and how to dimension the links are the most fundamental multi-service IP network planning decision which is a hard and large scale combinatorial problem in which the number of options to be analyzed increases exponentially with the size of the network and with the amount of traffic demands. For solving this problem, a combination of heuristic and optimization algorithms is required. This paper describes the multi-service IP network planning problem and presents the optimization algorithms (OSPF routing optimization for IP network planning, Genetic algorithms for IP traffic mapping and for capacity assignment, and the heuristics for link elimination) as an efficient solution for this. Computational test with different IP backbones ware carried out with insightful results.