The INI has a new website!

This is a legacy webpage. Please visit the new site to ensure you are seeing up to date information.

Skip to content



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

Robert, PH (INRIA Paris - Rocquencourt)
Monday 12 August 2013, 10:00-10:45

Seminar Room 1, Newton Institute


The properties of a class of resource allocation algorithms for communication networks are presented in this talk.The algorithm is as follows: 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. It is shown that several 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.


[pdf ]


The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.

Back to top ∧