TY - JOUR
T1 - A Failsafe Distributed Routing Protocol
AU - Merlin, Philip M.
AU - Segall, Adrian
PY - 1979/9
Y1 - 1979/9
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0018515797&partnerID=8YFLogxK
U2 - 10.1109/TCOM.1979.1094552
DO - 10.1109/TCOM.1979.1094552
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
SN - 0090-6778
VL - 27
SP - 1280
EP - 1287
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
IS - 9
ER -