RECOVERABLE PROTOCOL FOR LOOP-FREE DISTRIBUTED ROUTING.

A. Segall; P. M. Merlin; R. G. Gallager

RECOVERABLE PROTOCOL FOR LOOP-FREE DISTRIBUTED ROUTING.

A. Segall
, P. M. Merlin
, R. G. Gallager

Bar-Ilan University - The Alexander Kofkin Faculty of Engineering

Research output: Contribution to conference › Paper › peer-review

4 Scopus citations

Abstract

An algorithm for constructing and adaptively maintaining routing tables is presented. The algorithm 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 of nodes and links, the network recovers in finite time in the sense of providing routing paths between all physically connected nodes.

Original language	English
State	Published - 1978
Event	Conf Rec Int Conf Commun 14th - Toronto, Ont, Can Duration: 4 Jun 1978 → 7 Jun 1978

Conference

Conference	Conf Rec Int Conf Commun 14th
City	Toronto, Ont, Can
Period	4/06/78 → 7/06/78

Cite this

@conference{82eee6d1c0d54b898f3a8061c9ebc8e9,

title = "RECOVERABLE PROTOCOL FOR LOOP-FREE DISTRIBUTED ROUTING.",

abstract = "An algorithm for constructing and adaptively maintaining routing tables is presented. The algorithm 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 of nodes and links, the network recovers in finite time in the sense of providing routing paths between all physically connected nodes.",

author = "A. Segall and Merlin, \{P. M.\} and Gallager, \{R. G.\}",

year = "1978",

language = "אנגלית",

note = "Conf Rec Int Conf Commun 14th ; Conference date: 04-06-1978 Through 07-06-1978",

}

TY - CONF

T1 - RECOVERABLE PROTOCOL FOR LOOP-FREE DISTRIBUTED ROUTING.

AU - Segall, A.

AU - Merlin, P. M.

AU - Gallager, R. G.

PY - 1978

Y1 - 1978

N2 - An algorithm for constructing and adaptively maintaining routing tables is presented. The algorithm 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 of nodes and links, the network recovers in finite time in the sense of providing routing paths between all physically connected nodes.

AB - An algorithm for constructing and adaptively maintaining routing tables is presented. The algorithm 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 of nodes and links, the network recovers in finite time in the sense of providing routing paths between all physically connected nodes.

UR - https://www.scopus.com/pages/publications/85095912707

M3 - ???researchoutput.researchoutputtypes.contributiontoconference.paper???

AN - SCOPUS:85095912707

T2 - Conf Rec Int Conf Commun 14th

Y2 - 4 June 1978 through 7 June 1978

ER -

RECOVERABLE PROTOCOL FOR LOOP-FREE DISTRIBUTED ROUTING.

Abstract

Conference

Other files and links

Fingerprint

Cite this