Approximating the traffic grooming problem in tree and star networks

DOI10.1016/J.JPDC.2008.01.003zbMath1243.68028OpenAlexW1977535087MaRDI QIDQ436821

Gianpiero Monaco, Michele Flammini, Shmuel Zaks, Luca Moscardelli, Mordechai Shalom

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.003

zbMATH Keywords

optical networkstree networkstraffic groomingadd-drop multiplexer (ADM)wavelength division multiplexing (WDM)

Mathematics Subject Classification ID

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

Related Items (4)

Real-time scheduling to minimize machine busy times ⋮ LP rounding and combinatorial algorithms for minimizing active and busy time ⋮ Optimizing regenerator cost in traffic grooming ⋮ Minimizing total busy time in parallel scheduling with application to optical networks

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation algorithms for combinatorial problems
• Traffic partition in WDM/SONET rings to minimize SONET ADMs
• On the Complexity of the Traffic Grooming Problem in Optical Networks
• Structural Information and Communication Complexity
• Approximation and Online Algorithms
• Algorithms and Computation

This page was built for publication: Approximating the traffic grooming problem in tree and star networks