On the behavior of optimal scheduling algorithms under TCP sources

Abstract

We focus on the dynamical interaction between regulated additive increase multiplicative decrease (AIMD) traffic sources and the max-scalar scheduling policy, which has been proved to be optimal in terms of throughput in case of stationary unregulated traffic sources. We describe the average dynamics of both sources and queues dynamics through a system of ordinary differential equations (ODEs), which is numerically solved