## Abstract

In order to reduce the number of add-drop multiplexers (ADMs) in SONET/WDM networks using wavelength add-drop multiplexing, certain graph decompositions can be used to form a "grooming" that specifies the assignment of traffic to wavelengths. When traffic among nodes is all-to-all and uniform, the drop cost of such a decomposition is the sum, over all graphs in the decomposition, of the number of vertices of nonzero degree in the graph. The number of ADMs required is this drop cost. The existence of such decompositions with minimum cost, when every pair of sites employs no more than 1/7 of the wavelength capacity, is determined within an additive constant. Indeed when the number n of sites satisfies n ≡ 1 (mod 3) and n ≠ 19, the determination is exact; when n ≡ 0 (mod 3), n ≢ 18 (mod 24), and n is large enough, the determination is also exact; and when n ≡ 2 (mod 3) and n is large enough, the gap between the cost of the best construction and the cost of the lower bound is independent of n and does not exceed 4.

Original language | English (US) |
---|---|

Pages (from-to) | 109-122 |

Number of pages | 14 |

Journal | SIAM Journal on Discrete Mathematics |

Volume | 23 |

Issue number | 1 |

DOIs | |

State | Published - Dec 1 2008 |

## Keywords

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

## ASJC Scopus subject areas

- General Mathematics