BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Routing Games with Elastic Traffic - Peter Key\, Microsoft Researc
 h Cambridge.
DTSTART:20090520T150000Z
DTEND:20090520T160000Z
UID:TALK18342@talks.cam.ac.uk
CONTACT:Neil Walton
DESCRIPTION:We introduce and investigate a novel class of multipath routin
 g games with elastic traffic. Users open one or more connections along dif
 ferent feasible paths from source to destination and act selfishly- seekin
 g to transfer  data as fast as possible. Users only control their routing 
 choices \, and once these choices have been made\, the connection rates ar
 e elastic and determined via congestion control algorithms (e.g. TCP) whic
 h ultimately maximize a certain notion of the network utility. We analyze 
 the existence and the performance of the Nash Equilibria (NEs) of the resu
 lting routing games.
LOCATION:MR5\, CMS\, Wilberforce Road\, Cambridge\, CB3 0WB
END:VEVENT
END:VCALENDAR