Routing Games with Elastic Traffic

Add to your list(s) Download to your calendar using vCal

• Peter Key, Microsoft Research Cambridge.
• Wednesday 20 May 2009, 16:00-17:00
• MR5, CMS, Wilberforce Road, Cambridge, CB3 0WB.

If you have a question about this talk, please contact Neil Walton.

We introduce and investigate a novel class of multipath routing games with elastic traffic. Users open one or more connections along different feasible paths from source to destination and act selfishly- seeking to transfer data as fast as possible. Users only control their routing choices , and once these choices have been made, the connection rates are elastic and determined via congestion control algorithms (e.g. TCP ) which ultimately maximize a certain notion of the network utility. We analyze the existence and the performance of the Nash Equilibria (NEs) of the resulting routing games.

This talk is part of the Optimization and Incentives Seminar series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Cambridge talks
• DPMMS Lists
• DPMMS info aggregator
• DPMMS lists
• Economics and Computer Science Talks
• Hanchen DaDaDash
• Interested Talks
• MR5, CMS, Wilberforce Road, Cambridge, CB3 0WB
• Optimization and Incentives Seminar
• School of Physical Sciences
• Statistical Laboratory info aggregator
• Trust & Technology Initiative - interesting events
• bld31

Note that ex-directory lists are not shown.