An Enhanced Routing and Scheduling Mechanism for Time-Triggered Traffic with Large Period Differences in Time-Sensitive Networking

In the field of the automotive area as well as industrial control, real-time communication requires deterministic delivery with low delay and bounded jitter. Real-time communication in these networks requires transmission schedule and routing, which is an NP-hard problem. In this paper, we present a...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Applied sciences Jg. 12; H. 9; S. 4448
Hauptverfasser:	Nie, Hongrui, Li, Shaosheng, Liu, Yong
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Basel MDPI AG 01.05.2022
Schlagworte:	Communication Ethernet flow classification Genetic algorithms Heuristic integer linear programming (ILP) Linear programming Mathematical programming routing and scheduling algorithm Schedules Scheduling Success time-sensitive network (TSN)
ISSN:	2076-3417, 2076-3417
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Abstract	In the field of the automotive area as well as industrial control, real-time communication requires deterministic delivery with low delay and bounded jitter. Real-time communication in these networks requires transmission schedule and routing, which is an NP-hard problem. In this paper, we present an offline routing and scheduling method based on integer linear programming (ILP), with a flow preprocessing step to explore the period correlation of time-triggered (TT) traffic in time-sensitive networking (TSN). First, a multiperiod flow routing and scheduling algorithm based on flow classification is proposed to improve the scheduling success rate and reduce execution time. The flow classification technique obtained a more fine-grained TT traffic classification, which can be superimposed on any routing and scheduling algorithms. Second, an adaptive period compensation scheduling algorithm based on flow classification is proposed in simple network architecture conditions. The evaluations demonstrate that the proposed algorithms improve scheduling success rate and reduce execution time compared with baseline methods in all test cases. In addition, we can adapt our different proposed algorithms in different network architecture conditions to schedule various flows with different periods and sizes.
AbstractList	In the field of the automotive area as well as industrial control, real-time communication requires deterministic delivery with low delay and bounded jitter. Real-time communication in these networks requires transmission schedule and routing, which is an NP-hard problem. In this paper, we present an offline routing and scheduling method based on integer linear programming (ILP), with a flow preprocessing step to explore the period correlation of time-triggered (TT) traffic in time-sensitive networking (TSN). First, a multiperiod flow routing and scheduling algorithm based on flow classification is proposed to improve the scheduling success rate and reduce execution time. The flow classification technique obtained a more fine-grained TT traffic classification, which can be superimposed on any routing and scheduling algorithms. Second, an adaptive period compensation scheduling algorithm based on flow classification is proposed in simple network architecture conditions. The evaluations demonstrate that the proposed algorithms improve scheduling success rate and reduce execution time compared with baseline methods in all test cases. In addition, we can adapt our different proposed algorithms in different network architecture conditions to schedule various flows with different periods and sizes.
Author	Li, Shaosheng Liu, Yong Nie, Hongrui
Author_xml	– sequence: 1 givenname: Hongrui orcidid: 0000-0002-3833-4490 surname: Nie fullname: Nie, Hongrui – sequence: 2 givenname: Shaosheng surname: Li fullname: Li, Shaosheng – sequence: 3 givenname: Yong surname: Liu fullname: Liu, Yong
BookMark	eNptkUtvGyEURlGUSk3TrPoHkLKMpgUGmGEZ5dVI7kONu0YYLmMcG1zAibrtLy-pqyiqyoaHzncucN-gw5giIPSOkvd9r8gHs91SRhTnfDxAR4wMsus5HQ5frF-jk1JWpA1F-5GSI_TrPOKruDTRgsPf0q6GOGETHb6zS3C79dP2E9gGhLLBPmU8Dxvo5jlME-SWmWfjfbD4MdQlnpk8Af4KOSSHL4P3DWnmgkPc5-4gllDDA-DPUB9Tvm_-t-iVN-sCJ3_nY_T9-mp-8bGbfbm5vTifdbaXvHbK-oHbhbdegufUMWOpEs4LxRemPYZ5Sw2h3okFEOWk44OQZnBcgZRejv0xut17XTIrvc1hY_JPnUzQfw5SnrTJNdg1aCdGECMjgknLKRtU-2AnRwmGsIWQtLlO965tTj92UKpepV2O7fqaSckUk5yIRp3tKZtTKRn8c1VK9FPP9IueNZr-Q9tQTQ0p1mzC-r-Z3y2InBE
CitedBy_id	crossref_primary_10_1109_JIOT_2023_3315286 crossref_primary_10_1016_j_comnet_2024_110492 crossref_primary_10_1109_ACCESS_2023_3286370 crossref_primary_10_3390_biomimetics10050333 crossref_primary_10_3390_electronics14010203 crossref_primary_10_3390_app13031278 crossref_primary_10_3390_math12213382 crossref_primary_10_1088_1742_6596_3073_1_012010 crossref_primary_10_1016_j_comnet_2025_111719 crossref_primary_10_3390_electronics13132644 crossref_primary_10_3390_network3040026 crossref_primary_10_1016_j_comnet_2025_111080
Cites_doi	10.1145/3314206.3314208 10.1109/MCOMSTD.2018.1700076 10.1109/ICCWorkshops50388.2021.9473540 10.1016/j.sysarc.2013.07.003 10.1109/INFOCOMMST.2016.7905383 10.1109/ACCESS.2020.2974580 10.1109/ICPS48405.2020.9274702 10.1145/3267419.3267421 10.3390/electronics9122131 10.1109/TII.2019.2950887 10.1109/RTSS.2010.25 10.1109/VNC51378.2020.9318350 10.1109/JPROC.2019.2905334 10.1109/TII.2017.2782235 10.1109/TII.2014.2350832 10.1109/ETFA.2018.8502515 10.1109/RTAS.2018.00008 10.3390/app11093896 10.1109/CISCE52179.2021.9446030 10.1109/WFCS.2018.8402374 10.1145/3015037.3015044 10.1007/978-3-030-43024-5_7 10.1145/2997465.2997470 10.3390/electronics11060926 10.1109/JAS.2021.1003844 10.1145/3139258.3139289 10.1109/MCOMSTD.2018.1700047 10.1016/0305-0483(83)90088-9 10.1145/2997465.2997494 10.1145/3378408.3378411 10.1109/TII.2010.2052819 10.1109/SIES.2016.7509415 10.1049/iet-cps.2016.0021 10.1007/s11241-015-9244-x 10.1109/MCOMSTD.2018.8412457 10.1016/S0920-5489(98)00028-2 10.1109/ACCESS.2018.2883644
ContentType	Journal Article
Copyright	2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml	– notice: 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID	AAYXX CITATION ABUWG AFKRA AZQEC BENPR CCPQU DWQXO PHGZM PHGZT PIMPY PKEHL PQEST PQQKQ PQUKI PRINS DOA
DOI	10.3390/app12094448
DatabaseName	CrossRef ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest Central Essentials ProQuest Central ProQuest One ProQuest Central Korea ProQuest Central Premium ProQuest One Academic (New) ProQuest Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China DOAJ Directory of Open Access Journals
DatabaseTitle	CrossRef Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest Central Essentials ProQuest One Academic Eastern Edition ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest Central China ProQuest Central ProQuest One Academic UKI Edition ProQuest Central Korea ProQuest Central (New) ProQuest One Academic ProQuest One Academic (New)
DatabaseTitleList	CrossRef Publicly Available Content Database
Database_xml	– sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: PIMPY name: Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Sciences (General)
EISSN	2076-3417
ExternalDocumentID	oai_doaj_org_article_d58e5820526c41279339d686ea02b561 10_3390_app12094448
GroupedDBID	.4S 2XV 5VS 7XC 8CJ 8FE 8FG 8FH AADQD AAFWJ AAYXX ADBBV ADMLS AFFHD AFKRA AFPKN AFZYC ALMA_UNASSIGNED_HOLDINGS APEBS ARCSS BCNDV BENPR CCPQU CITATION CZ9 D1I D1J D1K GROUPED_DOAJ IAO IGS ITC K6- K6V KC. KQ8 L6V LK5 LK8 M7R MODMG M~E OK1 P62 PHGZM PHGZT PIMPY PROAC TUS ABUWG AZQEC DWQXO PKEHL PQEST PQQKQ PQUKI PRINS
ID	FETCH-LOGICAL-c364t-9cf74cbfcf6ef41d2ac195df594ba3812fc1a01fd5be09d6d4756a7d49e66f683
IEDL.DBID	DOA
ISICitedReferencesCount	14
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000794768400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	2076-3417
IngestDate	Fri Oct 03 12:45:51 EDT 2025 Mon Jun 30 11:17:11 EDT 2025 Sat Nov 29 07:17:17 EST 2025 Tue Nov 18 22:35:20 EST 2025
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	9
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c364t-9cf74cbfcf6ef41d2ac195df594ba3812fc1a01fd5be09d6d4756a7d49e66f683
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0002-3833-4490
OpenAccessLink	https://doaj.org/article/d58e5820526c41279339d686ea02b561
PQID	2662926405
PQPubID	2032433
ParticipantIDs	doaj_primary_oai_doaj_org_article_d58e5820526c41279339d686ea02b561 proquest_journals_2662926405 crossref_primary_10_3390_app12094448 crossref_citationtrail_10_3390_app12094448
PublicationCentury	2000
PublicationDate	2022-05-01
PublicationDateYYYYMMDD	2022-05-01
PublicationDate_xml	– month: 05 year: 2022 text: 2022-05-01 day: 01
PublicationDecade	2020
PublicationPlace	Basel
PublicationPlace_xml	– name: Basel
PublicationTitle	Applied sciences
PublicationYear	2022
Publisher	MDPI AG
Publisher_xml	– name: MDPI AG
References	ref_14 ref_13 Messenger (ref_6) 2018; 2 ref_12 ref_34 ref_11 ref_33 Nayak (ref_27) 2018; 14 ref_31 Steiner (ref_7) 2019; 107 Patzke (ref_1) 1998; 19 Pahlevan (ref_9) 2019; 16 ref_19 Nawaz (ref_10) 1983; 11 ref_18 ref_39 Finn (ref_4) 2018; 2 ref_16 ref_38 Jin (ref_35) 2021; 8 ref_37 Hanzalek (ref_32) 2010; 6 Pop (ref_23) 2016; 1 Laursen (ref_28) 2016; 13 Atallah (ref_36) 2020; 16 ref_25 Nayak (ref_15) 2018; 15 ref_22 ref_21 ref_20 Bello (ref_2) 2015; 11 Yu (ref_17) 2020; 8 Gavrilut (ref_30) 2018; 6 ref_29 Ojewale (ref_40) 2019; 16 Elshuber (ref_3) 2013; 59 Farkas (ref_5) 2018; 2 ref_26 ref_8 Craciunas (ref_24) 2016; 52
References_xml	– volume: 16 start-page: 15 year: 2019 ident: ref_9 article-title: Heuristic list scheduler for time triggered traffic in time sensitive networks publication-title: ACM SIGBED Rev. doi: 10.1145/3314206.3314208 – volume: 2 start-page: 22 year: 2018 ident: ref_4 article-title: Introduction to Time-Sensitive Networking publication-title: IEEE Commun. Stand. Mag. doi: 10.1109/MCOMSTD.2018.1700076 – ident: ref_18 doi: 10.1109/ICCWorkshops50388.2021.9473540 – volume: 59 start-page: 679 year: 2013 ident: ref_3 article-title: Dependable and predictable time-triggered Ethernet networks with COTS components publication-title: J. Syst. Archit. doi: 10.1016/j.sysarc.2013.07.003 – ident: ref_39 doi: 10.1109/INFOCOMMST.2016.7905383 – volume: 8 start-page: 37855 year: 2020 ident: ref_17 article-title: Adaptive Group Routing an Scheduling in Multicast Time-Sensitive Networks publication-title: IEEE Access doi: 10.1109/ACCESS.2020.2974580 – ident: ref_37 doi: 10.1109/ICPS48405.2020.9274702 – volume: 15 start-page: 13 year: 2018 ident: ref_15 article-title: Routing algorithms for IEEE802.1Qbv networks publication-title: SIGBED Rev. doi: 10.1145/3267419.3267421 – ident: ref_14 doi: 10.3390/electronics9122131 – volume: 16 start-page: 4525 year: 2020 ident: ref_36 article-title: Routing and Scheduling of Time-Triggered Traffic in Time-Sensitive Networks publication-title: IEEE Trans. Ind. Inform. doi: 10.1109/TII.2019.2950887 – ident: ref_31 doi: 10.1109/RTSS.2010.25 – ident: ref_16 doi: 10.1109/VNC51378.2020.9318350 – volume: 107 start-page: 1094 year: 2019 ident: ref_7 article-title: A Perspective on IEEE Time-Sensitive Networking for Industrial Communication and Automation Systems publication-title: Proc. IEEE doi: 10.1109/JPROC.2019.2905334 – ident: ref_21 – volume: 14 start-page: 2066 year: 2018 ident: ref_27 article-title: Incremental flow scheduling and routing in time-sensitive software-defined networks publication-title: IEEE Trans. Ind. Inform. doi: 10.1109/TII.2017.2782235 – volume: 11 start-page: 741 year: 2015 ident: ref_2 article-title: Priority-Driven Swapping-Based Scheduling of Aperiodic Real-Time Messages over EtherCAT Networks publication-title: IEEE Trans. Ind. Inform. doi: 10.1109/TII.2014.2350832 – ident: ref_8 doi: 10.1109/ETFA.2018.8502515 – ident: ref_25 doi: 10.1109/RTAS.2018.00008 – ident: ref_26 doi: 10.3390/app11093896 – ident: ref_34 doi: 10.1109/CISCE52179.2021.9446030 – ident: ref_22 doi: 10.1109/WFCS.2018.8402374 – volume: 13 start-page: 43 year: 2016 ident: ref_28 article-title: Routing optimization of AVB streams in TSN networks publication-title: SIGBED Rev. doi: 10.1145/3015037.3015044 – ident: ref_11 doi: 10.1007/978-3-030-43024-5_7 – ident: ref_12 doi: 10.1145/2997465.2997470 – ident: ref_29 doi: 10.3390/electronics11060926 – volume: 8 start-page: 478 year: 2021 ident: ref_35 article-title: Joint algorithm of message fragmentation and no-wait scheduling for time-sensitive networks publication-title: IEEE/CAA J. Autom. Sin. doi: 10.1109/JAS.2021.1003844 – ident: ref_38 – ident: ref_13 doi: 10.1145/3139258.3139289 – ident: ref_19 – volume: 2 start-page: 29 year: 2018 ident: ref_6 article-title: Time-sensitive networking: An introduction publication-title: IEEE Commun. Stand. Mag. doi: 10.1109/MCOMSTD.2018.1700047 – volume: 11 start-page: 91 year: 1983 ident: ref_10 article-title: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem publication-title: Omega doi: 10.1016/0305-0483(83)90088-9 – ident: ref_20 doi: 10.1145/2997465.2997494 – volume: 16 start-page: 20 year: 2019 ident: ref_40 article-title: Routing heuristics for load-balanced transmission in TSN-based networks publication-title: SIGBED Rev. doi: 10.1145/3378408.3378411 – volume: 6 start-page: 369 year: 2010 ident: ref_32 article-title: Profinet IO IRT message scheduling with temporal constraints publication-title: IEEE Trans. Ind. Inform. doi: 10.1109/TII.2010.2052819 – ident: ref_33 doi: 10.1109/SIES.2016.7509415 – volume: 1 start-page: 86 year: 2016 ident: ref_23 article-title: Design optimisation of cyber-physical distributed systems using IEEE time-sensitive networks publication-title: IET Cyber-Phys. Syst. Theory Appl. doi: 10.1049/iet-cps.2016.0021 – volume: 52 start-page: 161 year: 2016 ident: ref_24 article-title: Combined task- and network-level scheduling for distributed time-triggered systems publication-title: Real-Time Syst. doi: 10.1007/s11241-015-9244-x – volume: 2 start-page: 20 year: 2018 ident: ref_5 article-title: Time-Sensitive Networking Standards publication-title: IEEE Commun. Stand. Mag. doi: 10.1109/MCOMSTD.2018.8412457 – volume: 19 start-page: 275 year: 1998 ident: ref_1 article-title: Fieldbus basics publication-title: Comput. Stand. Int. doi: 10.1016/S0920-5489(98)00028-2 – volume: 6 start-page: 75229 year: 2018 ident: ref_30 article-title: AVB-aware routing and scheduling of time-triggered traffic for TSN publication-title: IEEE Access doi: 10.1109/ACCESS.2018.2883644
SSID	ssj0000913810
Score	2.3091974
Snippet	In the field of the automotive area as well as industrial control, real-time communication requires deterministic delivery with low delay and bounded jitter....
SourceID	doaj proquest crossref
SourceType	Open Website Aggregation Database Enrichment Source Index Database
StartPage	4448
SubjectTerms	Communication Ethernet flow classification Genetic algorithms Heuristic integer linear programming (ILP) Linear programming Mathematical programming routing and scheduling algorithm Schedules Scheduling Success time-sensitive network (TSN)
SummonAdditionalLinks	– databaseName: ProQuest Central dbid: BENPR link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwEB6VlgM9UFpALG2RDz20SBZ52F7nVPWxVQ9ltaIF9RY5fmxXgmy7WfgB_HJmEu-yEqiX3qJkEjue8czYnvkG4KBItQo-cVygreJC6YSjl5FznJTGBC1taGssfbvqD4f69rYYxQ23JoZVLnRiq6jd1NIe-Sc0JFmB1juRx_cPnKpG0elqLKHxDDYIqQzlfON0MBx9We6yEOqlTpMuMS_H9T2dC1O6qBBU8WfFFLWI_f8o5NbKXGw9tX-v4GX0L9lJJxDbsObrHdhcQR3cge04nxt2GEGnj17D75OaDeq7Nh6AUZgQkjJTO3aNXHUUrj5mnz2lCU-aHww9XUbJI_wGezCmcp8MjR6hUTDa2GVXFF_ORtjg1LHzWIOFWpzU3XvXFDdPmpYNuzh0_P4b-HoxuDm75LE-A7e5EnNe2NAXtgo2KB9E6jJj00K6IAtRGRz2LNjUJGlwsvJJ4ZQTfalM34nCKxWUzt_Cej2t_TtgvhJeV0LTqaEwoaqEyZXHEUVvFq9kDz4uWFXaCF5ONTS-l7iIIb6WK3ztwcGS-L7D7Pg_2SnxfElCQNvtjelsXMZ5WzqpvUQvSWbKijRDbZbjn2jlTZJV6Hv2YG8hDmWc_U35VxbeP_54F15klE7RBlDuwfp89tPvw3P7az5pZh-iMP8BtRH_Aw priority: 102 providerName: ProQuest
Title	An Enhanced Routing and Scheduling Mechanism for Time-Triggered Traffic with Large Period Differences in Time-Sensitive Networking
URI	https://www.proquest.com/docview/2662926405 https://doaj.org/article/d58e5820526c41279339d686ea02b561
Volume	12
WOSCitedRecordID	wos000794768400001&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: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 2076-3417 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913810 issn: 2076-3417 databaseCode: DOA dateStart: 20110101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2076-3417 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913810 issn: 2076-3417 databaseCode: M~E dateStart: 20110101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 2076-3417 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913810 issn: 2076-3417 databaseCode: BENPR dateStart: 20110101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Publicly Available Content Database customDbUrl: eissn: 2076-3417 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913810 issn: 2076-3417 databaseCode: PIMPY dateStart: 20110101 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LT9wwEB4h4FAOCGgRWxbkA4cWKWoetmMfF1jUSrCKClT0FDl-LCvRgNiFH8AvZyYJKFIrcekticZxNDP2zMQz3wAc6ETJ4GMXcbRVEZcqjtDLyCJclMYEJWxoeiz9OssnE3V9rYteqy_KCWvhgVvGfXNCeYFmSqTS8iRFdcq0k0p6E6eVaAOfONe9YKrZg3VC0FVtQR6OiOk8mMpEOadOPz0T1CD1_7URN9bldAPWO7eQjdrP2YQlX2_BWg8scAs2u2U4Z186rOivH-F5VLNxfdMc4zPK7kFSZmrHLlAYjrLMp-zcU3XvbP6HoYPKqOYjusSYfEpdOhnaKgKRYPQ_lp1RWjgrcMI7x0661ik046xux11QujttkGzSpo_j-z_B1en48vh71LVViGwm-SLSNuTcVsEG6QNPXGpsooULQvPKINfSYBMTJ8GJysfIa8dzIU3uuPZSBqmybViu72q_A8xX3KuKKzrs4yZUFTeZ9DLV6ITilRjA4SunS9thjlPri9sSYw8SS9kTywAO3ojvW6iNf5MdkcjeSAgfu3mAWlN2WlO-pzUDGL4KvOwW7bxEXyXV6CDG4vP_mGMXPqRUK9FkRw5hefHw6Pdg1T4tZvOHfVg5Gk-Kn_uN3uJd8eO8-P0CBU_xNg
linkProvider	Directory of Open Access Journals
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9NAEB6VFAk4AC2gBgrsoUiAZOHH7mZ9QKjQVo2aRJEaUDmZ9T7SSOCUOIC48oP4jcz4ESKBuPXAzbLXtnb9eb7Z3Zn5APbSSEnvQhtw5KqASxUG6GUkAf6UWnsljK80lt4NeqOROjtLxxvws82FobDK1iZWhtrODa2Rv0AiiVNk71C8uvgckGoU7a62Eho1LE7c9284ZStf9g_w-z6J46PDyZvjoFEVCEwi-TJIje9xk3vjpfM8srE2USqsFynPNfJX7E2kw8hbkbswtdLynpC6Z3nqpPRSJfjcK7DJCewd2Bz3h-P3q1UdqrKporBOBEySNKR9aEpP5ZwUhtaor1II-IMAKlY7uvW_jcdtuNn4z2y_BvwWbLhiG26sVVXchq3GXpXsaVNU-9kd-LFfsMPivIp3YBQGhU2ZLiw7RdRaCsefsqGjNOhZ-YmhJ88oOSaYYI-nJGfKkNSp2gajhWs2oPh5NsYXzi07aDRm6I2zor7vlPICiEnYqI6zx-ffhbeXMjL3oFPMC7cDzOXcqZwr2hXl2uc514l0-AXRW8cj0YXnLTQy0xRnJ42QjxlO0ghH2RqOurC3anxR1yT5e7PXhLFVEyokXp2YL6ZZY5cyK5QT6AWKWBoexWitE-yJkk6HcY6-dRd2W_hljXUrs9_Yu__vy4_h2vFkOMgG_dHJA7geU-pIFSy6C53l4ot7CFfN1-WsXDxqfiQGHy4bq78AqOte8w
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Nb9NAEB2VFCE4AC2gBgrsoUiAZNUf6836gFAhjYiaRpFaUDmZ9X6ESMUpcQBx5Wfx65ix1yESiFsP3Cx7vSvbb-eNd2fmAexlkRTOhibgyFUBFzIM0MtIApyUSjmZaldrLL0b9cZjeXaWTTbgZ5sLQ2GVrU2sDbWZa1oj30ciiTNk7zDddz4sYtIfvLz4HJCCFO20tnIaDUSO7Pdv-PtWvRj28Vs_iePB4enrN4FXGAh0IvgyyLTrcV047YR1PDKx0lGWGpdmvFDIZbHTkQojZ9LChpkRhvdSoXqGZ1YIJ2SC_V6BTXTJedyBzcnwePJ-tcJDFTdlFDZJgUmShbQnTamqnJPa0BoN1moBf5BBzXCDW__zu7kNN71fzQ6aibAFG7bchhtr1Ra3YcvbsYo99cW2n92BHwclOyw_1nEQjMKjsClTpWEniGZDYfpTdmwpPXpWfWLo4TNKmglO8YmnJHPKkOypCgejBW02orh6NsEB54b1vfYMjTgrm_tOKF-AGIaNm_h77P8uvL2UN3MPOuW8tDvAbMGtLLik3VKuXFFwlQiLXxO9eDxKu_C8hUmufdF20g45z_HnjTCVr2GqC3urxhdNrZK_N3tFeFs1oQLj9Yn5Ypp7e5WbVNoUvcM0FppHMVrxBJ9ECqvCuECfuwu7LRRzb_Wq_DcO7__78mO4hgDNR8Px0QO4HlNGSR1Dugud5eKLfQhX9dflrFo88nOKwYfLhuovm-dnsw
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=An+Enhanced+Routing+and+Scheduling+Mechanism+for+Time-Triggered+Traffic+with+Large+Period+Differences+in+Time-Sensitive+Networking&rft.jtitle=Applied+sciences&rft.au=Nie%2C+Hongrui&rft.au=Li%2C+Shaosheng&rft.au=Liu%2C+Yong&rft.date=2022-05-01&rft.issn=2076-3417&rft.eissn=2076-3417&rft.volume=12&rft.issue=9&rft.spage=4448&rft_id=info:doi/10.3390%2Fapp12094448&rft.externalDBID=n%2Fa&rft.externalDocID=10_3390_app12094448
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2076-3417&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2076-3417&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2076-3417&client=summon