![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Wednesday 20 May 2009, 16:00-17:00
Routing Games with Elastic Traffic
- đ¤ Speaker: Peter Key, Microsoft Research Cambridge.
- đ Date & Time: Wednesday 20 May 2009, 16:00 - 17:00
- đ Venue: MR5, CMS, Wilberforce Road, Cambridge, CB3 0WB
Questions? Contact
Neil Walton
Abstract
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.
Series This talk is part of the Optimization and Incentives Seminar series.
Included in Lists
- All CMS events
- All Talks (aka the CURE list)
- bld31
- Cambridge talks
- CMS Events
- DPMMS info aggregator
- DPMMS lists
- 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
- yk449
Note: Ex-directory lists are not shown.