Optical grooming with grooming ratio nine

DOI10.1016/j.disc.2010.09.013zbMath1211.68282OpenAlexW2066777399MaRDI QIDQ616353

Gennian Ge, Charles J. Colbourn, Alan C. H. Ling

Publication date: 7 January 2011

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

Full work available at URL: https://doi.org/10.1016/j.disc.2010.09.013

zbMATH Keywords

optical networksblock designswavelength-division multiplexingcombinatorial designstraffic groominggroup-divisible designs

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Optimal Groomings with Grooming Ratios Six and Seven ⋮ Optical grooming with grooming ratio eight ⋮ A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks

Cites Work

• Unnamed Item
• Optical grooming with grooming ratio eight
• Eine Bemerkung zur Abschätzung der Anzahl orthogonaler lateinischer Quadrate mittels Siebverfahren
• Grooming in unidirectional rings: \(K_{4}-e\) designs
• On the Existence of $(K_5 \setminuse)$-Designs with Application to Optical Networks
• Grooming for two-period optical networks
• Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3
• Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven
• Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming RatioC= 6

This page was built for publication: Optical grooming with grooming ratio nine