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