Sites Inria

Version française

Séminaire des équipes de recherche

On the Fluid Limits of a Resource Sharing Algorithm with Logarithmic Weights

  • Date : 15/11/2012
  • Place : Rocquencourt, bâtiment 9
  • Guest(s) : Philippe Robert, Inria Paris - Rocquencourt
  • Organiser(s) : RAP

The following class of resource allocation algorithms for communication networks is investigated: if a node of this network has x requests to transmit, then it receives a fraction of the capacity proportional to
log(x), the logarithm of its current load. A fluid scaling analysis of such a network is presented in a simple setting. It is shown that three different times scales play an important role in the evolution of such a
system. An interesting interaction of time scales phenomenon is exhibited. It is also shown that these algorithms with logarithmics weights have remarkable, unsual,  fairness properties. A heavy traffic
limit theorem for the invariant distribution is proved.
Joint work with Amandine Veber (CMAP, Ecole Polytechnique)

Keywords: Paris - Rocquencourt Séminaire RAP