{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:35:19Z","timestamp":1750307719181,"version":"3.41.0"},"reference-count":4,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2009,10,16]],"date-time":"2009-10-16T00:00:00Z","timestamp":1255651200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMETRICS Perform. Eval. Rev."],"published-print":{"date-parts":[[2009,10,16]]},"abstract":"<jats:p>In this paper, we introduce and investigate a novel class of multipath routing games with elastic traffic. Users open one or more connections along diffierent 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.<\/jats:p>","DOI":"10.1145\/1639562.1639587","type":"journal-article","created":{"date-parts":[[2009,10,27]],"date-time":"2009-10-27T13:28:14Z","timestamp":1256650094000},"page":"63-64","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Routing games with elastic traffic"],"prefix":"10.1145","volume":"37","author":[{"given":"Peter","family":"Key","sequence":"first","affiliation":[{"name":"Microsoft Research Cambridge, UK"}]},{"given":"Alexandre","family":"Proutiere","sequence":"additional","affiliation":[{"name":"Microsoft Research Cambridge, UK"}]}],"member":"320","published-online":{"date-parts":[[2009,10,16]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1002\/ett.4460080106"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.25"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1296179"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1006\/game.1997.0554"}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1639562.1639587","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1639562.1639587","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:30:27Z","timestamp":1750253427000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1639562.1639587"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,16]]},"references-count":4,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,10,16]]}},"alternative-id":["10.1145\/1639562.1639587"],"URL":"https:\/\/doi.org\/10.1145\/1639562.1639587","relation":{},"ISSN":["0163-5999"],"issn-type":[{"type":"print","value":"0163-5999"}],"subject":[],"published":{"date-parts":[[2009,10,16]]},"assertion":[{"value":"2009-10-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}