Proportional fairness and its relationship with multi-class queueing networks

From MaRDI portal
Publication:1049565

DOI10.1214/09-AAP612zbMATH Open1198.60039arXiv0809.2697OpenAlexW3100718985MaRDI QIDQ1049565FDOQ1049565


Authors: Neil Walton Edit this on Wikidata


Publication date: 13 January 2010

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Abstract: We consider multi-class single-server queueing networks that have a product form stationary distribution. A new limit result proves a sequence of such networks converges weakly to a stochastic flow level model. The stochastic flow level model found is insensitive. A large deviation principle for the stationary distribution of these multi-class queueing networks is also found. Its rate function has a dual form that coincides with proportional fairness. We then give the first rigorous proof that the stationary throughput of a multi-class single-server queueing network converges to a proportionally fair allocation. This work combines classical queueing networks with more recent work on stochastic flow level models and proportional fairness. One could view these seemingly different models as the same system described at different levels of granularity: a microscopic, queueing level description; a macroscopic, flow level description and a teleological, optimization description.


Full work available at URL: https://arxiv.org/abs/0809.2697




Recommendations




Cites Work


Cited In (15)





This page was built for publication: Proportional fairness and its relationship with multi-class queueing networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1049565)