Survivable routing in WDM networks

Proceedings - IEEE Symposium on Computers and Communications

Volumn , Issue , 2002, Pages 726-731

  Sen, Arunabha ^a   Hao, Bin ^a   Shen, Bao Hong ^a  

^a Arizona State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFOCOM; LIGHTPATHS; LOGICAL TOPOLOGY; NP COMPLETE; PHYSICAL TOPOLOGY; SPECIFIC ORDERING; SURVIVABLE ROUTING; WDM NETWORKS;

COMPUTATIONAL COMPLEXITY; WAVELENGTH DIVISION MULTIPLEXING;

TOPOLOGY;

EID: 84883880034     PISSN: 15301346     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISCC.2002.1021754     Document Type: Conference Paper

References (8)

1. J. A. Bondy and U. S. R. Murthy, Graph Theory with Applications, North Holland, 1976.
2. O. Crochat and J. Y. Le Boudec, "Design Protection for WDM Optical Networks", IEEE JSAC, Vol. 16, No. 7, Sept. 1998.
3. G. Ellinas, A. G. Hailemariam and T. E. Stern, "Protection Cycles in MeshWDMNetworks", IEEE Journal on Selected Areas in Communications, vol. 18, no. 10, October 2000.
4. M. R. Garey, D. S. Johnson and R. E. Tarjan, "The planar Hamiltonian circuit problem is NP-complete", SIAMJournal onf Computing, vol. 5, no. 4, pp. 704-714, December 1976.
5. Y. Liu, D. Tipper and P. Siripongwutikorn, "Approximating Optimal Spare Capacity Allocation by Successive Survivable Routing", Proceedings of IEEE Infocom'01, 2001.
6. E. Modiano and A. Narula-Tam, "Survivable routing of logical topologies in WDM networks", Proc. IEEE INFOCOM' 01, 2001.
7. G. H. Sasaki, C. F. Su and D. Blight, "Simple layout algorithms to maintain network connectivity under faults", Proc. of 2000 Annual Allerton Conference, Champaign Il, October 2000.
8. A. Schrijver, Theory of Linear and Integer Programming, John Wiley and Sons, 1986.