Approximating the Traffic Grooming Problem in Tree and Star Networks

DOI10.1007/11917496_14MaRDI QIDQ3522952zbMATH OpenOpenAlexFDO

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

Publication date 4 September 2008

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11917496_14

zbMATH Keywords

optical networkstree networksadd-drop multiplexer (ADM)traffic groomingwavelength division multiplexing (WDM)

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Network design and communication in computer systems (68M10)

Recommendations

• Approximating the traffic grooming problem in tree and star networks
• Algorithms and Computation
• Traffic Grooming in Star Networks via Matching Techniques
• Approximating the traffic grooming problem
• Hardness and Approximation of Traffic Grooming
• Hardness and approximation of traffic grooming
• Traffic Grooming: Combinatorial Results and Practical Resolutions
• Approximating capacitated tree-routings in networks
• Approximating Capacitated Tree-Routings in Networks

Cited in

(13)

• Designing hypergraph layouts to GMPLS routing strategies
• Approximating the traffic grooming problem in tree and star networks
• Approximating the traffic grooming problem
• On the Complexity of the Traffic Grooming Problem in Optical Networks
• Hardness and approximation of traffic grooming
• GMPLS label space minimization through hypergraph layouts
• Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph
• Algorithms and Computation
• Structural Information and Communication Complexity
• Traffic Grooming: Combinatorial Results and Practical Resolutions
• On the complexity of the regenerator cost problem in general networks with traffic grooming
• Traffic Grooming in Star Networks via Matching Techniques
• Hardness and Approximation of Traffic Grooming

This page was built for publication: Approximating the Traffic Grooming Problem in Tree and Star Networks

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