A Failsafe Distributed Routing Protocol | IEEE Journals & Magazine | IEEE Xplore

A Failsafe Distributed Routing Protocol


Abstract:

An algorithm for constructing and adaptively maintaining routing tables in communication networks is presented. The algorithm can be employed in message as well as circui...Show More

Abstract:

An algorithm for constructing and adaptively maintaining routing tables in communication networks is presented. The algorithm can be employed in message as well as circuit switching networks, uses distributed computation, provides routing tables that are loop-free for each destination at all times, adapts to changes in network flows, and is completely failsafe. The latter means that after arbitrary failures and additions, the network recovers in finite time in the sense of providing routing paths between all physically connected nodes. For each destination, the routes are independently updated by an update cycle triggered by the destination.
Published in: IEEE Transactions on Communications ( Volume: 27, Issue: 9, September 1979)
Page(s): 1280 - 1287
Date of Publication: 06 January 2003

ISSN Information:


Contact IEEE to Subscribe

References

References is not available for this document.