BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Insensitive\, maximum stable allocations converge to proportional 
 fairness - Neil Walton (University of Cambridge\, Statistical Laboratory.)
DTSTART:20101101T143000Z
DTEND:20101101T153000Z
UID:TALK27735@talks.cam.ac.uk
CONTACT:Elena Yudovina
DESCRIPTION:We describe a queueing model where service is allocated as a f
 unction of queue sizes. We consider allocations policies that are insensit
 ive to service requirements and have a maximal stability region. We take a
  limit where the queueing model become congested. We study how service is 
 allocated under this limit. We demonstrates that the only possible limit a
 llocation is one that maximizes a proportionally fair optimization problem
 .
LOCATION:MR12\,  Centre for Mathematical Sciences\, Wilberforce Road\, Cam
 bridge
END:VEVENT
END:VCALENDAR