On the convergence to fairness in overloaded FIFO systems

Florin Ciucu, Oliver Hohlfeld, Lydia Y. Chen
2011 2011 Proceedings IEEE INFOCOM  
Many of today's computing and communication systems are based on FIFO queues whose performance, e.g., in terms of throughput and fairness, is highly impacted by load fluctuations, especially in the case of short-term overload. This paper analytically proves that overloaded FIFO queues are fair in the sense that each flow or aggregate of flows receives a proportional fair share of the service rate. The convergence rate is evaluated with respect to flow sizes and intensity of overutilization for
more » ... verutilization for two broad and distinctive arrival classes: Markovian and heavy-tailed/self-similar. For the former class the paper shows smaller convergence times at higher utilizations, which is exactly the opposite behavior characteristic to underloaded queueing systems.
doi:10.1109/infcom.2011.5935004 dblp:conf/infocom/CiucuHC11 fatcat:pujhh6t6pfbohfkd6hck6tfqmq