On routing and flow control in data networks
Praveen Kumar, Lazaros F. Merakos · 1982
In quasi-static adaptation, estimates (of delays, etc.) are gathered during sessions, which form the basis for updating the parameters of routing and flow control for the succeeding session. If the estimates do not converge, i.e., conditions are not quasi-static enough, link flows may exceed their limits (congestion). Approximations are derived for small step sizes of updating to compute probability of congestion. Selection of algorithm parameters is discussed.