Circular arc graph based algorithms for routing scheduled lightpath demands in WDM optical networks

2nd International Conference on Broadband Networks, BROADNETS 2005

Volumn 2005, Issue , 2005, Pages 345-347

  Saradhi, Chava Vijaya ^a   Wei, C J ^a   Shujing, M ^a   Gurusamy, Mohan ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

CIRCULAR ARC GRAPH; SCHEDULED LIGHTPATH DEMANDS; SERVICE PROVIDER; TIME WINDOW ALGORITHM (TWA);

ALGORITHMS; COMPUTER SIMULATION; GRAPH THEORY; OPTICAL COMMUNICATION; ROUTERS; TELECOMMUNICATION TRAFFIC; WAVELENGTH DIVISION MULTIPLEXING;

FIBER OPTIC NETWORKS;

EID: 33847025341     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICBN.2005.1589633     Document Type: Conference Paper

References (3)

1. J. Kuri, N. Puech, M. Gagnaire, E. Dotaro et R. Douville, "Routing and Wavelength Assignment of Scheduled Lightpath Demands", IEEE JSAC Optical Communications and Networking Series, vol. 21, no. 8, pp. 1231-1240, October 2003.
2. M. C. Golumbic, "Algorithmic Graph Theory and Perfect Graphs", Academic Press, 1980.
3. U. I. Gupta, D. T. Lee, and J. Y. T. Leung, "Efficient Algorithms for Interval Graphs and Circular-Arc Graphs", Networks, vol. 12, pp. 459-467, 1982.