Efficient algorithms for optimal alternate routing in communication networks

Author

Ogier, Richard G. ; Rutenburg, Vlad

Author_Institution

SRI Int., Menlo Park, CA, USA

Volume

2

fYear

1993

fDate

23-26 May 1993

Firstpage

676

Abstract

Three new efficient distributed and centralized algorithms are presented for precomputing shortest alternate paths in a communication network. Such alternate paths can be used in case one or more links or nodes fail on the primary path between any two nodes. The first algorithm solves the problem of alternate routing around node failures when routing from a fixed source to all destinations. The second algorithm deals with alternate routing around link failures when routing from all sources to a fixed destination. The third algorithm solves the problem of alternate routing around node and/or link failures when routing from all sources to all destinations

Keywords

computational complexity; distributed algorithms; graph theory; problem solving; telecommunication network routing; centralized algorithms; communication network; distributed algorithms; link failures; node failures; optimal alternate routing; shortest alternate paths; Communication networks; Computer networks; Contracts; Intelligent networks; Routing;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, 1993. ICC '93 Geneva. Technical Program, Conference Record, IEEE International Conference on

Conference_Location

Geneva

Print_ISBN

0-7803-0950-2

Type

conf

DOI

10.1109/ICC.1993.397360

Filename

397360