Grooming for two-period optical networks

DOI10.1002/net.20252zbMath1160.68309MaRDI QIDQ3548732

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

optical networks; graph decomposition; combinatorial designs; traffic grooming

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

Related Items

Minimum embedding of STSs into \((K_3+e)\)-systems, Optical grooming with grooming ratio nine, Exact embedding of two \(G\)-designs into a \((G+e)\)-design, Grooming traffic to minimize load, Optical grooming with grooming ratio eight, Embedding path designs into kite systems, Lower bounds for two-period grooming via linear programming duality

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quadratic leaves of maximal partial triple systems
• 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
• Partial Steiner triple systems with equal-sized holes
• SONET/SDH ring assignment with capacity constraints
• Embedding path designs in 4-cycle systems
• Grooming in unidirectional rings: \(K_{4}-e\) designs
• The chromatic index of graphs with a spanning star
• 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
• Maximal Subsets of a given Set having No Triple in Common with a Steiner Triple System on the set
• Colouring \(4\)-cycle systems with specified block colour patterns: The case of embedding \(P_3\)-designs