On the complexity and algorithm of grooming regular traffic in WDM optical networks

DOI10.1016/j.jpdc.2008.01.001zbMath1243.68036OpenAlexW2067366494MaRDI QIDQ436806

Qian-Ping Gu, Yong Wang

Publication date: 26 July 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2008.01.001

zbMATH Keywords

approximation algorithmNP-completenessgraph partitionSONET/WDM networkstraffic grooming

Mathematics Subject Classification ID

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

Uses Software

• GENREG

Cites Work

• Unnamed Item
• Tight bounds on maximal and maximum matchings
• The NP-Completeness of Some Edge-Partition Problems
• The SONET edge‐partition problem
• Approximation algorithms for the design of SDH/SONET networks