{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:52:22Z","timestamp":1725587542901},"reference-count":33,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"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":[[2020,6]]},"DOI":"10.1109\/iwqos49365.2020.9212844","type":"proceedings-article","created":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T20:03:04Z","timestamp":1602014584000},"page":"1-10","source":"Crossref","is-referenced-by-count":0,"title":["Supporting Multi-dimensional and Arbitrary Numbers of Ranks for Software Packet Scheduling"],"prefix":"10.1109","author":[{"given":"Jiaqi","family":"Zheng","sequence":"first","affiliation":[]},{"given":"Yanan","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Bingchuan","family":"Tian","sequence":"additional","affiliation":[]},{"given":"Huaping","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Chen","family":"Tian","sequence":"additional","affiliation":[]},{"given":"Guihai","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Wanchun","family":"Dou","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Programmable packet scheduling at line rate","year":"0","key":"ref33"},{"key":"ref32","first-page":"273","author":"cormen","year":"2001","journal-title":"Introduction to Algorithms"},{"key":"ref31","first-page":"199","author":"sedgewick","year":"1983","journal-title":"Algorithms"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0028285"},{"key":"ref10","first-page":"501","article-title":"Universal packet scheduling","author":"mittal","year":"2016","journal-title":"NSDI"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2534169.2486031"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934899"},{"key":"ref13","first-page":"17","article-title":"Eiffel: Efficient and flexible software packet scheduling","author":"saeed","year":"2019","journal-title":"NSDI"},{"journal-title":"Huawei switch","year":"0","key":"ref14"},{"journal-title":"Catalyst 2960 switch software configuration guide","year":"0","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230569"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2017.8117533"},{"journal-title":"Virtual networking in Linux","year":"0","author":"jones","key":"ref18"},{"journal-title":"Bess overview","year":"0","key":"ref19"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2834050.2834106"},{"key":"ref4","first-page":"123","article-title":"A ¢-competitive algorithm for scheduling packets with deadlines","author":"vesel\u00fd","year":"2019","journal-title":"SODA"},{"journal-title":"H3c acl and qos configuration guide","year":"0","key":"ref27"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1145\/2377677.2377709","article-title":"Deadline-aware datacen-ter tcp (D2TCP)","author":"vamanan","year":"2012","journal-title":"SIGCOMM"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2534169.2486028"},{"key":"ref29","first-page":"302","article-title":"The K-D heap: An efficient multidimensional priority queue","author":"ding","year":"0","journal-title":"Proc Algorithms Data Structures Third Workshop WADS '93"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6567018"},{"key":"ref8","first-page":"431","article-title":"Titan: Fair packet scheduling for commodity multiqueue nics","author":"stephens","year":"2017","journal-title":"ATC"},{"key":"ref7","first-page":"33","article-title":"Loom: Flexible and efficient NIC packet scheduling","author":"stephens","year":"2019","journal-title":"NSDI"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098839"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2999572.2999575"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230564"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.17487\/rfc0791"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.17487\/rfc1349"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.17487\/rfc1122"},{"key":"ref24","first-page":"864","article-title":"Scheduling coflows of multistage jobs to minimize the total weighted job completion time","author":"tian","year":"2018","journal-title":"Infocom IEEE"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.17487\/rfc2474"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3232565.3234504"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2018.00012"}],"event":{"name":"2020 IEEE\/ACM 28th International Symposium on Quality of Service (IWQoS)","start":{"date-parts":[[2020,6,15]]},"location":"Hang Zhou, China","end":{"date-parts":[[2020,6,17]]}},"container-title":["2020 IEEE\/ACM 28th International Symposium on Quality of Service (IWQoS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9203768\/9212810\/09212844.pdf?arnumber=9212844","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T21:58:02Z","timestamp":1656453482000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9212844\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/iwqos49365.2020.9212844","relation":{},"subject":[],"published":{"date-parts":[[2020,6]]}}}