Abstract
AbstractMinimizing the number of add‐drop multiplexers (ADMs) in a unidirectional SONET ring can be formulated as a graph decomposition problem. When traffic requirements are uniform and all‐to‐all, groomings that minimize the number of ADMs (equivalently, the drop cost) have been characterized for grooming ratio at most six. However, when two different traffic requirements are supported, these solutions do not ensure optimality. In two‐period optical networks, n vertices are required to support a grooming ratio of Ca in the first time period, while in the second time period a grooming ratio of Cb, Cb<Ca, is required for v ≤ n vertices. This allows the two‐period grooming problem to be expressed as an optimization problem on graph decompositions of Kn that embed graph decompositions of Kv for v ≤ n. Using this formulation, optimal two‐period groomings are found for small grooming ratios using techniques from the theory of graphs and designs. © 2008 Wiley Periodicals, Inc. NETWORKS, 2008
Submitted Version
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.