Lower bounds for two-period grooming via linear programming duality

DOI10.1002/NET.20251MaRDI QIDQ3548731zbMATH OpenOpenAlexFDO

Authors Charles J. Colbourn, Gaetano Quattrocchi, Violet R. Syrotiuk

Publication date 17 December 2008

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.20251

zbMATH Keywords

graph decompositioncombinatorial designsoptical networkstraffic groominglinear programming duality

Mathematics Subject Classification ID

Linear programming (90C05) Integer programming (90C10) Stochastic network models in operations research (90B15)

Recommendations

• Drop cost and wavelength optimal two-period grooming with ratio 4
• Grooming for two-period optical networks
• Grooming traffic to minimize load
• Approximation algorithms for grooming in optical network design
• Optical grooming with grooming ratio nine

Cites work

• scientific article; zbMATH DE number 1602124 (Why is no real title available?)
• Embedding path designs in 4-cycle systems
• 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
• The CRC handbook of combinatorial designs
• Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming RatioC= 6

Cited in

(3)

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

This page was built for publication: Lower bounds for two-period grooming via linear programming duality

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