{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T07:48:38Z","timestamp":1767772118880,"version":"3.41.0"},"reference-count":35,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2024,2,15]],"date-time":"2024-02-15T00:00:00Z","timestamp":1707955200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61932010, 62133014, 61972139, 62141212, and 62272155"],"award-info":[{"award-number":["61932010, 62133014, 61972139, 62141212, and 62272155"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004735","name":"Natural Science Foundation of Hunan Province","doi-asserted-by":"crossref","award":["2022JJ10021, 2021JJ10023, and 2021JJ30150"],"award-info":[{"award-number":["2022JJ10021, 2021JJ10023, and 2021JJ30150"]}],"id":[{"id":"10.13039\/501100004735","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100005230","name":"Natural Science Foundation of Chongqing","doi-asserted-by":"crossref","award":["cstc2021jcyj-msxmX0461, CSTB2022NSCQ-MSX1393, and CSTB2022NSCQ-MSX1088"],"award-info":[{"award-number":["cstc2021jcyj-msxmX0461, CSTB2022NSCQ-MSX1393, and CSTB2022NSCQ-MSX1088"]}],"id":[{"id":"10.13039\/501100005230","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Des. Autom. Electron. Syst."],"published-print":{"date-parts":[[2024,3,31]]},"abstract":"<jats:p>Time-Sensitive Networking (TSN) realizes high bandwidth and time determinism for data transmission and thus becomes the crucial communication technology in time-critical systems. The Gate Control List (GCL) is used to control the transmission of different classes of traffic in TSN, including Time-Triggered (TT) flows, Audio-Video-Bridging (AVB) flows, and Best-Effort (BE) flows. Most studies focus on optimizing GCL synthesis by reserving the preceding time slots to serve TT flows with the strict delay requirement, but ignore the deadlines of non-TT flows and cause the large delay. Therefore, this paper proposes a comprehensive scheduling method to enhance the real-time scheduling of AVB flows while guaranteeing the time determinism of TT flows. This method first optimizes GCL synthesis to reserve the preceding time slots for AVB flows, and then introduces the Earliest Deadline First (EDF) method to further improve the transmission of AVB flows by considering their deadlines. Moreover, the worst-case delay (WCD) analysis method is proposed to verify the effectiveness of the proposed method. Experimental results show that the proposed method improves the transmission of AVB flows compared to the state-of-the-art methods.<\/jats:p>","DOI":"10.1145\/3637878","type":"journal-article","created":{"date-parts":[[2023,12,18]],"date-time":"2023-12-18T11:54:30Z","timestamp":1702900470000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Enhanced Real-time Scheduling of AVB Flows in Time-Sensitive Networking"],"prefix":"10.1145","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8696-748X","authenticated-orcid":false,"given":"Libing","family":"Deng","sequence":"first","affiliation":[{"name":"Hunan University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1663-7981","authenticated-orcid":false,"given":"Gang","family":"Zeng","sequence":"additional","affiliation":[{"name":"Nagoya University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8565-5799","authenticated-orcid":false,"given":"Ryo","family":"Kurachi","sequence":"additional","affiliation":[{"name":"Nagoya University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3544-2397","authenticated-orcid":false,"given":"Hiroaki","family":"Takada","sequence":"additional","affiliation":[{"name":"Nagoya University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3596-071X","authenticated-orcid":false,"given":"Xiongren","family":"Xiao","sequence":"additional","affiliation":[{"name":"Hunan University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4573-7375","authenticated-orcid":false,"given":"Renfa","family":"Li","sequence":"additional","affiliation":[{"name":"Hunan University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6625-0350","authenticated-orcid":false,"given":"Guoqi","family":"Xie","sequence":"additional","affiliation":[{"name":"Hunan University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,2,15]]},"reference":[{"key":"e_1_3_1_2_2","unstructured":"2009. IEEE 802.1Qav-2009 - IEEE Standard for Local and Metropolitan Area Networks\u2013 Virtual Bridged Local Area Networks Amendment 12: Forwarding and Queuing Enhancements for Time-Sensitive Streams. (2009). https:\/\/standards.ieee.org\/standard\/802_1Qav-2009.html"},{"key":"e_1_3_1_3_2","unstructured":"2015. IEEE 802.1Qbv-2015 - IEEE Standard for Local and Metropolitan Area Networks \u2013 Bridges and Bridged Networks - Amendment 25: Enhancements for Scheduled Traffic. (2015). https:\/\/standards.ieee.org\/standard\/802_1Qbv-2015.html"},{"key":"e_1_3_1_4_2","first-page":"1","article-title":"IEEE Standard for Local and Metropolitan Area Network\u2013Bridges and Bridged Networks","year":"2018","unstructured":"2018. IEEE Standard for Local and Metropolitan Area Network\u2013Bridges and Bridged Networks. IEEE Std 802.1Q-2018 (Revision of IEEE Std 802.1Q-2014) (July2018), 1\u20131993.","journal-title":"IEEE Std 802.1Q-2018 (Revision of IEEE Std 802.1Q-2014)"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPSR52026.2021.9481803"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/2593069.2593136"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3069142"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/WFCS.2016.7496507"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3061969"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/ETFA46521.2020.9211969"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/2997465.2997470"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2022.102586"},{"issue":"2","key":"e_1_3_1_13_2","first-page":"31","article-title":"A survey of real-time Ethernet modeling and design methodologies: From AVB to TSN","volume":"55","author":"Deng Libing","year":"2022","unstructured":"Libing Deng, Guoqi Xie, Hong Liu, Yunbo Han, Renfa Li, and Keqin Li. 2022. A survey of real-time Ethernet modeling and design methodologies: From AVB to TSN. ACM Comput. Surv. 55, 2, Article 31 (Jan.2022), 36 pages.","journal-title":"ACM Comput. Surv."},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/2997465.2997494"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/WFCS.2018.8402374"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2883644"},{"volume-title":"Preemptive and Non-Preemptive Real-Time UniProcessor Scheduling","author":"George Laurent","key":"e_1_3_1_17_2","unstructured":"Laurent George, Nicolas Rivierre, and Marco Spuri. Preemptive and Non-Preemptive Real-Time UniProcessor Scheduling. Technical Report."},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/3453417.3453423"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2021.1003844"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/IECON48115.2021.9589998"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/3015037.3015044"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/DAC56929.2023.10247817"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/3139258.3139283"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/ETFA.2018.8502515"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2022.3184069"},{"key":"e_1_3_1_26_2","article-title":"Optimization algorithms for the scheduling of IEEE 802.1 time-sensitive networking (TSN)","author":"Raagaard Michael Lander","year":"2017","unstructured":"Michael Lander Raagaard and Paul Pop. 2017. Optimization algorithms for the scheduling of IEEE 802.1 time-sensitive networking (TSN). Tech. Univ. Denmark, Lyngby, Denmark, Tech. Rep (Jan.2017).","journal-title":"Tech. Univ. Denmark, Lyngby, Denmark, Tech. Rep"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/WFCS47810.2020.9114414"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.23919\/FMCAD.2019.8894249"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3168136"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","unstructured":"Fedor Smirnov Michael Gla\u00df Felix Reimann and J\u00fcrgen Teich. 2017. Formal timing analysis of non-scheduled traffic in automotive scheduled TSN networks. In Proceedings of the Design Automation & Test in Europe Conference & Exhibition (DATE) 1643\u20131646. 10.23919\/DATE.2017.7927256","DOI":"10.23919\/DATE.2017.7927256"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.5555\/2971808.2971850"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/VNC.2015.7385584"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCS55155.2022.9846742"},{"key":"e_1_3_1_34_2","unstructured":"Luxi Zhao Paul Pop Zhong Zheng Hugo Daigmorte and Marc Boyer. 2018. Improving worst-case end-to-end delay analysis of multiple classes of AVB traffic in TSN networks using network calculus. https:\/\/api.semanticscholar.org\/CorpusID:199421728"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2020.3021638"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/RTAS.2018.00009"}],"container-title":["ACM Transactions on Design Automation of Electronic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3637878","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3637878","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:49:18Z","timestamp":1750286958000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3637878"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,15]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,3,31]]}},"alternative-id":["10.1145\/3637878"],"URL":"https:\/\/doi.org\/10.1145\/3637878","relation":{},"ISSN":["1084-4309","1557-7309"],"issn-type":[{"type":"print","value":"1084-4309"},{"type":"electronic","value":"1557-7309"}],"subject":[],"published":{"date-parts":[[2024,2,15]]},"assertion":[{"value":"2023-06-20","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-12-11","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-02-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}