• Please send your full manuscript to: jcm@etpub.com

A Heuristic Algorithm for Designing OTN Over Flexible- Grid DWDM Networks

João R. Santos 1,3, António Eira1,2, and João Pires 2,3
1. Coriant Portugal, Lisboa, Portugal.
2. Instituto de Telecomunicações, Instituto Superior Técnico, Universidade de Lisboa, Lisboa, Portugal.
3. Instituto Superior Técnico, Universidade de Lisboa, Lisboa, Portugal.
Abstract—The efficient utilization of network resources is a fundamental property that is best exploited through multi-layer networks. The Optical Transport Network (OTN) over Dense Wavelength Division Multiplexing (DWDM) is based on the multi-layer concept. These networks, while combining the grooming capabilities offered by the OTN switches with the optical bypass inherent to the Reconfigurable Optical Add-Drop Multiplexers (ROADMs) have the potential to reduce the required network resources and achieve cost efficient designs. Furthermore, an additional degree of flexibility can be added by using flexible-grid solutions for the DWDM layer. In order to explore the full potential of these networks it is import to apply adequate algorithms to design them in an efficient way. With this aim, we propose in this paper a novel heuristic algorithm to solve the routing and grooming problem in the context of OTN/ flexible-grid DWDM networks. The algorithm is based on the concept of an auxiliary graph and operates iteratively, first obtaining an approximated solution and then successively improving it. This algorithm is applied to multiple network scenarios regarding topology, traffic distribution and available transmission formats, in order to quantify the efficiency benefits of deploying flexible-grid formats.

Index Terms—Optical networks, OTN, flexible-grid DWDM, routing, grooming, heuristic algorithm

Cite: João R. Santos, António Eira, and João Pires, "A Heuristic Algorithm for Designing OTN Over Flexible- Grid DWDM Networks," Journal of Communications, vol. 12, no. 9, pp. 500-509, 2017. Doi: 10.12720/jcm.12.9. 500-509.

Copyright © 2013-2017 Journal of Communications, All Rights Reserved
E-mail: jcm@etpub.com