Capacity design of fast path restorable optical networks

Proceedings - IEEE INFOCOM

Volumn 2, Issue , 2002, Pages 817-826

  Hauser, Oded ^a   Kodialam, Murali ^a   Lakshman, T V ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CHANNEL CAPACITY; CONCURRENT ENGINEERING; POLYNOMIAL APPROXIMATION; REQUIREMENTS ENGINEERING; WAVELENGTH DIVISION MULTIPLEXING;

RESTORABLE NETWORK CAPACITY DESIGN; RESTORABLE OPTICAL NETWORKS; RESTORATION REQUIREMENTS; WAVELENGTH PATH;

OPTICAL COMMUNICATION;

EID: 0036346135     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. Quality of service based routing: A performance perspective
2. On maximum K-flows in networks
3. Network flows: Theory: Algorithms, and applications
4. Optical network design and routing
5. Fast and efficient bandwidth reservation for robust routing
6. Faster and simpler algorithms for multicommodity flow and other fractional packing problems
7. Optical cross connects for optical networking
8. The maximum concurrent flow problem
9. A quick method for finding shortest pairs of disjoint paths