Lightpath arrangement in survivable rings to minimize the switching cost

IEEE Journal on Selected Areas in Communications

Volumn 20, Issue 1, 2002, Pages 172-182

  Eilam, Tamar ^a,b   Moran, Shlomo ^a   Zaks, Shmuel ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Optical network design; SONET add drop multiplexers (ADMs); SONET rings; Wavelength division multiplexing (WDM)

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMMUNICATION CHANNELS (INFORMATION THEORY); OPTICAL COMMUNICATION; OPTICAL DESIGN; OPTICAL LINKS; SWITCHING CIRCUITS; WAVELENGTH DIVISION MULTIPLEXING;

ADD DROP MULTIPLEXER; LIGHTPATH; RING TOPOLOGY; SYNCHRONOUS DIGITAL HIERARCHY; SYNCHRONOUS OPTICAL NETWORK;

FIBER OPTIC NETWORKS;

EID: 0036174205     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/49.974671     Document Type: Article

References (17)

1. Provisioning algorithms for WDM optical networks
2. Design of survivable WDM photonic network
3. Reducing electronic multiplexing costs in SONETWDM rings with dynamically changing traffic
4. Randomly traceable graphs
5. Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks
6. Approximation algorithms for survivable optical networks
7. The complexity of coloring circular arc graphs and chords
8. Wavelength assignment in WDM ring to minimize cost of embedded SONET rings
9. Fault tolerant multiwavelength optical rings with limited wavelength conversion
10. Cost effective traffic grooming in WDM rings
11. Number of wavelengths required for optical networks with failure restoration
12. Wavelength assignment in WDM rings to minimize SONET ADMs
13. An O(√V · E) algorithm for finding maximum matching in general graphs
14. Distributed network control for optical networks