Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs

DOI10.1016/S0304-3975(01)00101-3zbMath1016.68002OpenAlexW2161461534MaRDI QIDQ1605303

Gruia Călinescu, Peng-Jun Wan

Publication date: 15 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00101-3

zbMATH Keywords

approximation algorithmoptical networksadd-drop multiplexer (ADM)wavelength division multiplexing (WDM)synchronous optical networks (SONET)

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (5)

The weighted link ring loading problem ⋮ Optimizing regenerator cost in traffic grooming ⋮ On the complexity of the regenerator cost problem in general networks with traffic grooming ⋮ A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting ⋮ The chord version for SONET ADMs minimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal placement of add/drop multiplexers: Static and dynamic models
• Traffic partition in WDM/SONET rings to minimize SONET ADMs
• Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms
• Efficient routing in all-optical networks
• The Complexity of Coloring Circular Arcs and Chords
• Coloring a Family of Circular Arcs
• The Ring Loading Problem
• A unified approach to approximating resource allocation and scheduling

This page was built for publication: Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs