On the complexity of the regenerator cost problem in general networks with traffic grooming

DOI10.1007/S00453-012-9693-8zbMath1360.68507OpenAlexW1983847410MaRDI QIDQ528858

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

Publication date: 17 May 2017

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-012-9693-8

zbMATH Keywords

complexityoptical networksapproximation algorithmstraffic groomingwavelength division multiplexing (WDM)regenerators

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (1)

On the complexity of the regenerator location problem treewidth and other parameters

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimizing regenerator cost in traffic grooming
• Minimizing total busy time in parallel scheduling with application to optical networks
• Hardness and approximation of traffic grooming
• Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs
• Traffic partition in WDM/SONET rings to minimize SONET ADMs
• Minimizing Busy Time in Multiple Machine Real-time Scheduling
• The regenerator location problem
• Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests
• A Greedy Heuristic for the Set-Covering Problem

This page was built for publication: On the complexity of the regenerator cost problem in general networks with traffic grooming