Burst-Aware Time-Triggered Flow Scheduling With Enhanced Multi-CQF in Time-Sensitive Networks

Deterministic transmission guarantee in time-sensitive networks (TSN) relies on queue models (such as CQF, TAS, ATS) and resource scheduling algorithms. Thanks to its ease of use, the CQF queue model has been widely adopted. However, the existing resource scheduling algorithms of CQF model only focu...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE/ACM transactions on networking Ročník 31; číslo 6; s. 1 - 16
Hlavní autori:	Yang, Dong, Cheng, Zongrong, Zhang, Weiting, Zhang, Hongke, Shen, Xuemin
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.12.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Algorithms Bursting Computational modeling deep reinforcement learning Delays enhanced Multi-CQF Heuristic algorithms Jitter Job shop scheduling Load modeling Network latency Queues Resource allocation Resource scheduling Run time (computers) Scheduling Scheduling algorithms Time-sensitive networks
ISSN:	1063-6692, 1558-2566
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Abstract	Deterministic transmission guarantee in time-sensitive networks (TSN) relies on queue models (such as CQF, TAS, ATS) and resource scheduling algorithms. Thanks to its ease of use, the CQF queue model has been widely adopted. However, the existing resource scheduling algorithms of CQF model only focus on periodic time-triggered (TT) flows without consideration of bursting flows. Considering that the bursting flows often carry high-priority data in real systems, in this paper we investigate the mixed-flow (i.e., TT and bursting flows) scheduling problem in CQF-based TSN aiming to maximize the number of schedulable flows and system load balance while satisfying the deterministic demands of delay, jitter, and reliability for both TT and bursting flows. Unfortunately, it is challenging to schedule the mixed flows with the original CQF model because of the huge difference between TT and bursting flows. To resolve this problem, we firstly design an enhanced Multi-CQF model to satisfy the basic demands of bursting flows sent at any time without affecting the deterministic transmission of TT flows. Given the complexity of mixed-flow scheduling and the proposed queue model, it is difficult for traditional algorithms to fully utilize network resources. Thus, we further propose a time-correlated DRL resource scheduling (TimeDRS) algorithm to optimize the resource allocation. TimeDRS can be extended to other time-related resource scheduling scenarios, such as TDMA-based scheduling. Experimental results demonstrate that our proposed approaches can greatly reduce frame loss and end-to-end latency for bursting flows, and well balance runtime and schedulability compared with state-of-the-art benchmarks.
AbstractList	Deterministic transmission guarantee in time-sensitive networks (TSN) relies on queue models (such as CQF, TAS, ATS) and resource scheduling algorithms. Thanks to its ease of use, the CQF queue model has been widely adopted. However, the existing resource scheduling algorithms of CQF model only focus on periodic time-triggered (TT) flows without consideration of bursting flows. Considering that the bursting flows often carry high-priority data in real systems, in this paper we investigate the mixed-flow (i.e., TT and bursting flows) scheduling problem in CQF-based TSN aiming to maximize the number of schedulable flows and system load balance while satisfying the deterministic demands of delay, jitter, and reliability for both TT and bursting flows. Unfortunately, it is challenging to schedule the mixed flows with the original CQF model because of the huge difference between TT and bursting flows. To resolve this problem, we firstly design an enhanced Multi-CQF model to satisfy the basic demands of bursting flows sent at any time without affecting the deterministic transmission of TT flows. Given the complexity of mixed-flow scheduling and the proposed queue model, it is difficult for traditional algorithms to fully utilize network resources. Thus, we further propose a time-correlated DRL resource scheduling (TimeDRS) algorithm to optimize the resource allocation. TimeDRS can be extended to other time-related resource scheduling scenarios, such as TDMA-based scheduling. Experimental results demonstrate that our proposed approaches can greatly reduce frame loss and end-to-end latency for bursting flows, and well balance runtime and schedulability compared with state-of-the-art benchmarks. Deterministic transmission guarantee in time-sensitive networks (TSN) relies on queue models (such as CQF, TAS, ATS) and resource scheduling algorithms. Thanks to its ease of use, the CQF queue model has been widely adopted. However, the existing resource scheduling algorithms of CQF model only focus on periodic time-triggered (TT) flows without consideration of bursting flows. Considering that the bursting flows often carry high-priority data in real systems, in this paper we investigate the mixed-flow (i.e., TT and bursting flows) scheduling problem in CQF-based TSN aiming to maximize the number of schedulable flows and system load balance while satisfying the deterministic demands of delay, jitter, and reliability for both TT and bursting flows. Unfortunately, it is challenging to schedule the mixed flows with the original CQF model because of the huge difference between TT and bursting flows. To resolve this problem, we firstly design an enhanced Multi-CQF model to satisfy the basic demands of bursting flows sent at any time without affecting the deterministic transmission of TT flows. Given the complexity of mixed-flow scheduling and the proposed queue model, it is difficult for traditional algorithms to fully utilize network resources. Thus, we further propose a uline time-correlated uline DRL uline resource uline scheduling (TimeDRS) algorithm to optimize the resource allocation. TimeDRS can be extended to other time-related resource scheduling scenarios, such as TDMA-based scheduling. Experimental results demonstrate that our proposed approaches can greatly reduce frame loss and end-to-end latency for bursting flows, and well balance runtime and schedulability compared with state-of-the-art benchmarks.
Author	Zhang, Hongke Cheng, Zongrong Yang, Dong Zhang, Weiting Shen, Xuemin
Author_xml	– sequence: 1 givenname: Dong orcidid: 0000-0003-3402-3668 surname: Yang fullname: Yang, Dong organization: School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing, China – sequence: 2 givenname: Zongrong orcidid: 0000-0001-9032-9237 surname: Cheng fullname: Cheng, Zongrong organization: School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing, China – sequence: 3 givenname: Weiting orcidid: 0000-0003-2626-4883 surname: Zhang fullname: Zhang, Weiting organization: School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing, China – sequence: 4 givenname: Hongke orcidid: 0000-0001-8906-813X surname: Zhang fullname: Zhang, Hongke organization: School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing, China – sequence: 5 givenname: Xuemin orcidid: 0000-0002-4140-287X surname: Shen fullname: Shen, Xuemin organization: Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, Canada
BookMark	eNp9kE9Lw0AQxRepYK1-AMFDwHPq_kk2ybGWVoVakUY8SdhsJu3WdFN3Nxa_vVvag3iQOczAvN8M752jnm41IHRF8JAQnN3m80k-pJiyIaM8ilN2gvokjtOQxpz3_Iw5CznP6Bk6t3aNMWGY8j56v-uMdeFoJwwEudpAmBu1XIKBKpg27S5YyBVUXaP0MnhTbhVM9Epo6bdPXeNUOH6ZBkofyAVoq5z6gmAObteaD3uBTmvRWLg89gF6nU7y8UM4e75_HI9moaRZ5MI6jWlV04pRJrwHzjJaJbxMaoIxyEiWNCMpZyIp45IRXmdQJZKzkpW4qhNJ2QDdHO5uTfvZgXXFuu2M9i8LmuEoIjGJUq8iB5U0rbUG6mJr1EaY74LgYp9isU-x2KdYHFP0TPKHkcoJp1rtjFDNv-T1gVQA8OuTr9Qb_QEpdYD0
CODEN	IEANEP
CitedBy_id	crossref_primary_10_1007_s12239_025_00313_w crossref_primary_10_1109_JIOT_2025_3557062 crossref_primary_10_1109_TON_2025_3546678 crossref_primary_10_1109_TII_2024_3393006 crossref_primary_10_1109_TSC_2024_3376199 crossref_primary_10_3390_electronics12214496 crossref_primary_10_1109_TNSE_2023_3313119 crossref_primary_10_1109_TMC_2025_3526971 crossref_primary_10_1109_TNSE_2025_3538792 crossref_primary_10_1109_TNSE_2025_3550174 crossref_primary_10_32604_cmc_2024_055802 crossref_primary_10_1109_TII_2025_3554251 crossref_primary_10_1109_TII_2024_3388669 crossref_primary_10_1109_TIV_2024_3397645 crossref_primary_10_1109_TII_2025_3552701 crossref_primary_10_1016_j_comnet_2024_110881 crossref_primary_10_1109_JIOT_2024_3366766 crossref_primary_10_1109_JSAC_2025_3574589 crossref_primary_10_1109_TMC_2024_3363662 crossref_primary_10_1109_JIOT_2024_3521088 crossref_primary_10_1109_TCCN_2024_3362469 crossref_primary_10_1109_TII_2025_3538118 crossref_primary_10_1007_s12239_025_00304_x crossref_primary_10_1007_s11390_025_4632_8 crossref_primary_10_1109_TCCN_2024_3502493 crossref_primary_10_1109_JSEN_2025_3559073 crossref_primary_10_1109_TSC_2024_3442471 crossref_primary_10_1016_j_sysarc_2023_102959 crossref_primary_10_1109_TITS_2024_3465014 crossref_primary_10_1002_rnc_70050 crossref_primary_10_1109_JPROC_2024_3404491 crossref_primary_10_23919_cje_2023_00_305 crossref_primary_10_1109_JIOT_2025_3576273 crossref_primary_10_1109_TII_2024_3353854 crossref_primary_10_1109_TMC_2024_3481276 crossref_primary_10_1109_TVT_2024_3414666 crossref_primary_10_1109_TNSM_2025_3547896 crossref_primary_10_1016_j_comcom_2025_108313 crossref_primary_10_1109_TMC_2024_3349849 crossref_primary_10_1109_TNSM_2025_3570284 crossref_primary_10_1109_TNSE_2025_3569897 crossref_primary_10_1109_TMC_2025_3530486 crossref_primary_10_1109_TNET_2024_3433599 crossref_primary_10_1109_TII_2024_3452201 crossref_primary_10_1109_TMC_2024_3382776 crossref_primary_10_1109_TCOMM_2024_3450603 crossref_primary_10_1109_TNSE_2023_3301879
Cites_doi	10.1109/ICC40277.2020.9149092 10.1109/JSAC.2021.3118352 10.1109/INFOCOM41043.2020.9155434 10.1109/ICPS48405.2020.9274702 10.1016/j.comcom.2020.10.016 10.1109/TII.2022.3150044 10.1109/TVT.2019.2954538 10.1109/MIE.2020.3048925 10.1109/MNET.007.2100444 10.1109/TVT.2021.3068255 10.1109/ieeestd.2006.6044678 10.1109/MCOMSTD.2018.1700055 10.1109/ieeestd.2020.9121845 10.1109/MVT.2019.2903655 10.1145/3487330 10.1109/TII.2022.3151810 10.1109/ICC45855.2022.9882280 10.1057/978-1-349-95943-3_468 10.1109/TII.2022.3151786 10.1109/MVT.2021.3053193 10.1109/ICC42927.2021.9500914 10.1109/TNET.2019.2911272 10.1109/hpcc-smartcity-dss50907.2020.00045 10.1109/COMST.2021.3135829 10.1109/ieeestd.2020.9253013 10.1109/JIOT.2021.3124508 10.1109/JIOT.2022.3166110 10.1109/ieeestd.2017.7961303 10.1145/3472735.3473385 10.1109/JIOT.2022.3143829 10.1109/OJVT.2020.2965100
ContentType	Journal Article
Copyright	Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023
Copyright_xml	– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023
DBID	97E RIA RIE AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D
DOI	10.1109/TNET.2023.3264583
DatabaseName	IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional
DatabaseTitle	CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional
DatabaseTitleList	Technology Research Database
Database_xml	– sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering
EISSN	1558-2566
EndPage	16
ExternalDocumentID	10_1109_TNET_2023_3264583 10101832
Genre	orig-research
GrantInformation_xml	– fundername: National Natural Science Foundation of China grantid: 62201029 funderid: 10.13039/501100001809 – fundername: China Post-Doctoral Science Foundation grantid: 2022M710007; BX20220029 – fundername: National Key Research and Development Program of China grantid: 2022YFB2901302 funderid: 10.13039/501100012166
GroupedDBID	-DZ -~X .DC 0R~ 29I 4.4 5GY 5VS 6IK 85S 8US 97E AAJGR AAKMM AALFJ AARMG AASAJ AAWTH AAWTV ABAZT ABPPZ ABQJQ ABVLG ACGFS ACGOD ACIWK ACM ADBCU ADL AEBYY AEFXT AEJOY AENSD AETEA AFWIH AFWXC AGQYO AHBIQ AIKLT AKJIK AKQYR AKRVB ALMA_UNASSIGNED_HOLDINGS ATWAV BDXCO BEFXN BFFAM BGNUA BKEBE BPEOZ CCLIF CS3 D0L EBS FEDTE GUFHI HGAVV HZ~ I07 IEDLZ IES IFIPE IPLJI JAVBF LAI LHSKQ M43 O9- OCL P1C P2P PQQKQ RIA RIE RNS TN5 UPT YR2 ZCA 9M8 AAYXX AETIX AGSQL AI. AIBXA ALLEH CITATION EJD HF~ H~9 ICLAB IFJZH MVM ROL UQL VH1 XOL 7SC 7SP 8FD JQ2 L7M L~C L~D
ID	FETCH-LOGICAL-c294t-f852df2d323a2026392d76b7f100ec4cb291863a7b5b316f9ed7c63b3b0df7c23
IEDL.DBID	RIE
ISICitedReferencesCount	74
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000972313500001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1063-6692
IngestDate	Sun Nov 30 04:58:01 EST 2025 Sat Nov 29 03:05:26 EST 2025 Tue Nov 18 21:58:06 EST 2025 Wed Aug 27 02:14:02 EDT 2025
IsPeerReviewed	true
IsScholarly	true
Issue	6
Language	English
License	https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html https://doi.org/10.15223/policy-029 https://doi.org/10.15223/policy-037
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c294t-f852df2d323a2026392d76b7f100ec4cb291863a7b5b316f9ed7c63b3b0df7c23
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0002-4140-287X 0000-0001-8906-813X 0000-0003-3402-3668 0000-0001-9032-9237 0000-0003-2626-4883
PQID	2904415148
PQPubID	32020
PageCount	16
ParticipantIDs	proquest_journals_2904415148 crossref_citationtrail_10_1109_TNET_2023_3264583 crossref_primary_10_1109_TNET_2023_3264583 ieee_primary_10101832
PublicationCentury	2000
PublicationDate	2023-12-01
PublicationDateYYYYMMDD	2023-12-01
PublicationDate_xml	– month: 12 year: 2023 text: 2023-12-01 day: 01
PublicationDecade	2020
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	IEEE/ACM transactions on networking
PublicationTitleAbbrev	TNET
PublicationYear	2023
Publisher	IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml	– name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References	ref13 ref12 ref15 ref14 ref31 ref30 ref11 ref33 ref10 ref32 ref2 ref1 ref17 ref16 ref19 ref18 (ref26) 2019 ref24 ref23 ref25 ref20 ref22 ref21 (ref6) 2011 ref28 ref27 ref29 ref8 ref7 ref9 ref4 ref3 ref5
References_xml	– ident: ref33 doi: 10.1109/ICC40277.2020.9149092 – ident: ref18 doi: 10.1109/JSAC.2021.3118352 – ident: ref11 doi: 10.1109/INFOCOM41043.2020.9155434 – ident: ref9 doi: 10.1109/ICPS48405.2020.9274702 – ident: ref10 doi: 10.1016/j.comcom.2020.10.016 – ident: ref30 doi: 10.1109/TII.2022.3150044 – volume-title: Industrial Internet Consortium year: 2019 ident: ref26 – ident: ref20 doi: 10.1109/TVT.2019.2954538 – ident: ref4 doi: 10.1109/MIE.2020.3048925 – ident: ref7 doi: 10.1109/MNET.007.2100444 – ident: ref24 doi: 10.1109/TVT.2021.3068255 – ident: ref19 doi: 10.1109/ieeestd.2006.6044678 – ident: ref28 doi: 10.1109/MCOMSTD.2018.1700055 – ident: ref15 doi: 10.1109/ieeestd.2020.9121845 – ident: ref16 doi: 10.1109/MVT.2019.2903655 – volume-title: Wireless Systems for Industrial Automation: Process Control and Related Applications year: 2011 ident: ref6 – ident: ref3 doi: 10.1145/3487330 – ident: ref32 doi: 10.1109/TII.2022.3151810 – ident: ref13 doi: 10.1109/ICC45855.2022.9882280 – ident: ref27 doi: 10.1057/978-1-349-95943-3_468 – ident: ref1 doi: 10.1109/TII.2022.3151786 – ident: ref22 doi: 10.1109/MVT.2021.3053193 – ident: ref29 doi: 10.1109/ICC42927.2021.9500914 – ident: ref25 doi: 10.1109/TNET.2019.2911272 – ident: ref31 doi: 10.1109/hpcc-smartcity-dss50907.2020.00045 – ident: ref21 doi: 10.1109/COMST.2021.3135829 – ident: ref8 doi: 10.1109/ieeestd.2020.9253013 – ident: ref5 doi: 10.1109/JIOT.2021.3124508 – ident: ref23 doi: 10.1109/JIOT.2022.3166110 – ident: ref12 doi: 10.1109/ieeestd.2017.7961303 – ident: ref14 doi: 10.1145/3472735.3473385 – ident: ref2 doi: 10.1109/JIOT.2022.3143829 – ident: ref17 doi: 10.1109/OJVT.2020.2965100
SSID	ssj0013026
Score	2.6330106
Snippet	Deterministic transmission guarantee in time-sensitive networks (TSN) relies on queue models (such as CQF, TAS, ATS) and resource scheduling algorithms. Thanks...
SourceID	proquest crossref ieee
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	1
SubjectTerms	Algorithms Bursting Computational modeling deep reinforcement learning Delays enhanced Multi-CQF Heuristic algorithms Jitter Job shop scheduling Load modeling Network latency Queues Resource allocation Resource scheduling Run time (computers) Scheduling Scheduling algorithms Time-sensitive networks
Title	Burst-Aware Time-Triggered Flow Scheduling With Enhanced Multi-CQF in Time-Sensitive Networks
URI	https://ieeexplore.ieee.org/document/10101832 https://www.proquest.com/docview/2904415148
Volume	31
WOSCitedRecordID	wos000972313500001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1558-2566 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0013026 issn: 1063-6692 databaseCode: RIE dateStart: 19930101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELagYoCBZxGFgjwwIbk4dhLXY6laMVWgFtEFRfEjpVKVoj7o38fnpFCEQGLLYEfRfb7zXe7xIXStaZQFwkoSGROSMGaCSKFgEHIaOe9AZWlckE2IXq85HMqHslnd98JYa33xmW3Ao8_lm6lewq8yp-EwX4o7i7sthCiatb5SBtRzq7kQh5M4lqxMYQZU3g56nUEDeMIbzlmBROG3S8izqvwwxf5-6R7888sO0X7pSOJWgfwR2rL5MdrbGC94gl7uls63I61VOrMYej3IwMXiI2DnxN3JdIX7DjEDpegj_DxevOJO_uoLArBvyyXtxy4e58XOPhS6g2nEvaJwfF5FT93OoH1PSjoFopkMFyRrRsxkzHDGUycM55owI2IlsoBSq0OtmAyaMU-FihQP4kxaI3TMFVfUZEIzfooq-TS3ZwhLp8U0irSSYRoqK5TWTDtL0OSZpUIGNUTX8k10OWscKC8miY85qEwAkgQgSUpIaujmc8tbMWjjr8VVwGBjYSH-GqqvUUxKXZwnTFIIGl3cd_7Ltgu0C28vqlTqqLKYLe0l2tHvi_F8duWP2QdZys2w
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8QwEA6ignrwLa6umoMnIWuatM3mqLKLohbFil6kNI_qgnRlH-7fN5PWF6LgrYeElvkyk5nO40NoX9OoCISVJDImJGHMBJFCwSDkPHLegSryuCKbEEnSvr-XV3Wzuu-Fsdb64jPbgkefyzd9PYZfZU7DYb4UdxZ3JgpDFlTtWp9JA-rZ1VyQw0kcS1YnMQMqD9Okk7aAKbzl3BVIFX67hjyvyg9j7G-Y7tI_v20ZLdauJD6qsF9BU7ZcRQtfBgyuoYfjsfPuyNEkH1gM3R4kddH4I_Bz4u5zf4JvHGYGitEf8V1v9IQ75ZMvCcC-MZecXHdxr6x23kCpOxhHnFSl48N1dNvtpCenpCZUIJrJcESKdsRMwQxnPHfCcM4JMyJWoggotTrUismgHfNcqEjxIC6kNULHXHFFTSE04xtouuyXdhNh6fSYRpFWMsxDZYXSmmlnC9q8sFTIoIHou3wzXU8bB9KL58xHHVRmAEkGkGQ1JA108LHlpRq18dfidcDgy8JK_A3UfEcxq7VxmDFJIWx0kd_WL9v20NxpenmRXZwl59toHt5U1aw00fRoMLY7aFa_jnrDwa4_cm84FND3
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Burst-Aware+Time-Triggered+Flow+Scheduling+With+Enhanced+Multi-CQF+in+Time-Sensitive+Networks&rft.jtitle=IEEE%2FACM+transactions+on+networking&rft.au=Yang%2C+Dong&rft.au=Cheng%2C+Zongrong&rft.au=Zhang%2C+Weiting&rft.au=Zhang%2C+Hongke&rft.date=2023-12-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=1063-6692&rft.eissn=1558-2566&rft.volume=31&rft.issue=6&rft.spage=2809&rft_id=info:doi/10.1109%2FTNET.2023.3264583&rft.externalDBID=NO_FULL_TEXT
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1063-6692&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1063-6692&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1063-6692&client=summon