University of Cambridge > > Cambridge Networks and Communications meeting > Proportional Fairness and its Relationship to Multi-class Queueing Networks

Proportional Fairness and its Relationship to Multi-class Queueing Networks

Add to your list(s) Download to your calendar using vCal

  • UserNeil Walton (Statslab)
  • ClockMonday 21 July 2008, 12:30-13:00
  • HouseMR3, CMS.

If you have a question about this talk, please contact James Cruise.

Session 2, Cambridge Networks and Communication Meeting

A network of single server queues with routing is considered. It is proven a sequence of such networks can converge weakly to a stochastic flow level model. A large deviations principle for the stationary distribution of these networks is found. Its rate function has a dual formulation that coincides with proportional fairness. It is proven the throughput of the original queueing model behaves as a proportionally fair allocation as the number of customers across routes increases.

The queueing networks considered have no prescribed optimization structure. Regardless of this, we find proportional fairness forms the entropy minimizing state of these networks. From this it is found proportionally fair optimization occurs as a consequence of state space collapse behaviour in these non-optimizing queueing models.

This work merges classical results on queueing networks and recent work on proportional fairness. One could view these seemingly different models as the same system described at different levels of granularity: a microscopic packet/queueing level description; a macroscopic flow level description and a teleological optimization description.

This talk is part of the Cambridge Networks and Communications meeting series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity