Grooming traffic to minimize load

DOI10.1016/J.DISC.2011.03.016MaRDI QIDQ658091zbMATH OpenOpenAlexFDO

Authors Charles J. Colbourn, Alan C. H. Ling, Gaetano Quattrocchi, 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

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

Recommendations

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

Cites work

• scientific article; zbMATH DE number 1602124 (Why is no real title available?)
• scientific article; zbMATH DE number 3981181 (Why is no real title available?)
• scientific article; zbMATH DE number 3720936 (Why is no real title available?)
• scientific article; zbMATH DE number 553911 (Why is no real title available?)
• scientific article; zbMATH DE number 3378938 (Why is no real title available?)
• A new class of group divisible designs with block size three
• Embedding Partial Steiner Triple Systems
• Grooming for two-period optical networks
• Grooming in unidirectional rings: \(K_{4}-e\) designs
• Lower bounds for two-period grooming via linear programming duality
• Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3
• Minimizing SONET adms in unidirectional WDM rings with grooming ratio seven
• Optical grooming with grooming ratio eight
• The SONET edge‐partition problem
• Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming RatioC= 6

Cited in

(9)

• Clustering-learning model for reducing the delay in traffic grooming optimization
• Grooming for two-period optical networks
• Drop cost and wavelength optimal two-period grooming with ratio 4
• Optical grooming with grooming ratio nine
• Graph partitioning and traffic grooming with bounded degree request graph
• Edge-partitioning regular graphs for ring traffic grooming with a priori placement of the ADMs
• Telecommunication network grooming
• Lower bounds for two-period grooming via linear programming duality
• Optical grooming with grooming ratio eight

This page was built for publication: Grooming traffic to minimize load

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