z-logo
Premium
Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3
Author(s) -
Bermond JeanClaude,
Ceroi Stephan
Publication year - 2003
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.10061
Subject(s) - traffic grooming , synchronous optical networking , multiplexer , wavelength division multiplexing , partition (number theory) , combinatorics , enhanced data rates for gsm evolution , mathematics , computer science , topology (electrical circuits) , graph , computer network , multiplexing , discrete mathematics , telecommunications , physics , optics , wavelength
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 three edges and in which the total number of vertices has to be minimized. © 2003 Wiley Periodicals, Inc.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom