{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T06:10:27Z","timestamp":1756534227473,"version":"3.44.0"},"reference-count":33,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,8,4]],"date-time":"2025-08-04T00:00:00Z","timestamp":1754265600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,8,4]],"date-time":"2025-08-04T00:00:00Z","timestamp":1754265600000},"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":[[2025,8,4]]},"DOI":"10.1109\/icccn65249.2025.11134021","type":"proceedings-article","created":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T17:39:20Z","timestamp":1756489160000},"page":"1-9","source":"Crossref","is-referenced-by-count":0,"title":["CT-PIFO: A Congruity Tree Based Packet Scheduler to Improve Flow Completion Time"],"prefix":"10.1109","author":[{"given":"Pralhad","family":"Magadum","sequence":"first","affiliation":[{"name":"Indian Institute of Technology,Department of Computer Science &#x0026; Engineering,Indore,India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sourabh","family":"Singh","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology,Department of Computer Science &#x0026; Engineering,Indore,India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aniruddha Singh","family":"Kushwaha","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology,Department of Computer Science &#x0026; Engineering,Indore,India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"year":"2024","article-title":"Netbench","key":"ref1"},{"year":"2025","article-title":"Token bucket","key":"ref2"},{"key":"ref3","first-page":"59","article-title":"SP-PIFO: Approximating Push-In First-Out behaviors using Strict-Priority queues","volume-title":"17th USENIX Symposium on Networked Systems Design and Implementation (NSDI 20)","author":"Alcoz"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1145\/1851182.1851192"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1145\/2534169.2486031"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1145\/2656877.2656890"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/TNET.2024.3399212"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1145\/2619239.2626315"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1145\/144179.144199"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1145\/75247.75248"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1145\/2740070.2626322"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/TNSM.2023.3304894"},{"key":"ref13","first-page":"75","article-title":"Sifter: An Inversion-Free and Large-Capacity programmable packet scheduler","volume-title":"21st USENIX Symposium on Networked Systems Design and Implementation (NSDI 24)","author":"Gao"},{"key":"ref14","first-page":"551","article-title":"Gearbox: A hierarchical packet scheduler for approximate weighted fair queuing","volume-title":"19th USENIX Symposium on Networked Systems Design and Implementation (NSDI 22)","author":"Gao"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1145\/99508.99523"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1145\/248156.248171"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1007\/BF01553887"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1109\/INFOCOM53939.2023.10228997"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1145\/1355734.1355746"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1145\/2834050.2834085"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1109\/TON.2025.3531129"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1145\/1965724.1965751"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1109\/INFCOM.1992.263509"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1145\/2342356.2342396"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1287\/opre.14.4.670"},{"key":"ref26","first-page":"1","article-title":"Approximating fair queueing on reconfigurable switches","volume-title":"15th USENIX Symposium on Networked Systems Design and Implementation (NSDI 18)","author":"Sharma"},{"key":"ref27","first-page":"685","article-title":"Programmable calendar queues for high-speed packet scheduling","volume-title":"17th USENIX Symposium on Networked Systems Design and Implementation (NSDI 20)","author":"Sharma"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1109\/90.502236"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1145\/3341302.3342090"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1145\/2934872.2934899"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1109\/TNET.2022.3142148"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1145\/3603269.3604862"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1145\/3452296.3472887"}],"event":{"name":"2025 34th International Conference on Computer Communications and Networks (ICCCN)","start":{"date-parts":[[2025,8,4]]},"location":"Tokyo, Japan","end":{"date-parts":[[2025,8,7]]}},"container-title":["2025 34th International Conference on Computer Communications and Networks (ICCCN)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11133715\/11133717\/11134021.pdf?arnumber=11134021","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T05:33:18Z","timestamp":1756531998000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11134021\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,4]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/icccn65249.2025.11134021","relation":{},"subject":[],"published":{"date-parts":[[2025,8,4]]}}}