Exact Planning of GMPLS-Based Transport Networks with Conversion and Regeneration Capabilities

Nabil Naas and Hussein Mouftah

11th Communications and Networking Simulation Symposium (CNS 2008)
Ottawa, Canada, April 14-17 2008

---

Summary

With the ever-increasing traffic in WDM-based transport networks, the development of GMPLS (or multi-granularity)-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 will call such a 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 problem is solved for small-sized problems. The solutions of the MILP model are used as valuable quality references for developed sub-optimum methods, which we have proposed in a previous work to solve the RMGPA problem heuristically.

---

  

START Conference Manager (V2.54.5)