BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:On the Fluid Limits of a Resource Sharing Algorithm with Logarithm
 ic Weights - Robert\, PH (INRIA Paris - Rocquencourt)
DTSTART:20130812T090000Z
DTEND:20130812T094500Z
UID:TALK46577@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:The properties of a class of resource allocation algorithms fo
 r communication networks are presented in this talk.The algorithm is as fo
 llows: if a node of this network has x requests to transmit\, then it rece
 ives 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 scale
 s phenomenon is exhibited. It is also shown that these algorithms with log
 arithmics weights have remarkable\, unsual\, fairness properties. A heavy 
 traffic limit theorem for the invariant distribution is proved.  Joint wor
 k with Amandine Veber.\n
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR