CoSE: A SRLG-Disjoint Routing Algorithm

  • Authors:

  • Mohammad Javad Rostami;Siavash Khorsandi;Ali Asghar Khodaparast

  • Affiliations:

  • Bahonar Univ., Iran;Computer Eng. and IT Dept of AUT;Computer Eng. and IT Dept of AUT

  • Venue:
  • ECUMN '07 Proceedings of the Fourth European Conference on Universal Multiservice Networks
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.