### Abstract

In a synchronous optical network ring, assignment of source-to-destination circuits to wavelengths must respect traffic requirements and minimize both the number of wavelengths and the amount of terminal conversion equipment. When traffic requirements are approximately equal on all source-destination circuits, the assignment can be modeled as a graph decomposition problem. In this setting, techniques from combinatorial design theory can be applied. These techniques are introduced in a simpler form when every source-destination circuit requires one quarter of a wavelength. More sophisticated design-theoretic methods are then developed to produce the required decompositions for all sufficiently large ring sizes, when each source-destination circuit requires one eighth of a wavelength.

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

Pages (from-to) | 141-156 |

Number of pages | 16 |

Journal | Discrete Mathematics |

Volume | 261 |

Issue number | 1-3 |

DOIs | |

State | Published - Jan 28 2003 |

### Fingerprint

### ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics
- Theoretical Computer Science

### Cite this

*Discrete Mathematics*,

*261*(1-3), 141-156. https://doi.org/10.1016/S0012-365X(02)00465-X

**Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs.** / Colbourn, Charles; Ling, Alan C H.

Research output: Contribution to journal › Article

*Discrete Mathematics*, vol. 261, no. 1-3, pp. 141-156. https://doi.org/10.1016/S0012-365X(02)00465-X

}

TY - JOUR

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

AU - Colbourn, Charles

AU - Ling, Alan C H

PY - 2003/1/28

Y1 - 2003/1/28

N2 - In a synchronous optical network ring, assignment of source-to-destination circuits to wavelengths must respect traffic requirements and minimize both the number of wavelengths and the amount of terminal conversion equipment. When traffic requirements are approximately equal on all source-destination circuits, the assignment can be modeled as a graph decomposition problem. In this setting, techniques from combinatorial design theory can be applied. These techniques are introduced in a simpler form when every source-destination circuit requires one quarter of a wavelength. More sophisticated design-theoretic methods are then developed to produce the required decompositions for all sufficiently large ring sizes, when each source-destination circuit requires one eighth of a wavelength.

AB - In a synchronous optical network ring, assignment of source-to-destination circuits to wavelengths must respect traffic requirements and minimize both the number of wavelengths and the amount of terminal conversion equipment. When traffic requirements are approximately equal on all source-destination circuits, the assignment can be modeled as a graph decomposition problem. In this setting, techniques from combinatorial design theory can be applied. These techniques are introduced in a simpler form when every source-destination circuit requires one quarter of a wavelength. More sophisticated design-theoretic methods are then developed to produce the required decompositions for all sufficiently large ring sizes, when each source-destination circuit requires one eighth of a wavelength.

UR - http://www.scopus.com/inward/record.url?scp=84867935713&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84867935713&partnerID=8YFLogxK

U2 - 10.1016/S0012-365X(02)00465-X

DO - 10.1016/S0012-365X(02)00465-X

M3 - Article

AN - SCOPUS:84867935713

VL - 261

SP - 141

EP - 156

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -