By Topic

Grooming Traffic to Maximize Throughput in SONET Rings

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Colbourn, C.J. ; Sch. of Comput., Inf., & Decision Syst. Eng., Arizona State Univ., Tempe, AZ, USA ; Quattrocchi, G. ; Syrotiuk, V.R.

Using a graph-theoretic formulation, a grooming in a SONET ring network may be interpreted as a decomposition of an undirected simple graph G=(V,E), where V corresponds to the n nodes in the ring, and each edge {i, j}ϵE represents the traffic requirements for the primitive ring {i, j}. In G = {G1,...,G8}, the decomposition of G, each subgraph Gi specifies a set of primitive rings assigned to the same wavelength. If the maximum size set is c then G is a c-grooming. In this paper, bounding the maximum through put tp̅ (c, n, ℓ) of a c-grooming G is addressed, subject to each node being equipped with a limited number ℓ of add-drop multiplexers (ADMs). Naturally, restricting the number of ADMs limits the achievable throughput. For all ℓ, precise determinations of maximum throughput for grooming ratios c=2, 3, and 4 are given. These underlie substantially improved bounds for larger grooming ratios.

Published in:

Optical Communications and Networking, IEEE/OSA Journal of  (Volume:3 ,  Issue: 1 )