Optical grooming with grooming ratio nine

DOI10.1016/J.DISC.2010.09.013MaRDI QIDQ616353zbMATHOpenAlexFDO

Authors Charles J. Colbourn, Gennian Ge, 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

combinatorial designsoptical networksblock designstraffic groominggroup-divisible designswavelength-division multiplexing

Mathematics Subject Classification ID

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

Recommendations

• Optical grooming with grooming ratio eight
• Optimal Groomings with Grooming Ratios Six and Seven
• Grooming traffic to minimize load
• Drop cost and wavelength optimal two-period grooming with ratio 4
• Grooming for two-period optical networks

Cites work

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

Cited in

(6)

• Drop cost and wavelength optimal two-period grooming with ratio 4
• Grooming traffic to minimize load
• A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks
• Lower bounds for two-period grooming via linear programming duality
• Optimal Groomings with Grooming Ratios Six and Seven
• Optical grooming with grooming ratio eight

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q616353)