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

DOI10.1016/J.JPDC.2008.01.001MaRDI QIDQ436806zbMATH OpenOpenAlexFDO

Authors 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 algorithmgraph partitionNP-completenessSONET/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)

Recommendations

• Minimizing SONET Add‐Drop Multiplexers in optical UPSR networks using the minimum number of wavelengths
• Structural Information and Communication Complexity
• Hardness and Approximation of Traffic Grooming
• Traffic grooming on the path
• An Algorithm with Better Approximation Ratio for Multicast Traffic in Unidirectional SONET/WDM Rings

Cites work

• Approximation algorithms for the design of SDH/SONET networks
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• The NP-Completeness of Some Edge-Partition Problems
• The SONET edge‐partition problem
• Tight bounds on maximal and maximum matchings

Cited in

(5)

• Minimizing SONET Add‐Drop Multiplexers in optical UPSR networks using the minimum number of wavelengths
• A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks
• On the complexity of the regenerator cost problem in general networks with traffic grooming
• Structural Information and Communication Complexity
• A global approach for designing reliable WDM networks and grooming the traffic

Describes a project that uses

Uses Software

• GENREG

This page was built for publication: On the complexity and algorithm of grooming regular traffic in WDM optical networks

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