Skip to Main content Skip to Navigation
Reports

Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3

Jean-Claude Bermond 1 Stephan Ceroi
1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : We consider traffic grooming in WDM unidirectional rings with all-to-all uniform unitary traffic. We determine the minimum number of SONET/SDH add-drop multiplexers (ADMs) required when the grooming ratio is 3. In fact, using tools of design theory, we solve the equivalent edge partitioning problem: find a partition of the edges of the complete graph on n vertices (K_n) into subgraphs having at most 3 edges and in which the total number of vertices has to be minimized.
Document type :
Reports
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download

https://hal.inria.fr/inria-00071959
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, May 23, 2006 - 7:21:55 PM
Last modification on : Tuesday, November 17, 2020 - 11:18:04 PM
Long-term archiving on: : Sunday, April 4, 2010 - 10:46:19 PM

Identifiers

  • HAL Id : inria-00071959, version 1

Collections

Citation

Jean-Claude Bermond, Stephan Ceroi. Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3. RR-4626, INRIA. 2002. ⟨inria-00071959⟩

Share

Metrics

Record views

317

Files downloads

270