Optimal Groomings with Grooming Ratios Six and Seven

DOI10.1002/jcd.21428zbMath1350.05013OpenAlexW2149625496MaRDI QIDQ3465908

Emre Kolotoğlu, Gennian Ge, Hengjia Wei

Publication date: 29 January 2016

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.21428

zbMATH Keywords

optical networkswavelength-division multiplexinggraph decompositiontraffic grooming

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Combinatorial aspects of block designs (05B05) Combinatorics in computer science (68R05) Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Kite-group divisible packings and coverings with any minimum leave and minimum excess

Cites Work

• Group divisible designs with block size four and group type \(g^um^1\) for more small \(g\)
• Group divisible designs with block size four and group type \(g^um^1\)
• Optical grooming with grooming ratio nine
• Optical grooming with grooming ratio eight
• Grooming in unidirectional rings: \(K_{4}-e\) designs
• The Existence and Construction of (K⁵∖e)-Designs of Orders 27, 135, 162, and 216
• On the Existence of $(K_5 \setminuse)$-Designs with Application to Optical Networks
• Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3
• Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven
• A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks
• Group Divisible Designs with Block Size Four and Group Type for
• Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming RatioC= 6