Abstract

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,,Gs}, 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 throughput tp¯(c,n,l) of a c-grooming G is addressed, subject to each node being equipped with a limited number l of add–drop multiplexers (ADMs). Naturally, restricting the number of ADMs limits the achievable throughput. For all l, precise determinations of maximum throughput for grooming ratios c=2, 3, and 4 are given. These underlie substantially improved bounds for larger grooming ratios.

© 2010 Optical Society of America

Full Article  |  PDF Article
OSA Recommended Articles
Fast Exact ILP Decompositions for Ring RWA

Emre Yetginer, Zeyu Liu, and George N. Rouskas
J. Opt. Commun. Netw. 3(7) 577-586 (2011)

Traffic Grooming in Optical Networks: Decomposition and Partial Linear Programming (LP) Relaxation

Hui Wang and George N. Rouskas
J. Opt. Commun. Netw. 5(8) 825-835 (2013)

Many-to-Many Traffic Grooming in WDM Networks

Mohammad A. Saleh and Ahmed E. Kamal
J. Opt. Commun. Netw. 1(5) 376-391 (2009)

References

You do not have subscription access to this journal. Citation lists with outbound citation links are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access OSA Member Subscription

Cited By

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access OSA Member Subscription

Figures (2)

You do not have subscription access to this journal. Figure files are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access OSA Member Subscription

Equations (6)

You do not have subscription access to this journal. Equations are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access OSA Member Subscription