Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming RatioC= 6

DOI10.1137/S0895480104444314zbMath1092.68003OpenAlexW2130656753MaRDI QIDQ5470777

Gennian Ge, Jean-Claude Bermond, Alan C. H. Ling, David Coudert, Charles J. Colbourn, Xavier Muñoz

Publication date: 1 June 2006

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480104444314

zbMATH Keywords

optical networksblock designswavelength-division multiplexingcombinatorial designstraffic groominggroup-divisible designs

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Combinatorics in computer science (68R05)

Related Items (12)

Optimal Groomings with Grooming Ratios Six and Seven ⋮ Optical grooming with grooming ratio nine ⋮ Graph divisible designs and packing constructions ⋮ Grooming traffic to minimize load ⋮ Lower bounds for two-period grooming via linear programming duality ⋮ Grooming for two-period optical networks ⋮ Kirkman frames having hole type \(h^um^1\) for \(h\equiv\mathrm{mod}\,12\) ⋮ Optical grooming with grooming ratio eight ⋮ Constructions of optimal packing and covering of the complete multigraph with applications ⋮ Traffic grooming in bidirectional WDM ring networks ⋮ Embedding path designs into kite systems ⋮ A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks

This page was built for publication: Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming RatioC= 6