An efficient routing algorithm for all-optical networks with turn constraints

Author(s):  
H. Soliman ◽  
C. Peyton
2009 ◽  
Author(s):  
Carmelo J. A. Bastos-Filho ◽  
Renato M. Fernandes ◽  
Danilo F. Carvalho ◽  
George M. Cavalcanti Junior ◽  
Daniel A. R. Chaves ◽  
...  

Author(s):  
M. Waqar Ashraf ◽  
Sevia M. Idrus ◽  
Farabi Iqbal

Lightpaths enable end-to-end all-optical transmission between network nodes. For survivable routing, traffic is often carried on a primary lightpath, and rerouted to another disjointed backup lightpath in case of the failure of the primary lightpath. Though both lightpaths can be physically disjointed, they can still fail simultaneously if a disaster affects them simultaneously on the physical plane. Hence, we propose a routing algorithm for provisioning a pair of link-disjoint lightpaths between two network nodes such that the minimum spatial distance between them (while disregarding safe regions) is maximized. Through means of simulation, we show that our algorithm can provide higher survivability against spatial-based simultaneous link failures (due to the maximized spatial distance).


Author(s):  
Janos Tapolcai ◽  
Lajos Ronyai ◽  
Eva Hosszu ◽  
Pin-Han Ho ◽  
Suresh Subramaniam

Sign in / Sign up

Export Citation Format

Share Document