Abstract

We present an approximate analysis of a queue with dynamically changing input rates that are based on implicit or explicit feedback information. This is motivated by proposals for adaptive congestion control algorithms [RaJa 88, Jac 88], where the sender's window size at the transport level is adjusted based on perceived congestion level of a bottleneck node. We develop an analysis methodology for a simplified system; however, it is powerful enough to answer the important questions regarding stability, convergence (or oscillations), fairness and the significant effect that delayed feedback plays on performance. Specifically, we find that, in the absence of feedback delay, the linear increase/exponential decrease algorithm of Jacobson and Ramakrishnan-Jain [Jac 88, RaJa 88] is provably stable and fair. Delayed feedback, on the other hand, introduces oscillations for every individual user as well as unfairness across those competing for the same resource. While the simulation study of Zhang [Zha 89]...

Citations