Gafni1981

Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing Topology

Eli M. Gafni, Dimitri P. Bertsekas
Laboratory for Information and Decision Systems
Massachusetts Insitute of Technology
Gambridge, MA 02139

IEEE Transactions on Communications
Vol. 29, No. 1
pp. 11-18
IEEE, January 1981

Paper:

Abstract

We consider the problem of maintaining communication between the nodes of a data network and a central station in the presence of frequent topological changes as, for example, in mobile packet radio networks. We argue that flooding schemes have significant drawbacks for such networks, and propose a general class of distributed algorithms for establishing new loop-free routes to the station for any node left without a route due to changes in the network topology. By virtue of built-in redundancy, the algorithms are typically activated very infrequently and, even when they are, they do not involve any communication within the portion of the network that has not heen materially affected by a topological change.

Comment

Gafni-Bertsekas Algorithm (GB)

BibTeX

@INCOLLECTION(Gafni1981,
   TITLE = {Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing Topology},
   AUTHOR = {Eli M. Gafni and Dimitri P. Bertsekas},
   BOOKTITLE = {IEEE Transactions on Communications},
   SERIES = {IEEE Transactions on Communications},
   VOLUME = {29},
   NUMBER = {1},
   PAGES = {11-18},
   ORGANIZATION = {IEEE},
   PUBLISHER = {IEEE},
   MONTH = {January},
   YEAR = {1981},
   URL = {http://www.mit.edu/people/dimitrib/Gafni_Loopfree.pdf},
   FILE = {gafni-bertsekas.pdf}
)

"Gafni1981" is mentioned on: Ad-Hoc Protocols (Classification) | Ad-Hoc Protocols (History) | Ad-Hoc-Papers | Gafni-Bertsekas