loading...
CoSE: A SRLG-Disjoint Routing Algorithm
Toulouse, France February 14-February 16
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ECUMN.2007.15Fourth European Conference on Univers ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Mohammad Javad Rostami, Bahonar Univ., Iran
Siavash Khorsandi, Computer Eng. and IT Dept of AUT
Ali Asghar Khodaparast, Computer Eng. and IT Dept of AUT
A SRLG is a group of network links that share a common physical resource whose failure will cause the failure of all links of the group. To protect a logical connection in a network from a single SRLG failure, two different paths are usually assigned to the connection. The two paths must be disjoint to avoid synchronous failure. In this paper, we extend a high-performance link-disjoint routing algorithm called CoLE to SRLG-disjoint routing. The analysis and the simulation results demonstrate improvement over the previous algorithms.
Index Terms:
routing, fault tolerance, optical network, network optimization.
Citation:
Mohammad Javad Rostami, Siavash Khorsandi, Ali Asghar Khodaparast, "CoSE: A SRLG-Disjoint Routing Algorithm," ecumn, pp.86-92, Fourth European Conference on Universal Multiservice Networks (ECUMN'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.