Exact planning of GMPLS-based transport networks with conversion and regeneration capabilities

  • Authors:
  • Nabil Naas;Hussein Mouftah

  • Affiliations:
  • University of Ottawa, Canada;University of Ottawa, Canada

  • Venue:
  • Proceedings of the 11th communications and networking simulation symposium
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

With the ever-increasing traffic in WDM-based transport networks, the development of GMPLS (or multi-granular)-based transport networks becomes essential to avoid the cost explosion of OXCs and ROADMs. This paper addresses the optimal planning problem of the GMPLS-based transport network by (1) considering the whole traffic hierarchy defined in GMPLS; (2) allowing the optical signal conversion at all granularity levels; (3) imposing the optical reach constraint on the length of all-optical paths. We call such a planning problem the Routing and Multi-Granular Paths Assignment (RMGPA). The objective of the problem is to minimize the total weighted port count in the transport network. The RMGPA problem is formulated as a Mixed Integer Linear Programming (MILP) model. Due to the computational complexity of the problem, the MILP model is solved for small-sized planning problems. The solutions of the MILP model are used as valuable quality references for previously developed sub-optimum methods, which we have proposed in a previous work to solve large-sized planning problems in a reasonable amount of time.