{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T04:09:09Z","timestamp":1782965349249,"version":"3.54.5"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001659","name":"German Research Foundation","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw."],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1109\/ton.2025.3531129","type":"journal-article","created":{"date-parts":[[2025,1,27]],"date-time":"2025-01-27T18:40:09Z","timestamp":1738003209000},"page":"1295-1308","source":"Crossref","is-referenced-by-count":4,"title":["RIFO: Pushing the Efficiency of Programmable Packet Schedulers"],"prefix":"10.1109","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8282-1571","authenticated-orcid":false,"given":"Habib","family":"Mostafaei","sequence":"first","affiliation":[{"name":"Department of Mathematics and Computer Science of Eindhoven University of Technology, Eindhoven, AZ, The Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6379-1490","authenticated-orcid":false,"given":"Maciej","family":"Pacut","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, Technical University Berlin (TU Berlin), Berlin, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7798-1711","authenticated-orcid":false,"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[{"name":"Fraunhofer SIT, Darmstadt, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/144191.144199"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486031"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/75247.75248"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2834050.2834085"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934899"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2834050.2834106"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1287\/opre.14.4.670"},{"key":"ref8","first-page":"59","article-title":"SP-PIFO: Approximating push-in first-out behaviors using strict-priority queues","volume-title":"Proc. 17th USENIX Symp. Netw. Syst. Design Implement. (NSDI)","author":"Alcoz"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3452296.3472887"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2020.3030102"},{"key":"ref11","volume-title":"Intel Intelligent Fabric Processors","year":"2022"},{"key":"ref12","first-page":"155","article-title":"Netvrm: Virtual register memory for programmable networks","volume-title":"Proc. 19th USENIX Symp. Networked Syst. Des. Implement.","author":"Zhu"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3157-6"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1201\/b11032"},{"key":"ref15","volume-title":"Token Bucket","year":"2022"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/90.649568"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF01553887"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.3233\/JHS-1994-3405"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1030194.1015499"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.matdes.2014.09.022"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10463-008-0215-z"},{"key":"ref22","volume-title":"Applied Nonparametric Statistics","author":"Daniel","year":"1990"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177728174"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-696-4_7"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100015681"},{"key":"ref26","volume-title":"Netbench","year":"2017"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2656877.2656890"},{"key":"ref28","first-page":"1","article-title":"Unlocking the power of inline floating-point operations on programmable switches","volume-title":"Proc. USENIX Symp. Networked Syst. Design Implement. (NSDI)","author":"Yuan"},{"key":"ref29","first-page":"67","article-title":"Evaluating the power of flexible packet processing for network resource allocation","volume-title":"Proc. USENIX Symp. Networked Syst. Design Implement. (NSDI)","author":"Sharma"},{"key":"ref30","volume-title":"Netberg Aurora 710","year":"2023"},{"key":"ref31","volume-title":"Data Plane Development Kit","year":"2023"},{"key":"ref32","first-page":"29","article-title":"Twenty years after: Hierarchical core-stateless fair queueing","volume-title":"Proc. 18th USENIX Symp. Networked Syst. Design Implement.","author":"Yu"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592576"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/248156.248171"},{"key":"ref35","first-page":"1","article-title":"Approximating fair queueing on reconfigurable switches","volume-title":"Proc. 15th USENIX Symp. Netw. Syst. Design Implement. (NSDI)","author":"Sharma"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3447868"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/90.803382"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3485371"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/2535771.2535796"},{"key":"ref40","first-page":"17","article-title":"Eiffel: Efficient and flexible software packet scheduling","volume-title":"Proc. USENIX Symp. Networked Syst. Design Implement. (NSDI)","author":"Saeed"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3341302.3342090"},{"key":"ref42","first-page":"455","article-title":"BBQ: A fast and scalable integer priority queue for hardware packet scheduling","volume-title":"Proc. 21st USENIX Symp. Networked Systems Design Implement.","author":"Atre"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3603269.3604862"},{"key":"ref44","first-page":"685","article-title":"Programmable calendar queues for high-speed packet scheduling","volume-title":"Proc. 17th USENIX Symp. Netw. Syst. Design Implement.","author":"Sharma"},{"key":"ref45","first-page":"551","article-title":"GearBox: A hierarchical packet scheduler for approximate weighted fair queuing","volume-title":"Proc. 19th USENIX Symp. Networked Syst. Design Implement.","author":"Gao"}],"container-title":["IEEE Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10723154\/11039001\/10854518.pdf?arnumber=10854518","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:37:35Z","timestamp":1750268255000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10854518\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6]]},"references-count":45,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/ton.2025.3531129","relation":{},"ISSN":["2998-4157"],"issn-type":[{"value":"2998-4157","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6]]}}}