28967 articles – 22394 references  [version française]

inria-00071959, version 1

Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3

Jean-Claude Bermond () 1, Stephan Ceroi

N° RR-4626 (2002)

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.

  • 1:  MASCOTTE (INRIA Sophia Antipolis / Laboratoire I3S)
  • INRIA – Université Nice Sophia Antipolis [UNS] – CNRS : UMR7271
  • Domain : Computer Science/Other
  • Keywords : TRAFFIC GROOMING / GRAPH / EDGE-PARTITION / DESIGN THEORY / WDM RINGS
  • Internal note : RR-4626
 
  • inria-00071959, version 1
  • http://hal.inria.fr/inria-00071959
  • oai:hal.inria.fr:inria-00071959
  • From: Rapport De Recherche Inria <>
  • Submitted on: Tuesday, 23 May 2006 19:21:55
  • Updated on: Wednesday, 31 May 2006 14:24:26