Efficient algorithms for optimal alternate routing in communication networks

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...

Full description

Saved in:
Bibliographic Details
Published inProceedings of ICC '93 - IEEE International Conference on Communications Vol. 2; pp. 676 - 680 vol.2
Main Authors Ogier, R.G., Rutenburg, V.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1993
Subjects
Communication networks
Computer networks
Contracts
Intelligent networks
Routing
Online AccessGet full text

Cover

More Information
Summary: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.< >
ISBN:9780780309500
0780309502
DOI:10.1109/ICC.1993.397360