Optimizing regenerator cost in traffic grooming

DOI10.1016/j.tcs.2011.09.023zbMath1229.90032OpenAlexW2165377422MaRDI QIDQ655419

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

Publication date: 4 January 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.09.023

zbMATH Keywords

optical networkstree networkstraffic groomingwavelength division multiplexing (WDM)regenerators

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Approximation algorithms (68W25)

Related Items (5)

Online regenerator placement ⋮ On the complexity of the regenerator location problem treewidth and other parameters ⋮ LP rounding and combinatorial algorithms for minimizing active and busy time ⋮ On the complexity of the regenerator cost problem in general networks with traffic grooming ⋮ Minimizing total busy time in parallel scheduling with application to optical networks

Cites Work

• Unnamed Item
• Approximating the traffic grooming problem in tree and star networks
• Minimizing total busy time in parallel scheduling with application to optical networks
• Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs
• Traffic partition in WDM/SONET rings to minimize SONET ADMs
• The regenerator location problem
• Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests
• Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
• Paths, Trees, and Flowers

This page was built for publication: Optimizing regenerator cost in traffic grooming