Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests

DOI10.1007/978-3-642-14162-1_28MaRDI QIDQ3587450zbMATH OpenOpenAlexFDO

Authors George B. Mertzios, Ignasi Sau, Mordechai Shalom, Shmuel Zaks

Publication date 7 September 2010

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL http://dro.dur.ac.uk/9282/1/9282.pdf

zbMATH Keywords

approximation algorithmshardness of approximationoptical networksregeneratorsoverprovisioning

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Network design and communication in computer systems (68M10)

Recommendations

• Regenerator location problem in flexible optical networks
• Towards optimizing the deployment of optical access networks
• Metaheuristic hybridizations for the regenerator placement and dimensioning problem in sub-wavelength switching optical networks
• Algorithmic Applications in Management
• Flexible bandwidth assignment with application to optical networks
• Compact ILP formulations for the routing and wavelength assignment problem in the design of optical transport networks with regenerators

Cited in

(8)

• Optimizing regenerator cost in traffic grooming
• On the complexity of approximation and online scheduling problems with applications to optical networks
• Metaheuristic hybridizations for the regenerator placement and dimensioning problem in sub-wavelength switching optical networks
• The Generalized Regenerator Location Problem
• On the complexity of the regenerator location problem -- treewidth and other parameters (extended abstract)
• Regenerator location problem in flexible optical networks
• Online regenerator placement
• On the complexity of the regenerator cost problem in general networks with traffic grooming

This page was built for publication: Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests

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