DocumentCode
2318206
Title
Computing optically disjoint paths for survivable all-optical networks
Author
Garg, N. ; Simha, R.
Author_Institution
George Washington Univ., Washington, DC, USA
fYear
2003
fDate
23-28 March 2003
Firstpage
205
Abstract
We consider the problem of finding two paths for given wavelength channels in the network such that one of them remains available in the event of an optical attack by addition of minimal optoelectronic equipment.
Keywords
channel spacing; optical computing; optical fibre networks; optoelectronic devices; wavelength division multiplexing; optical attack; optical disjoint path computing; optical networks; optoelectronic equipment; wavelength channels; All-optical networks; Computer networks; Load management; Network topology; Optical computing; Optical fiber networks; Protection; Robustness; Routing;
fLanguage
English
Publisher
ieee
Conference_Titel
Optical Fiber Communications Conference, 2003. OFC 2003
Print_ISBN
1-55752-746-6
Type
conf
DOI
10.1109/OFC.2003.1247604
Filename
1247604
Link To Document