Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks

We propose a class of algorithms for finding an optimal quasi-static routing in a communication network. The algorithms are based on Gallager's method [1] and provide methods for iteratively updating the routing table entries of each node in a manner that guarantees convergence to a minimum del...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	I.R.E. transactions on communications systems 1984-08, Vol.32 (8), p.911-919
Hauptverfasser:	Bertsekas, D., Gafni, E., Gallager, R.
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Communication networks Communications Society Convergence Delay Distributed computing Exact sciences and technology Iterative algorithms Optimization methods Routing Statistical distributions Systems, networks and services of telecommunications Telecommunication traffic Telecommunications Telecommunications and information theory Transmission and modulation (techniques and equipments)
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!