Abstract
AbstractWe 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 (Kn) into subgraphs having at most three edges and in which the total number of vertices has to be minimized. © 2003 Wiley Periodicals, Inc.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
