Traffic partition in WDM/SONET rings to minimize SONET ADMs

Journal of Combinatorial Optimization

Volumn 6, Issue 4, 2002, Pages 425-453

  Cǎlinescu, Gruia ^a   Wan, Peng Jun ^a  

^a Illinois Institute of Technology   (United States)

Author keywords

Add drop multiplexer; Approximation algorithms; Grooming; SONET; WDM

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; CONGESTION CONTROL (COMMUNICATION); FIBER OPTIC NETWORKS; GRAPH THEORY; HEURISTIC METHODS; ITERATIVE METHODS; OPTICAL COMMUNICATION; THEOREM PROVING; WAVELENGTH DIVISION MULTIPLEXING;

ADD DROP MULTIPLEXER; APPROXIMATION ALGORITHM; PREPROCESSED ITERATIVE MATCHING; SYNCHRONOUS OPTICAL NETWORKS; TRAFFIC PARTITION;

OPTIMIZATION;

EID: 0036887359     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1019525904862     Document Type: Article

References (10)

1. Demand routing and slotting on ring networks
2. Wavelength assignment in a WDM ring to minimize cost of embedded SONET rings
3. Combined WDM and SONET network design
4. Self-healing rings in a synchronous environment
5. Wavelength assignment in WDM rings to minimize SONET ADMs
6. Efficient routing in all-optical networks
7. The ring loading problem
8. Coloring a family of circular arcs
9. Grooming of arbitrary traffic in SONET/WDM rings
10. Ring routing and wavelength translation