Optical grooming with grooming ratio eight

Authors:
Charles J. Colbourn;Gennian Ge;Alan C. H. Ling
Affiliations:
Department of Computer Science and Engineering, Arizona State University, Tempe, AZ 85287-8809, USA;Department of Mathematics, Zhejiang University, Hangzhou 310027, Zhejiang, PR China;Department of Computer Science, University of Vermont, Burlington, VT 05405, USA
Venue:
Discrete Applied Mathematics
Year:
2009

Citing 6
Cited 1

Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs

Discrete Mathematics - Papers on the occasion of the 65th birthday of Alex Rosa
Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio C = 6

SIAM Journal on Discrete Mathematics
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)

Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
On the Existence of $(K_5 \setminuse)$-Designs with Application to Optical Networks

SIAM Journal on Discrete Mathematics
Grooming for two-period optical networks

Networks
Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven

SIAM Journal on Discrete Mathematics

Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

Grooming uniform all-to-all traffic in optical ring networks with grooming ratio C requires the determination of graph decompositions of the complete graph into subgraphs each having at most C edges. The drop cost of such a grooming is the total number of vertices of nonzero degree in these subgraphs, and the grooming is optimal when the drop cost is minimum. The minimum possible drop cost is determined for grooming ratio 8, and this cost is shown to be realized with six exceptions, and 37 possible exceptions, the largest being 105.