Optical grooming with grooming ratio nine
DOI10.1016/J.DISC.2010.09.013zbMATH Open1211.68282OpenAlexW2066777399MaRDI QIDQ616353FDOQ616353
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
Recommendations
combinatorial designsoptical networksblock designstraffic groominggroup-divisible designswavelength-division multiplexing
Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- The CRC handbook of combinatorial designs
- Minimizing SONET adms in unidirectional WDM rings with grooming ratio seven
- Grooming for two-period optical networks
- 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
- Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3
- Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming RatioC= 6
- Optical grooming with grooming ratio eight
Cited In (6)
- Optimal Groomings with Grooming Ratios Six and Seven
- Drop cost and wavelength optimal two-period grooming with ratio 4
- 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
- Optical grooming with grooming ratio eight
- Grooming traffic to minimize load
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)
