A Recoverable Protocol for Loop­Free Distributed Routing

A. Segal; Philip M. Merlin; Robert G. Gallager

A Recoverable Protocol for LoopFree Distributed Routing

A. Segal
, Philip M. Merlin
, Robert G. Gallager

Bar-Ilan University - The Alexander Kofkin Faculty of Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

An algorithm for adaptive routing in data-communication networks is presented. The algorithm uses distributed computation, provides loop-free routing for each destination in the network, adapts to changes in network flows and is completely failsafe. The latter means that after arbitrary failures and additions of nodes and links, the network recovers in finite time in the sense of providing routing paths between all physically connected nodes. Proofs of all these properties are provided in a separate paper.

Original language	American English
Title of host publication	International Conference on Communications
State	Published - 1978

Bibliographical note

Place of conference:Canada

Cite this

@inproceedings{29233d2d022c4fe8b3ce7b52dfc2e1e7,

title = "A Recoverable Protocol for LoopFree Distributed Routing",

abstract = "An algorithm for adaptive routing in data-communication networks is presented. The algorithm uses distributed computation, provides loop-free routing for each destination in the network, adapts to changes in network flows and is completely failsafe. The latter means that after arbitrary failures and additions of nodes and links, the network recovers in finite time in the sense of providing routing paths between all physically connected nodes. Proofs of all these properties are provided in a separate paper.",

author = "A. Segal and Merlin, \{Philip M.\} and Gallager, \{Robert G.\}",

note = "Place of conference:Canada",

year = "1978",

language = "American English",

booktitle = "International Conference on Communications",

}

TY - GEN

T1 - A Recoverable Protocol for LoopFree Distributed Routing

AU - Segal, A.

AU - Merlin, Philip M.

AU - Gallager, Robert G.

N1 - Place of conference:Canada

PY - 1978

Y1 - 1978

N2 - An algorithm for adaptive routing in data-communication networks is presented. The algorithm uses distributed computation, provides loop-free routing for each destination in the network, adapts to changes in network flows and is completely failsafe. The latter means that after arbitrary failures and additions of nodes and links, the network recovers in finite time in the sense of providing routing paths between all physically connected nodes. Proofs of all these properties are provided in a separate paper.

AB - An algorithm for adaptive routing in data-communication networks is presented. The algorithm uses distributed computation, provides loop-free routing for each destination in the network, adapts to changes in network flows and is completely failsafe. The latter means that after arbitrary failures and additions of nodes and links, the network recovers in finite time in the sense of providing routing paths between all physically connected nodes. Proofs of all these properties are provided in a separate paper.

M3 - Conference contribution

BT - International Conference on Communications

ER -

A Recoverable Protocol for Loop­Free Distributed Routing

Abstract

Bibliographical note

Fingerprint

Cite this

A Recoverable Protocol for LoopFree Distributed Routing