Impairment-aware design of translucent DWDM networks based on the k-path connectivity graph

• Published in: Journal of optical communications and networking Vol. 4; no. 5; pp. 356 - 365
• Main Authors: Rizzelli, G., Tornatore, M., Maier, G., Pattavina, A.
• Format: Journal Article
• Language: English
• Published: Piscataway IEEE 01-05-2012; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Adaptive optics; Computer networks; Connectivity graph; Fiber optic networks; Impairment-aware integer linear programing (IA-ILP) formulation; Optical network units; Optical wavelength conversion; Physical layer; Regenerator placement problem (RPP); Repeaters; Routing fiber and wavelength assignment with regenerator problem (RFWA-RP); Studies; Translucent network design; Wavelength division multiplexing
• ISSN: 1943-0620; 1943-0639
• DOI: 10.1364/JOCN.4.000356

In this paper we propose a design procedure based on comprehensive integer linear programing (ILP) for translucent optical transport networks (OTNs), exploiting an extended version of the so-called "connectivity graph." For the first time to the best of our knowledge, we propose a mathematical approach that covers the manifold challenges of a realistic optical layer OTN design, jointly solving the regenerator placement problem (RPP) and the routing, fiber and wavelength assignment with regenerator problem (RFWA-RP). As a first contribution, we extend the concept of the connectivity graph to a k-path (k-p) connectivity graph. Second, the formulation addresses the problem of planning the number of dense wavelength division multiplexing systems, jointly solving the RPP and placing transponders. Third, we consider regeneration devices as wavelength converters also, showing the benefits arising from that aspect disregarded in the existing impairment-aware (IA) ILP formulations based on the connectivity graph. Finally we compare over different networks the results of our design procedure with those achieved by a hybrid method that combines a simplified IA-ILP formulation with a greedy heuristic. Moreover, an analytical framework to evaluate the network cost in terms of capital expenditure and operational expenditure is also presented. We show that the k-p connectivity graph represents a cost-effective tool for network design, as it allows one to greatly reduce the number of resources needed in both the protected and the unprotected scenarios.