Optical grooming with grooming ratio eight

Charles Colbourn, Gennian Ge, Alan C H Ling

Research output: Contribution to journalArticlepeer-review

7 Scopus citations


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.

Original languageEnglish (US)
Pages (from-to)2763-2772
Number of pages10
JournalDiscrete Applied Mathematics
Issue number13
StatePublished - Jul 6 2009


  • Block designs
  • Combinatorial designs
  • Group-divisible designs
  • Optical networks
  • Traffic grooming
  • Wavelength-division multiplexing

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics


Dive into the research topics of 'Optical grooming with grooming ratio eight'. Together they form a unique fingerprint.

Cite this