{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T00:09:26Z","timestamp":1760746166565,"version":"build-2065373602"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-2106294"],"award-info":[{"award-number":["CNS-2106294"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw."],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1109\/ton.2025.3561308","type":"journal-article","created":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T13:54:45Z","timestamp":1746453285000},"page":"2241-2255","source":"Crossref","is-referenced-by-count":0,"title":["Overlay Routing Over an Uncooperative Underlay"],"prefix":"10.1109","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1727-6754","authenticated-orcid":false,"given":"Yudi","family":"Huang","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Pennsylvania State University, University Park, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1070-7483","authenticated-orcid":false,"given":"Ting","family":"He","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Pennsylvania State University, University Park, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3565287.3610274"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/9781118909690.ch16"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3093232"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098856"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155503"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2022.3155475"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3190508.3190519"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2019.2934896"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.139"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3656298"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.39"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2007.70726"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2008.155"},{"article-title":"Inferring congestion sharing and path characteristics from packet interarrival times","year":"2001","author":"Katabi","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1017\/9781108377119"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.749302"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/18.971737"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2004.838612"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2009.2022538"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2168901"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/511399.511337"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.884020"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2304431"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195532"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6420\/aae798"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.2985908"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2019.8761099"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2022.3164336"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-015-2459-2"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/316194.316228"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2004.838606"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.899014"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.815304"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/LCN.2014.6925767"},{"key":"ref35","doi-asserted-by":"crossref","DOI":"10.17487\/RFC8382","article-title":"Shared bottleneck detection for coupled congestion control for RTP media","author":"Hayes","year":"2018"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/1452520.1452554"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.896251"},{"key":"ref38","first-page":"111","article-title":"Experimental evaluation of approximation algorithms for the minimum cost multiple-source unsplittable flow problem","volume-title":"Proc. ICALP Satell. Workshops","author":"Asano"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1287\/opre.48.2.318.12378"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1080\/00031305.2012.687494"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.111002"},{"key":"ref42","article-title":"REPETITA: Repeatable experiments for performance evaluation of traffic-engineering algorithms","author":"Gay","year":"2017","journal-title":"arXiv:1710.08665"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/1064212.1064240"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2003.819974"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/1096536.1096551"}],"container-title":["IEEE Transactions on Networking"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/10723154\/11205918\/10988596-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10723154\/11205918\/10988596.pdf?arnumber=10988596","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T04:38:35Z","timestamp":1760675915000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10988596\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10]]},"references-count":45,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/ton.2025.3561308","relation":{},"ISSN":["2998-4157"],"issn-type":[{"type":"electronic","value":"2998-4157"}],"subject":[],"published":{"date-parts":[[2025,10]]}}}