Traffic grooming on the path

DOI10.1016/j.tcs.2007.04.028zbMath1125.68004MaRDI QIDQ2382667

David Coudert, Laurent Braud, Jean-Claude Bermond

Publication date: 2 October 2007

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

Full work available at URL: https://hal.inria.fr/inria-00308716/file/BBC-to-tcsa.pdf

zbMATH Keywords

graph; design theory; WDM; Traffic grooming

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

Related Items

A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks, Directed acyclic graphs with the unique dipath property, Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree, Hardness and approximation of traffic grooming, The complexity of the unit stop number problem and its implications to other related problems, Traffic grooming in bidirectional WDM ring networks

Cites Work

• Unnamed Item
• Unnamed Item
• Grooming in unidirectional rings: \(K_{4}-e\) designs
• The NP-Completeness of Some Edge-Partition Problems
• Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
• The SONET edge‐partition problem
• Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3
• Structural Information and Communication Complexity
• Approximation and Online Algorithms