{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T09:37:47Z","timestamp":1774517867650,"version":"3.50.1"},"reference-count":42,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100006190","name":"Research and Development","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006190","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,11,1]]},"DOI":"10.1109\/icnp52444.2021.9651944","type":"proceedings-article","created":{"date-parts":[[2021,12,28]],"date-time":"2021-12-28T21:32:43Z","timestamp":1640727163000},"page":"1-11","source":"Crossref","is-referenced-by-count":22,"title":["PIPO: Efficient Programmable Scheduling for Time Sensitive Networking"],"prefix":"10.1109","author":[{"given":"Chuwen","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhikang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haoyu","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruyi","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji","family":"Miao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","year":"0"},{"key":"ref38","year":"0"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/90.649569"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155434"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1023\/A:1004649425222"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s42045-020-00031-0"},{"key":"ref37","article-title":"Packet size distribution","year":"0"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934900"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.189"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2534169.2486031"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1996.497885"},{"key":"ref40","year":"0"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1990.91316"},{"key":"ref12","first-page":"475","article-title":"SENIC: Scalable nic for end-host rate limiting","author":"radhakrishnan","year":"2014","journal-title":"Proceedings of USENIX NSDI"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098852"},{"key":"ref14","year":"0"},{"key":"ref15","first-page":"501","article-title":"Universal packet scheduling","author":"mittal","year":"2016","journal-title":"Proceedings of USENIX NSDI"},{"key":"ref16","article-title":"SP-PIFO: Approximating push-in first-out behaviors using strict-priority queues","author":"alcoz","year":"2020","journal-title":"Proceedings of USENIX NSDI"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3452296.3472887"},{"key":"ref18","first-page":"1215","article-title":"Scalable hardware priority queue architectures for high-speed packet switches","volume":"49","author":"moon","year":"2000","journal-title":"TOC"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.892882"},{"key":"ref28","first-page":"13","article-title":"IEEE 802.1 Qbv gate control list synthesis using array theory encoding","author":"oliver","year":"2018","journal-title":"Proc IEEE RTAS"},{"key":"ref4","first-page":"17","article-title":"Eiffel: Efficient and flexible software packet scheduling","author":"saeed","year":"2019","journal-title":"Proceedings of USENIX NSDI"},{"key":"ref27","first-page":"183","article-title":"Scheduling real-time communication in IEEE 802.1 Qbv time sensitive networks","author":"craciunas","year":"2016","journal-title":"Proceedings of ACM RTNS"},{"key":"ref3","article-title":"IEEE standard for local and metropolitan area networks - bridges and bridged networks amendment: Asynchronous traffic shaping","year":"2018","journal-title":"IEEE Std"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/75246.75248"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ETFA.2016.7733740"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934899"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832227"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3341302.3342090"},{"key":"ref2","first-page":"1","article-title":"IEEE standard for local and metropolitan area networks&#x2013;bridges and bridged networks - amendment 29: Cyclic queuing and forwarding","year":"2017","journal-title":"IEEE Std"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/90.502236"},{"key":"ref1","first-page":"1","article-title":"IEEE standard for local and metropolitan area networks&#x2013;bridges and bridged networks - amendment 25: Enhancements for scheduled traffic","year":"2016","journal-title":"IEEE Std"},{"key":"ref20","first-page":"685","article-title":"Programmable calendar queues for high-speed packet scheduling","author":"sharma","year":"2020","journal-title":"Proceedings of USENIX NSDI"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.3233\/JHS-1994-3405"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/63039.63045"},{"key":"ref42","year":"0"},{"key":"ref24","first-page":"1","article-title":"IEEE standard for local and metropolitan area networks &#x2013;bridges and bridged networks - amendment 26: Frame preemption","year":"2016","journal-title":"IEEE Std"},{"key":"ref41","year":"0"},{"key":"ref23","first-page":"1","article-title":"IEEE standard for local and metropolitan area networks&#x2014;virtual bridged local area networks amendment 12: Forwarding and queuing enhancements for time-sensitive streams","year":"2009","journal-title":"IEEE Std"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2010.25"},{"key":"ref25","first-page":"1","article-title":"IEEE standard for ethernet amendment 5: Specification and management parameters for interspersing express traffic","year":"2016","journal-title":"IEEE Std"}],"event":{"name":"2021 IEEE 29th International Conference on Network Protocols (ICNP)","location":"Dallas, TX, USA","start":{"date-parts":[[2021,11,1]]},"end":{"date-parts":[[2021,11,5]]}},"container-title":["2021 IEEE 29th International Conference on Network Protocols (ICNP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9651731\/9651908\/09651944.pdf?arnumber=9651944","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T17:00:05Z","timestamp":1652202005000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9651944\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,1]]},"references-count":42,"URL":"https:\/\/doi.org\/10.1109\/icnp52444.2021.9651944","relation":{},"subject":[],"published":{"date-parts":[[2021,11,1]]}}}