Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming RatioC= 6
From MaRDI portal
Publication:5470777
DOI10.1137/S0895480104444314zbMath1092.68003MaRDI QIDQ5470777
Charles J. Colbourn, Gennian Ge, Alan C. H. Ling, Jean-Claude Bermond, Xavier Muñoz, David Coudert
Publication date: 1 June 2006
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
optical networks; block designs; wavelength-division multiplexing; combinatorial designs; traffic grooming; group-divisible designs
68M10: Network design and communication in computer systems
68R05: Combinatorics in computer science
Related Items
A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks, Optical grooming with grooming ratio nine, Grooming traffic to minimize load, Graph divisible designs and packing constructions, Optical grooming with grooming ratio eight, Kirkman frames having hole type \(h^um^1\) for \(h\equiv\mathrm{mod}\,12\), Embedding path designs into kite systems, Traffic grooming in bidirectional WDM ring networks, Constructions of optimal packing and covering of the complete multigraph with applications, Optimal Groomings with Grooming Ratios Six and Seven, Lower bounds for two-period grooming via linear programming duality, Grooming for two-period optical networks
