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

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.

Mots clés: TRAFFIC GROOMING; GRAPH; EDGE-PARTITION; DESIGN THEORY; WDM RINGS

Domaines: Autre [cs.OH]

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