{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T21:26:42Z","timestamp":1740173202500,"version":"3.37.3"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100005416","name":"Norges Forskningsr\u00e5d","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005416","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Control Netw. Syst."],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1109\/tcns.2021.3053179","type":"journal-article","created":{"date-parts":[[2021,1,20]],"date-time":"2021-01-20T20:47:09Z","timestamp":1611175629000},"page":"859-871","source":"Crossref","is-referenced-by-count":2,"title":["Estimating an Additive Path Cost With Explicit Congestion Notification"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9507-4373","authenticated-orcid":false,"given":"Peyman","family":"Teymoori","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David A.","family":"Hayes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8179-599X","authenticated-orcid":false,"given":"Michael","family":"Welzl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stein","family":"Gjessing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"article-title":"Estimating an additive path cost with explicit congestion notification","year":"2019","author":"teymoori","key":"ref39"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/LCN.2016.12"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.17487\/RFC8312"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5061901"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2188838"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2016.2619485"},{"article-title":"Mathematics of Internet Congestion Control","year":"2012","author":"r","key":"ref37"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1561\/1300000007"},{"key":"ref35","article-title":"&#x2018;Data center to the home'': Ultra-low latency for all","author":"schepper","year":"2015","journal-title":"R Project"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2012.060912.00176"},{"article-title":"Resolving tensions between congestion control scaling requirements","year":"2017","author":"briscoe","key":"ref10"},{"article-title":"Updated Specification of the IPv4 ID Field, RFC 6864 (Proposed Standard)","year":"2013","author":"touch","key":"ref40"},{"article-title":"More accurate ECN feedback in TCP","year":"2019","author":"briscoe","key":"ref11"},{"article-title":"Low latency, low loss, scalable throughput (L4S) Internet service: Architecture,&#x201D; Internet-Draft draft-ietf-tsvwg-l4s-arch-04","year":"2019","author":"briscoe","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s00199-010-0587-1"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2535771.2535788"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.17487\/RFC8087"},{"key":"ref16","first-page":"1","article-title":"&#x00DC;ber die theorie der einfachen ungleichungen","author":"farkas","year":"1902"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/90.251892"},{"key":"ref18","article-title":"Distributed control and resource pricing","author":"gibbens","year":"2000","journal-title":"ACM SIGCOMM Tutorial"},{"key":"ref19","first-page":"2490","article-title":"FAST TCP: Motivation, architecture, algorithms, performance","volume":"4","author":"jin","year":"0","journal-title":"Proc IEEE Int Conf Comput Commun"},{"key":"ref28","first-page":"20:20","article-title":"Controlling queue delay","volume":"10","author":"nichols","year":"2012"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851192"},{"article-title":"Problem Complexity and Method Efficiency in Optimization","year":"1983","author":"nemirovsky","key":"ref27"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1209228"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39939-9_4"},{"article-title":"The Inet framework","year":"0","author":"omnet++","key":"ref29"},{"key":"ref5","first-page":"253","article-title":"Less is more: Trading a little bandwidth for ultra-low latency in the data center","author":"alizadeh","year":"0","journal-title":"Proc 9th USENIX Conf Netw Syst Des Implementation"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2007.070076"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2012.082212.00018"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/190314.190317"},{"key":"ref1","first-page":"21","article-title":"On the Kuhn&#x2013;Tucker theorem","author":"abadie","year":"0","journal-title":"Nonlinear Programming"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633035"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/2999572.2999593"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1038\/sj.jors.2600523"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56478-9_35"},{"year":"2018","key":"ref42","article-title":"Mathematica 11.0, Wolfram Research, Inc."},{"key":"ref24","first-page":"237","article-title":"Optimization flow control with on-line measurement or multiple paths","author":"low","year":"0","journal-title":"Proc Int Teletraffic Congr"},{"article-title":"Scalable Performance Signalling and Congestion Avoidance","year":"2012","author":"m","key":"ref41"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3341302.3342085"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/2829988.2787484"},{"key":"ref26","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-79275-5","author":"low","year":"2017","journal-title":"Analytical Methods for Network Congestion Control"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24693-0_49"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.815297"}],"container-title":["IEEE Transactions on Control of Network Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6509490\/9523440\/09329063.pdf?arnumber=9329063","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,12]],"date-time":"2022-12-12T12:03:26Z","timestamp":1670846606000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9329063\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6]]},"references-count":45,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tcns.2021.3053179","relation":{},"ISSN":["2325-5870","2372-2533"],"issn-type":[{"type":"electronic","value":"2325-5870"},{"type":"electronic","value":"2372-2533"}],"subject":[],"published":{"date-parts":[[2021,6]]}}}