Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph

DOI10.1007/978-3-540-92248-3_27zbMath1202.68040arXiv0803.2813OpenAlexW1533738262MaRDI QIDQ5302064

Ignasi Sau, Xavier Muñoz

Publication date: 20 January 2009

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

Full work available at URL: https://arxiv.org/abs/0803.2813

zbMATH Keywords

cubic graphbridgeless graphoptical networksgraph decompositionADMtraffic groomingSONET over WDM

Mathematics Subject Classification ID

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

Related Items (2)

Hardness and approximation of traffic grooming ⋮ Traffic grooming in bidirectional WDM ring networks

Cites Work

• Unnamed Item
• On linear k-arboricity
• Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5
• Approximating the Traffic Grooming Problem in Tree and Star Networks
• The SONET edge‐partition problem
• Hardness and Approximation of Traffic Grooming
• Algorithms and Computation

This page was built for publication: Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph