Grooming for two-period optical networks

DOI10.1002/NET.20252MaRDI QIDQ3548732zbMATHOpenAlexFDO

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.20252

zbMATH Keywords

graph decompositioncombinatorial designsoptical networkstraffic grooming

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Drop cost and wavelength optimal two-period grooming with ratio 4
• Grooming traffic to minimize load
• Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3
• Traffic grooming in bidirectional WDM ring networks
• Optical grooming with grooming ratio eight

Cites work

• scientific article; zbMATH DE number 1602124 (Why is no real title available?)
• scientific article; zbMATH DE number 3710196 (Why is no real title available?)
• scientific article; zbMATH DE number 26328 (Why is no real title available?)
• scientific article; zbMATH DE number 553911 (Why is no real title available?)
• scientific article; zbMATH DE number 979131 (Why is no real title available?)
• scientific article; zbMATH DE number 4189745 (Why is no real title available?)
• 1-factorizing regular graphs of high degree - an improved bound
• A new class of group divisible designs with block size three
• Bicoloring Steiner triple systems
• Colouring \(4\)-cycle systems with specified block colour patterns: The case of embedding \(P_3\)-designs
• Embedding path designs in 4-cycle systems
• Grooming in unidirectional rings: \(K_{4}-e\) designs
• Maximal Subsets of a given Set having No Triple in Common with a Steiner Triple System on the set
• Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3
• Minimizing SONET adms in unidirectional WDM rings with grooming ratio seven
• Partial Steiner triple systems with equal-sized holes
• Quadratic leaves of maximal partial triple systems
• SONET/SDH ring assignment with capacity constraints
• The SONET edge‐partition problem
• The chromatic index of graphs with a spanning star
• Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming RatioC= 6

Cited in

(10)

• Exact embedding of two \(G\)-designs into a \((G+e)\)-design
• Minimum embedding of STSs into \((K_3+e)\)-systems
• Minimum embedding of any Steiner triple system into a 3-sun system via matchings
• Drop cost and wavelength optimal two-period grooming with ratio 4
• Optical grooming with grooming ratio nine
• Grooming traffic to minimize load
• Embedding path designs into kite systems
• Grooming in unidirectional rings: \(K_{4}-e\) designs
• Lower bounds for two-period grooming via linear programming duality
• Optical grooming with grooming ratio eight

This page was built for publication: Grooming for two-period optical networks

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