{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T14:33:52Z","timestamp":1775745232488,"version":"3.50.1"},"reference-count":51,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,19]],"date-time":"2023-06-19T00:00:00Z","timestamp":1687132800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,19]],"date-time":"2023-06-19T00:00:00Z","timestamp":1687132800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,19]]},"DOI":"10.1109\/iwqos57198.2023.10188742","type":"proceedings-article","created":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T17:21:00Z","timestamp":1690478460000},"page":"01-10","source":"Crossref","is-referenced-by-count":5,"title":["RateSheriff: Multipath Flow-aware and Resource Efficient Rate Limiter Placement for Data Center Networks"],"prefix":"10.1109","author":[{"given":"Songshi","family":"Dou","sequence":"first","affiliation":[{"name":"Beijing Institute of Technology"}]},{"given":"Yongchao","family":"He","sequence":"additional","affiliation":[{"name":"Tsinghua University"}]},{"given":"Sen","family":"Liu","sequence":"additional","affiliation":[{"name":"Fudan University"}]},{"given":"Wenfei","family":"Wu","sequence":"additional","affiliation":[{"name":"Peking University"}]},{"given":"Zehua","family":"Guo","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787479"},{"key":"ref12","article-title":"{SENIC}: Scalable {NIC} for {End-Host} rate limiting","author":"radhakrishnan","year":"0","journal-title":"NSDI&#x2019; 14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3482898.3483361"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM42981.2021.9488773"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787478"},{"key":"ref10","article-title":"{EyeQ}: Practical network performance isolation at the edge","author":"jeyakumar","year":"0","journal-title":"NSDI'13"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2656877.2656890"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1355734.1355746"},{"key":"ref19","year":"2022","journal-title":"Intel tofino series programmable ethernet switch asic"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3341302.3342085"},{"key":"ref51","year":"2022","journal-title":"Gurobi Optimization"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/3387514.3405894"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2018.00019"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/3050220.3050228"},{"key":"ref48","author":"gary","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.32.9.1095"},{"key":"ref42","article-title":"{ATP}: In-network aggregation for multi-tenant learning","author":"lao","year":"0","journal-title":"NSDI 21"},{"key":"ref41","article-title":"{NetChain}:{Scale-Free}{Sub-RTT} coordination","author":"jin","year":"0","journal-title":"NSDI'18"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2018.00058"},{"key":"ref43","article-title":"Us secure hash algorithms (sha and shabased hmac and hkdf)","author":"eastlake","year":"2011","journal-title":"RFC 6234 May Tech Rep"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/1402946.1402967"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3479239.3485717"},{"key":"ref7","first-page":"472","article-title":"A comprehensive survey of the tactile internet: State-of-the-art and research directions","volume":"23","author":"promwongsa","year":"2020","journal-title":"IEEE COMST"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098852"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2010.5496972"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2427631.2427634"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3450550.3465347"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3511990"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132764"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/1868447.1868457"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.17487\/rfc6182"},{"key":"ref37","article-title":"Amp: An adaptive multipath tcp for data center networks","author":"kheirkhah","year":"0","journal-title":"IFIP Networking&#x2019; 19"},{"key":"ref36","article-title":"D? 2-mtcp: Light-weight coding for efficient multi-path transmission in data center network","author":"sun","year":"0","journal-title":"IEEE IPDPS'17"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS51616.2021.00041"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1872007.1872046"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2016.2586112"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.17487\/rfc6824"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3387514.3405887"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2829988.2787508"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3302424.3303979"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524530"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3387514.3405855"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3472716.3472855"},{"key":"ref26","article-title":"Hedera: dynamic flow scheduling for data center networks","author":"al-fares","year":"0","journal-title":"NSDI&#x2019;10"},{"key":"ref25","year":"2022","journal-title":"Behavioral model (bmv2)"},{"key":"ref20","article-title":"Design, implementation and evaluation of congestion control for multipath {TCP}","author":"wischik","year":"0","journal-title":"NSDI '11"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2021.103169"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2043164.2018467"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8057182"},{"key":"ref27","article-title":"{Information-Agnostic} flow scheduling for commodity data centers","author":"bai","year":"0","journal-title":"NSDI '15"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592576"}],"event":{"name":"2023 IEEE\/ACM 31st International Symposium on Quality of Service (IWQoS)","location":"Orlando, FL, USA","start":{"date-parts":[[2023,6,19]]},"end":{"date-parts":[[2023,6,21]]}},"container-title":["2023 IEEE\/ACM 31st International Symposium on Quality of Service (IWQoS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10188660\/10188690\/10188742.pdf?arnumber=10188742","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,14]],"date-time":"2023-08-14T17:38:40Z","timestamp":1692034720000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10188742\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,19]]},"references-count":51,"URL":"https:\/\/doi.org\/10.1109\/iwqos57198.2023.10188742","relation":{},"subject":[],"published":{"date-parts":[[2023,6,19]]}}}