Robust spectrum allocation in elastic flexgrid optical networks: complexity and formulations

DOI10.1002/NET.21785MaRDI QIDQ6496366zbMATH OpenFDO

Authors Christina Büsing, Alexandra Grub, Arie M. C. A. Koster, W. Laube, Martin Tieves

Publication date 3 May 2024

Published in Networks (Search for Journal in Brave)

zbMATH Keywords

computational complexityrobust optimizationnetwork designelastic optical networksspectrum allocationMIP formulationsflexgrid optical networks

Mathematics Subject Classification ID

Linear programming (90C05) Integer programming (90C10) Communication networks in operations research (90B18)

Recommendations

• Integer programming models for the routing and spectrum allocation problem
• Profit maximization in flex-grid all-optical networks
• A branch-and-cut algorithm for the routing and spectrum allocation problem
• Profit maximization in flex-grid all-optical networks
• Towards optimal and scalable solution for routing and spectrum allocation

Cites work

• scientific article; zbMATH DE number 4043214 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2079419 (Why is no real title available?)
• Efficient algorithms for interval graphs and circular-arc graphs
• Incidence matrices and interval graphs
• Lagrangean decomposition/relaxation for the routing and wavelength assignment problem
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• The traveling salesman problem and its variations
• Wavelength assignment in multifiber star networks

This page was built for publication: Robust spectrum allocation in elastic flexgrid optical networks: complexity and formulations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496366)