Optical grooming with grooming ratio eight

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.