Stability and fairness of explicit congestion control with small buffers

Rate control protocols that utilise explicit feedback from routers are able to achieve fast convergence to an equilibrium which approximates processor-sharing on a single bottleneck link, and hence such protocols allow short flows to complete quickly. For a network, however, processor-sharing is not uniquely defined but corresponds with a choice of fairness criteria, and proportional fairness has a reasonable claim to be the network generalization of processor-sharing. In this paper, we develop a variant of RCP (rate control protocol) that achieves -fairness when buffers are small, in

• Type: Journal
• Year: 2008
• Where: CCR
• Authors: Frank P. Kelly, Gaurav Raina, Thomas Voice
• Keywords: CCR 2008, Rate Control, Rate Control Protocols, Single Bottleneck Link