Ìööae Öóóññòò Ò Íòòòòöö Blockinøøóòòð Ïïå Êêòò Aeaeøûóöö×× Øøø Ðð¹øó¹¹ðð Ùòòøøöý ××

Abstract

We address the problem of traffic grooming in WDM rings with all-to-all uniform unitary traffic. We want to minimize the total number of SONET add-drop multiplexers (ADMs) required. This problem corresponds to a partition of the edges of the complete graph into subgraphs, where each subgraph has at most C edges (where C is the grooming ratio) and where the… (More)

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics