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

DOI10.1002/NET.21785MaRDI QIDQ6496366FDOQ6496366

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)

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

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)

Cites Work

• Title not available (Why is that?)
• The traveling salesman problem and its variations
• Incidence matrices and interval graphs
• Efficient algorithms for interval graphs and circular-arc graphs
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lagrangean decomposition/relaxation for the routing and wavelength assignment problem
• 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)