Interactions Between Routing and Flow Control Algorithms

In this paper we discuss the interactions between routing and flow control algorithms for packet-switched networks. We present a new variation on the Gallager-Golestaani flow control scheme [4] and also a new variable window scheme. The tradeoff between throughput and network congestion is examined....

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	I.R.E. transactions on communications systems 1986-03, Vol.34 (3), p.269-277
Hauptverfasser:	Thaker, G., Cain, J.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithm design and analysis Applied sciences Communication system control Communication system traffic control Delay Exact sciences and technology Iterative algorithms Network topology Routing Systems, networks and services of telecommunications Telecommunication traffic Telecommunications Telecommunications and information theory Throughput Traffic control Transmission and modulation (techniques and equipments)
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	In this paper we discuss the interactions between routing and flow control algorithms for packet-switched networks. We present a new variation on the Gallager-Golestaani flow control scheme [4] and also a new variable window scheme. The tradeoff between throughput and network congestion is examined. It is shown that these two flow control schemes have the unique feature that the parameters can be specified to place an upper bound on the expected amount of network congestion.
ISSN:	0090-6778 0096-2244 1558-0857
DOI:	10.1109/TCOM.1986.1096526