{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:20:49Z","timestamp":1750220449968,"version":"3.41.0"},"reference-count":19,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2021,3,5]],"date-time":"2021-03-05T00:00:00Z","timestamp":1614902400000},"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":[[2021,3,5]]},"abstract":"<jats:p>By delegating path control to end-hosts, future Internet architectures offer flexibility for path selection. However, a concern arises that the distributed routing decisions by endhosts, in particular load-adaptive routing, can lead to oscillations if path selection is performed without coordination or accurate load information. Prior research has addressed this problem by devising local path-selection policies that lead to global stability. However, little is known about the viability of these policies in the Internet context, where selfish end-hosts can deviate from a prescribed policy if such a deviation is beneficial from their individual perspective. In order to achieve network stability in future Internet architectures, it is essential that end-hosts have an incentive to adopt a stability-oriented path-selection policy.<\/jats:p>\n          <jats:p>In this work, we perform the first incentive analysis of the stability-inducing path-selection policies proposed in the literature. Building on a game-theoretic model of end-host path selection, we show that these policies are in fact incompatible with the self-interest of end-hosts, as these strategies make it worthwhile to pursue an oscillatory path-selection strategy. Therefore, stability in networks with selfish endhosts must be enforced by incentive-compatible mechanisms. We present two such mechanisms and formally prove their incentive compatibility.<\/jats:p>","DOI":"10.1145\/3453953.3453956","type":"journal-article","created":{"date-parts":[[2021,3,6]],"date-time":"2021-03-06T04:12:32Z","timestamp":1615003952000},"page":"12-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Incentivizing Stable Path Selection in Future Internet Architectures"],"prefix":"10.1145","volume":"48","author":[{"given":"Simon","family":"Scherrer","sequence":"first","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Legner","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adrian","family":"Perrig","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[{"name":"University of Vienna, Vienna, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,3,5]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/502034.502048"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3085591"},{"key":"e_1_2_1_3_1","volume-title":"IETF","author":"Dawkins S.","year":"2020","unstructured":"S. Dawkins . Path Aware Networking: Obstacles to Deployment (A Bestiary of Roads Not Taken). Internet-draft , IETF , 2020 . S. Dawkins. Path Aware Networking: Obstacles to Deployment (A Bestiary of Roads Not Taken). Internet-draft, IETF, 2020."},{"key":"e_1_2_1_4_1","volume-title":"Computer Networks","author":"Elwalid A.","year":"2002","unstructured":"A. Elwalid , C. Jin , S. Low , and I. Widjaja . MATE: Multipath adaptive traffic engineering . Computer Networks , 2002 . A. Elwalid, C. Jin, S. Low, and I. Widjaja. MATE: Multipath adaptive traffic engineering. Computer Networks, 2002."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2015.7417124"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1368436.1368438"},{"key":"e_1_2_1_7_1","volume-title":"Theoretical Computer Science","author":"Fischer S.","year":"2009","unstructured":"S. Fischer and B. V\u00f6cking . Adaptive routing with stale information . Theoretical Computer Science , 2009 . S. Fischer and B. V\u00f6cking. Adaptive routing with stale information. Theoretical Computer Science, 2009."},{"key":"e_1_2_1_8_1","author":"Godfrey P. B.","year":"2009","unstructured":"P. B. Godfrey , I. Ganichev , S. Shenker , and I. Stoica . Pathlet routing. ACM SIGCOMM Computer Communication Review , 2009 . P. B. Godfrey, I. Ganichev, S. Shenker, and I. Stoica. Pathlet routing. ACM SIGCOMM Computer Communication Review, 2009.","journal-title":"Pathlet routing. ACM SIGCOMM Computer Communication Review"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2003.1258797"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.23919\/ITC.2017.8064333"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080091.1080122"},{"key":"e_1_2_1_12_1","author":"Kelly F.","year":"2005","unstructured":"F. Kelly and T. Voice . Stability of end-to-end algorithms for joint routing and rate control. ACM SIGCOMM Computer Communication Review , 2005 . F. Kelly and T. Voice. Stability of end-to-end algorithms for joint routing and rate control. ACM SIGCOMM Computer Communication Review, 2005.","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2009.5339682"},{"key":"e_1_2_1_14_1","author":"Michael N.","year":"2014","unstructured":"N. Michael and A. Tang . HALO: Hop-by-hop adaptive link-state optimal routing. IEEE\/ACM Transactions on Networking , 2014 . N. Michael and A. Tang. HALO: Hop-by-hop adaptive link-state optimal routing. IEEE\/ACM Transactions on Networking, 2014.","journal-title":"HALO: Hop-by-hop adaptive link-state optimal routing. IEEE\/ACM Transactions on Networking"},{"key":"e_1_2_1_15_1","volume-title":"Adaptive proportional routing: a localized QoS routing approach","author":"Nelakuditi S.","year":"2002","unstructured":"S. Nelakuditi , Z.-L. Zhang , R. P. Tsang , and D. H.-C. Du . Adaptive proportional routing: a localized QoS routing approach . IEEE\/ACM Transactions on Networking , 2002 . S. Nelakuditi, Z.-L. Zhang, R. P. Tsang, and D. H.-C. Du. Adaptive proportional routing: a localized QoS routing approach. IEEE\/ACM Transactions on Networking, 2002."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015487"},{"key":"e_1_2_1_17_1","volume-title":"Performance Evaluation","author":"Scherrer S.","year":"2020","unstructured":"S. Scherrer , M. Legner , A. Perrig , and S. Schmid . Incentivizing stable path selection in future Internet archiectures . Performance Evaluation , 2020 . S. Scherrer, M. Legner, A. Perrig, and S. Schmid. Incentivizing stable path selection in future Internet archiectures. Performance Evaluation, 2020."},{"key":"e_1_2_1_18_1","author":"Shaikh A.","year":"2001","unstructured":"A. Shaikh , J. Rexford , and K. G. Shin . Evaluating the impact of stale link state on quality-of-service routing. IEEE\/ACM Transactions on Networking , 2001 . A. Shaikh, J. Rexford, and K. G. Shin. Evaluating the impact of stale link state on quality-of-service routing. IEEE\/ACM Transactions on Networking, 2001.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159913.1159934"}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3453953.3453956","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3453953.3453956","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:47:51Z","timestamp":1750193271000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3453953.3453956"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,5]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,3,5]]}},"alternative-id":["10.1145\/3453953.3453956"],"URL":"https:\/\/doi.org\/10.1145\/3453953.3453956","relation":{},"ISSN":["0163-5999"],"issn-type":[{"type":"print","value":"0163-5999"}],"subject":[],"published":{"date-parts":[[2021,3,5]]},"assertion":[{"value":"2021-03-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}