Virtualization of elastic optical networks and regenerators with traffic grooming

• Published in: Journal of optical communications and networking Vol. 12; no. 12; pp. 428 - 442
• Main Authors: Assis, K. D. R., Santos, A. F., Almeida, R. C., Reed, M. J., Jaumard, B., Simeonidou, D.
• Format: Journal Article
• Language: English
• Published: Piscataway Optica Publishing Group 01.12.2020; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Format; Heuristic; Heuristic methods; Integer programming; Linear programming; Mixed integer; Modulation; Network topologies; Network topology; Optical communication; Optical fiber networks; Placement; Regenerators; Repeaters; Routing; Spectrum allocation; Substrates; Topology; Traffic flow; Transceivers; Virtual networks; Virtualization
• ISSN: 1943-0620; 1943-0639; 1943-0639
• DOI: 10.1364/JOCN.398749

An elastic optical network (EON) plays an important role in transport technology for virtualization of networks. A key aspect of EONs is to establish lightpaths (virtual links) with exactly the amount of spectrum that is needed and with the possibility of grooming, the process of grouping many small traffic flows into larger units, creating a super-lightpath. Grooming eliminates the need for many guard bands between lightpaths and also saves transceivers; however, it often leads to the need to perform optical–electrical–optical conversions to multiple-data-rate optical signals at intermediate nodes. The aim of this paper is to provide a mixed-integer linear programming (MILP) formulation, as well as heuristic and meta-heuristic approaches, for the design of multiple virtual optical networks (VONs) in an elastic optical substrate network with bandwidth-variable lightpaths, modulation format constraints, and virtual elastic regenerator placement. Traffic grooming is allowed inside each VON, and a distance-adaptive modulation format technique is employed to guarantee efficiency in terms of bandwidth for a physical substrate, subject to several virtual topologies. A reduced MILP formulation without grooming capability is also proposed for comparison. The complete MILP formulation jointly solves the virtual topology design, regenerator placement, and grooming problems, as well as the routing, modulation, and spectrum assignment (RMSA) problem. The reduced MILP formulation, heuristics, and meta-heuristic, on the other hand, separate the virtual topology design problem from the RMSA problem. It is shown that the grooming approach can provide good results, since it solves the problem for a complete design when compared to the approach without grooming. Furthermore, heuristic solutions for large networks are proposed, which present good performance (in terms of saving spectrum) for the design with large instances.