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

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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	I.R.E. transactions on communications systems 1981-01, Vol.29 (1), p.11-18
Hauptverfasser:	Gafni, E., Bertsekas, D.
Format:	Artikel
Sprache:	eng
Schlagworte:	Broadcasting Communication switching Distributed algorithms Interference Mobile communication Network topology Packet radio networks Packet switching Routing Wire
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!