Abstract

The design of optical networks for maximum throughput under diverse traffic demands is a long-standing NP-hard problem. In this paper, by parameterizing the relationship between the network topology and traffic demand, a polynomial-time objective function, the demand weighted cost (DWC), is introduced and evaluated for different scale networks and diverse traffic scenarios. It is shown that the proposed DWC is highly correlated to network throughput, while speeding up the topology evaluation process by some five to six orders of magnitude. The DWC was then applied as the optimization target with three different topology optimization algorithms (DWC-selection, genetic algorithm, and our hierarchical topology design), achieving 90% and 460% throughput increases, on average, for small-scale (14-node) and large-scale (100-node) topology designs, respectively. The proposed methods have the potential of maximizing throughput in the design of future optical network topologies.

© 2023 Optica Publishing Group

Making intelligent topology design choices: understanding structural and physical property performance implications in optical networks [Invited]

Robin Matzner, Daniel Semrau, Ruijie Luo, Georgios Zervas, and Polina Bayvel
J. Opt. Commun. Netw. 13(8) D53-D67 (2021)

Physical topology optimization for highly reliable and efficient wavelength-assignable optical networks

Katsuaki Higashimori, Fumikazu Inuzuka, and Takuya Ohara
J. Opt. Commun. Netw. 14(3) 16-24 (2022)

Traffic Grooming in Optical Networks: Decomposition and Partial Linear Programming (LP) Relaxation

Hui Wang and George N. Rouskas
J. Opt. Commun. Netw. 5(8) 825-835 (2013)

Stable Logical Topologies for Survivable Traffic Grooming of Scheduled Demands

Arunita Jaekel, Ying Chen, and Ataul Bari
J. Opt. Commun. Netw. 2(10) 793-802 (2010)

Minimizing the cost of hierarchical optical transport network traffic grooming boards in metro networks

Aryanaz Attarpour, Memedhe Ibrahimi, Nicola Di Cicco, Francesco Musumeci, Andrea Castoldi, Mario Ragni, and Massimo Tornatore
J. Opt. Commun. Netw. 15(10) E18-E28 (2023)