DocumentCode
778219
Title
Interactions Between Routing and Flow Control Algorithms
Author
Thaker, Gautam H. ; Cain, J. Bibb
Author_Institution
Advanced Tech. Dept., Harris Corp., Government Systems Sector, Melbourne, FL
Volume
34
Issue
3
fYear
1986
fDate
3/1/1986 12:00:00 AM
Firstpage
269
Lastpage
277
Abstract
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.
Keywords
Packet switching; Algorithm design and analysis; Communication system control; Communication system traffic control; Delay; Iterative algorithms; Network topology; Routing; Telecommunication traffic; Throughput; Traffic control;
fLanguage
English
Journal_Title
Communications, IEEE Transactions on
Publisher
ieee
ISSN
0090-6778
Type
jour
DOI
10.1109/TCOM.1986.1096526
Filename
1096526
Link To Document