Grooming traffic to minimize load

DOI10.1016/j.disc.2011.03.016zbMath1238.68027OpenAlexW2035784055MaRDI QIDQ658091

Gaetano Quattrocchi, Charles J. Colbourn, Alan C. H. Ling, Violet R. Syrotiuk

Publication date: 11 January 2012

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

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

zbMATH Keywords

graph decompositiontraffic groomingload minimizationoptic network

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07) Optimality conditions for problems involving relations other than differential equations (49K21)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optical grooming with grooming ratio eight
• A new class of group divisible designs with block size three
• Grooming in unidirectional rings: \(K_{4}-e\) designs
• Lower bounds for two-period grooming via linear programming duality
• Grooming for two-period optical networks
• Embedding Partial Steiner Triple Systems
• The SONET edge‐partition problem
• 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