Joint Traffic Routing and Scheduling Algorithm Eliminating the Nondeterministic Interruption for TSN Networks Used in IIoT

Recently, time-sensitive networking (TSN) has been developed to incorporate real-time capabilities to the standard Ethernet for the incompatible issue in existing industrial communication solutions and is considered a promising solution to satisfy the requirements of the Industrial Internet of Thing...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE internet of things journal Jg. 9; H. 19; S. 18663 - 18680
Hauptverfasser: Li, Yuting, Jiang, Junhui, Hong, Seung Ho
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Piscataway IEEE 01.10.2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithms
Automation
Critical flow
Ethernet
Genetic algorithms
Industrial applications
Industrial Internet of Things
Industrial Internet of Things (IIoT)
Integer programming
Iterative methods
Job shop scheduling
Linear programming
Logic gates
Network topologies
Real time
Routing
Schedules
Scheduling
Switches
Time factors
time-sensitive networks
ISSN:2327-4662, 2327-4662
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract Recently, time-sensitive networking (TSN) has been developed to incorporate real-time capabilities to the standard Ethernet for the incompatible issue in existing industrial communication solutions and is considered a promising solution to satisfy the requirements of the Industrial Internet of Things (IIoT). However, the routing and scheduling methods are left out of the TSN standard. This study developed a novel joint traffic routing and scheduling algorithm to compute routes for time-critical flows and construct the schedules. The validity of the proposed algorithm was verified using a random synthetic test scenario. The simulation results demonstrated that the real-time requirements of time-critical traffic could be satisfied with the proposed algorithm. Subsequently, we evaluated the scalability of the proposed algorithm from the perspective of the number of flows that can be scheduled and the network size. The results showed that the computational times for 4000 flows in the realistic industrial network topology and random network topologies (with up to 21 switches and 105 end stations) are at the subsecond level, which indicated the perfect scalability of the proposed algorithm. In addition, compared with the well-known integer linear programming (ILP)-based approach, Degree of Conflict (DoC)-aware iterative routing and scheduling (DA/IRS) approach, and hybrid genetic algorithm (HGA)-based approach, the proposed algorithm is faster than the three approaches by at least an order of magnitude.
AbstractList Recently, time-sensitive networking (TSN) has been developed to incorporate real-time capabilities to the standard Ethernet for the incompatible issue in existing industrial communication solutions and is considered a promising solution to satisfy the requirements of the Industrial Internet of Things (IIoT). However, the routing and scheduling methods are left out of the TSN standard. This study developed a novel joint traffic routing and scheduling algorithm to compute routes for time-critical flows and construct the schedules. The validity of the proposed algorithm was verified using a random synthetic test scenario. The simulation results demonstrated that the real-time requirements of time-critical traffic could be satisfied with the proposed algorithm. Subsequently, we evaluated the scalability of the proposed algorithm from the perspective of the number of flows that can be scheduled and the network size. The results showed that the computational times for 4000 flows in the realistic industrial network topology and random network topologies (with up to 21 switches and 105 end stations) are at the subsecond level, which indicated the perfect scalability of the proposed algorithm. In addition, compared with the well-known integer linear programming (ILP)-based approach, Degree of Conflict (DoC)-aware iterative routing and scheduling (DA/IRS) approach, and hybrid genetic algorithm (HGA)-based approach, the proposed algorithm is faster than the three approaches by at least an order of magnitude.
Author Jiang, Junhui
Hong, Seung Ho
Li, Yuting
Author_xml – sequence: 1
  givenname: Yuting
  orcidid: 0000-0002-5408-9798
  surname: Li
  fullname: Li, Yuting
  email: yuting2427@gmail.com
  organization: School of Computer Science, Hubei University of Technology, Wuhan, China
– sequence: 2
  givenname: Junhui
  orcidid: 0000-0002-7667-4760
  surname: Jiang
  fullname: Jiang, Junhui
  email: 0229ender@gmail.com
  organization: Department of Electronic Engineering, Hanyang University, Ansan, South Korea
– sequence: 3
  givenname: Seung Ho
  orcidid: 0000-0001-8866-8272
  surname: Hong
  fullname: Hong, Seung Ho
  email: shhong@hanyang.ac.kr
  organization: Nestfield Company Ltd., Ansan, South Korea
BookMark eNp9kE9PAyEQxYnRRK1-AOOFxHMrsJTtHo3xzzamJnY9b9hlsOgWKrAx-ullrTHGgyd4w_vNDO8Q7VpnAaETSiaUkuJ8Xt5XE0YYm2RUZJzSHXTAMpaPuRBs99d9Hx2H8EwISdiUFuIAfcydsRFXXmptWvzg-mjsE5ZW4WW7AtV3g7zonpw3cbXGV51ZGyu_THEFeOGsggg-FU2IqUNpk_L9JhpnsXYeV8sFXkB8c_4l4McAChuLy9JVR2hPyy7A8fc5Qo_XV9Xl7fju_qa8vLgbt6zI4lg1GuhUUS65ZIKlzZspVwVwCkTxpKBpZqxoID3NtNIAUjcFo1I0LNPAshE62_bdePfaQ4j1s-u9TSNrltOcTgshRHLlW1frXQgedN2aKIdfRC9NV1NSD1nXQ9b1kHX9nXUi6R9y481a-vd_mdMtYwDgx1_knAsyyz4BzRKN2g
CODEN IITJAU
CitedBy_id crossref_primary_10_1109_ACCESS_2023_3286370
crossref_primary_10_1016_j_comnet_2025_111719
crossref_primary_10_1109_JIOT_2024_3358403
crossref_primary_10_3390_app15031122
crossref_primary_10_3390_network3040026
crossref_primary_10_1016_j_comnet_2024_110492
crossref_primary_10_1109_LWC_2025_3547810
crossref_primary_10_1109_TIV_2024_3397645
crossref_primary_10_1016_j_iot_2025_101596
crossref_primary_10_1016_j_comnet_2024_110688
crossref_primary_10_1109_JIOT_2025_3528393
crossref_primary_10_1049_cmu2_12713
crossref_primary_10_1109_MNET_2024_3465012
Cites_doi 10.1109/ACCESS.2020.2964690
10.3390/electronics9122131
10.17487/rfc8939
10.1109/IEEESTD.2012.6231597
10.1109/WFCS.2018.8402356
10.1109/ACCESS.2019.2908613
10.1002/net.21552
10.1109/IEEESTD.2020.9121845
10.1109/ETFA.2019.8869206
10.1109/RTCSA.2018.00025
10.1145/3061639.3062298
10.1145/2997465.2997494
10.1109/WFCS.2018.8402374
10.1109/TII.2017.2782235
10.1007/s11241-016-9265-0
10.1109/49.536364
10.1109/87.388131
10.1109/RTAS.2017.10
10.1109/PDP2018.2018.00048
10.1145/3139258.3139289
10.1109/IEEESTD.2008.4602826
10.1109/JPROC.2019.2905334
10.1007/s11241-014-9214-8
10.1109/RTAS.2018.00009
10.1287/mnsc.17.11.712
10.1109/JIOT.2021.3124508
10.1109/IEEESTD.2018.8467507
10.1109/MCOMSTD.2018.1700079
10.1109/FWC.2017.8368523
10.1109/TII.2020.2998224
10.1109/JPROC.2018.2888703
10.1109/WFCS47810.2020.9114414
10.1109/TII.2019.2950887
10.1109/ICMA.2018.8484302
10.1109/RTAS.2018.00008
10.1186/1471-2105-9-82
10.1109/JAS.2021.1003844
10.1201/9781315217512
10.1109/ACCESS.2018.2858767
10.1109/NTMS.2016.7792488
10.1109/MIE.2011.942175
10.1109/ACCESS.2020.3035548
10.1109/JIOT.2020.3031932
10.1016/j.aej.2020.06.013
10.1007/978-3-030-43024-5_7
10.1145/2997465.2997470
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2022
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2022
DBID 97E
RIA
RIE
AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1109/JIOT.2022.3163411
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005-present
IEEE All-Society Periodicals Package (ASPP) 1998-Present
IEEE Electronic Library (IEL)
CrossRef
Computer and Information Systems 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
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Computer and Information Systems Abstracts
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 2327-4662
EndPage 18680
ExternalDocumentID 10_1109_JIOT_2022_3163411
9744608
Genre orig-research
GroupedDBID 0R~
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABJNI
ABQJQ
ABVLG
AGQYO
AHBIQ
AKJIK
AKQYR
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
EBS
IFIPE
IPLJI
JAVBF
M43
OCL
PQQKQ
RIA
RIE
AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c293t-dbfe15d14a4a262110b54d9e41e0d410bebb829be2118fdfeeafb921a6b23fe23
IEDL.DBID RIE
ISICitedReferencesCount 22
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000857705300041&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2327-4662
IngestDate Tue Sep 23 17:40:50 EDT 2025
Sat Nov 29 06:17:06 EST 2025
Tue Nov 18 20:19:54 EST 2025
Wed Aug 27 02:18:46 EDT 2025
IsPeerReviewed false
IsScholarly true
Issue 19
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-c293t-dbfe15d14a4a262110b54d9e41e0d410bebb829be2118fdfeeafb921a6b23fe23
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-5408-9798
0000-0002-7667-4760
0000-0001-8866-8272
PQID 2717159666
PQPubID 2040421
PageCount 18
ParticipantIDs crossref_citationtrail_10_1109_JIOT_2022_3163411
ieee_primary_9744608
crossref_primary_10_1109_JIOT_2022_3163411
proquest_journals_2717159666
PublicationCentury 2000
PublicationDate 2022-10-01
PublicationDateYYYYMMDD 2022-10-01
PublicationDate_xml – month: 10
  year: 2022
  text: 2022-10-01
  day: 01
PublicationDecade 2020
PublicationPlace Piscataway
PublicationPlace_xml – name: Piscataway
PublicationTitle IEEE internet of things journal
PublicationTitleAbbrev JIoT
PublicationYear 2022
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
ref52
ref11
ref10
ref54
(ref56) 2020
ref17
ref16
ref19
ref18
Ditzel (ref55)
ref51
ref50
(ref57) 2020
(ref36) 2018
ref47
ref42
ref44
ref43
ref49
ref8
(ref45) 2020
ref7
ref9
ref4
ref3
ref6
ref5
Zoobi (ref41)
(ref53) 2020
ref35
ref34
(ref58) 2020
ref31
ref30
ref33
ref32
Kurz (ref40); 64
ref2
ref1
ref39
ref38
Cormen (ref37) 2009
Krummacker (ref46) 2021
ref24
ref23
ref26
Kurose (ref48) 2013
ref25
ref20
ref22
ref21
ref28
ref27
ref29
References_xml – ident: ref26
  doi: 10.1109/ACCESS.2020.2964690
– ident: ref22
  doi: 10.3390/electronics9122131
– ident: ref43
  doi: 10.17487/rfc8939
– ident: ref7
  doi: 10.1109/IEEESTD.2012.6231597
– start-page: 1
  volume-title: Proc. 18th Int. Symp. Exp. Algorithms (SEA)
  ident: ref41
  article-title: Space and time trade-off for the k shortest simple paths problem
– ident: ref2
  doi: 10.1109/WFCS.2018.8402356
– ident: ref15
  doi: 10.1109/ACCESS.2019.2908613
– ident: ref39
  doi: 10.1002/net.21552
– ident: ref4
  doi: 10.1109/IEEESTD.2020.9121845
– ident: ref19
  doi: 10.1109/ETFA.2019.8869206
– ident: ref33
  doi: 10.1109/RTCSA.2018.00025
– ident: ref32
  doi: 10.1145/3061639.3062298
– volume-title: Introduction to Algorithms
  year: 2009
  ident: ref37
– ident: ref23
  doi: 10.1145/2997465.2997494
– volume-title: OMNeT++ Discrete Event Simulator
  year: 2020
  ident: ref45
– ident: ref25
  doi: 10.1109/WFCS.2018.8402374
– ident: ref29
  doi: 10.1109/TII.2017.2782235
– ident: ref51
  doi: 10.1007/s11241-016-9265-0
– volume-title: NetworkX—NetworkX Documentation
  year: 2020
  ident: ref53
– ident: ref42
  doi: 10.1109/49.536364
– ident: ref44
  doi: 10.1109/87.388131
– ident: ref11
  doi: 10.1109/RTAS.2017.10
– ident: ref47
  doi: 10.1109/PDP2018.2018.00048
– ident: ref31
  doi: 10.1145/3139258.3139289
– volume: 64
  start-page: 1
  volume-title: Proc. Int. Symp. Algorithms Comput. (ISAAC)
  ident: ref40
  article-title: A sidetrack-based algorithm for finding the k shortest simple paths in a directed graph
– volume-title: Ostinato—Traffic Generator for Network Engineers
  year: 2020
  ident: ref58
– ident: ref6
  doi: 10.1109/IEEESTD.2008.4602826
– ident: ref9
  doi: 10.1109/JPROC.2019.2905334
– ident: ref50
  doi: 10.1007/s11241-014-9214-8
– volume-title: Layerscape LS1028A Reference Design Board
  year: 2020
  ident: ref57
– ident: ref12
  doi: 10.1109/RTAS.2018.00009
– ident: ref38
  doi: 10.1287/mnsc.17.11.712
– ident: ref16
  doi: 10.1109/JIOT.2021.3124508
– ident: ref5
  doi: 10.1109/IEEESTD.2018.8467507
– ident: ref8
  doi: 10.1109/MCOMSTD.2018.1700079
– ident: ref24
  doi: 10.1109/FWC.2017.8368523
– ident: ref52
  doi: 10.1109/TII.2020.2998224
– ident: ref3
  doi: 10.1109/JPROC.2018.2888703
– ident: ref28
  doi: 10.1109/WFCS47810.2020.9114414
– volume-title: TSN Simulation: Time-Aware Shaper Implemented in NS-3
  year: 2021
  ident: ref46
– ident: ref34
  doi: 10.1109/TII.2019.2950887
– ident: ref18
  doi: 10.1109/ICMA.2018.8484302
– ident: ref21
  doi: 10.1109/RTAS.2018.00008
– ident: ref54
  doi: 10.1186/1471-2105-9-82
– ident: ref27
  doi: 10.1109/JAS.2021.1003844
– ident: ref49
  doi: 10.1201/9781315217512
– ident: ref13
  doi: 10.1109/ACCESS.2018.2858767
– ident: ref17
  doi: 10.1109/NTMS.2016.7792488
– start-page: 1
  volume-title: Proc. ODVA Ind. Conf.
  ident: ref55
  article-title: Time sensitive network (TSN) protocols and use in EtherNet/IP systems
– ident: ref1
  doi: 10.1109/MIE.2011.942175
– ident: ref10
  doi: 10.1109/ACCESS.2020.3035548
– ident: ref14
  doi: 10.1109/JIOT.2020.3031932
– volume-title: Cisco Industrial Ethernet 4000 Series Switches
  year: 2020
  ident: ref56
– start-page: 612
  volume-title: Computer Networking: A Top-Down Approach
  year: 2013
  ident: ref48
– ident: ref30
  doi: 10.1016/j.aej.2020.06.013
– ident: ref35
  doi: 10.1007/978-3-030-43024-5_7
– volume-title: Time-Sensitive Networking Profile for Industrial Automation
  year: 2018
  ident: ref36
– ident: ref20
  doi: 10.1145/2997465.2997470
SSID ssj0001105196
Score 2.3730297
Snippet Recently, time-sensitive networking (TSN) has been developed to incorporate real-time capabilities to the standard Ethernet for the incompatible issue in...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 18663
SubjectTerms Algorithms
Automation
Critical flow
Ethernet
Genetic algorithms
Industrial applications
Industrial Internet of Things
Industrial Internet of Things (IIoT)
Integer programming
Iterative methods
Job shop scheduling
Linear programming
Logic gates
Network topologies
Real time
Routing
Schedules
Scheduling
Switches
Time factors
time-sensitive networks
Title Joint Traffic Routing and Scheduling Algorithm Eliminating the Nondeterministic Interruption for TSN Networks Used in IIoT
URI https://ieeexplore.ieee.org/document/9744608
https://www.proquest.com/docview/2717159666
Volume 9
WOSCitedRecordID wos000857705300041&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: 2327-4662
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001105196
  issn: 2327-4662
  databaseCode: RIE
  dateStart: 20140101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Nb9QwELVKxYELbSmIpaXygRMiNHFsb3ysqlZsDwGJrdRb5InHdKVtgnazHPj1HTveRQiExC1RxlGkF_vNs-eDsXcApkWvTGZa5zOpbJmBEpjZVkOhgThUQ2w2Ma3r6u7OfNljH3a5MIgYg8_wY7iMZ_mubzdhq-ycfF-pQ2bvk-lUj7lav_ZTiuCM6HRwWeTm_Gb2eU4CUAjSpZoW6-I36om9VP5YgCOrXB_83_ccsufJe-QXI9xHbA-7F-xg25mBp4l6zH7e9Itu4EREoUIED2E_RFHcdo5s7oldQhI6v1h-61eL4f6BXy1jc69oRB4hr_vOpTiZWMiZx43D1SauL5z8XD7_WvN6DCFf89s1Or7o-GzWz1-y2-ur-eWnLHVZyFqi-iFz4LFQrpBWWqGDHgQlnUFZYO4k3SFAJQwgPaq884jWgxGF1SBKj6J8xfa7vsPXjCtbGeugLBVU0nsS16VvDSir8lJJcBOWbwFo2lSCPHTCWDZRiuSmCZg1AbMmYTZh73dDvo_1N_5lfBxA2hkmfCbsdItyk2bouhGkY8mVI_X25u-jTtiz8O4xcO-U7Q-rDb5lT9sfw2K9Oos_3yOWc9uf
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Nb9QwELWqUgkulFIQW0rrAydEaOLYIT5WqFW3HwGJVOot8sTjdqUlQbvZHvj1jL3eRQhUqbdEGSuRXuw3z54Pxt4D6Bad0olurUukMnkCSmBi2gKyAohDCwjNJj5XVXlzo79tsI_rXBhEDMFn-MlfhrN827cLv1V2RL6vLHxm7xPfOStma_3ZUcm8O1LEo8ss1Ufn4681SUAhSJkWtFxnf5FP6KbyzxIceOV0-3Ff9II9j_4jP14CvsM2sHvJtle9GXicqrvs13k_6QZOVORrRHAf-EMkxU1nyeaO-MWnofPj6W0_mwx3P_jJNLT3CkbkE_Kq72yMlAmlnHnYOpwtwgrDydPl9feKV8sg8jm_nqPlk46Px339il2fntRfzpLYZyFpieyHxILDTNlMGmlE4RUhKGk1ygxTK-kOAUqhAelR6axDNA60yEwBInco8tdss-s7fMO4MqU2FvJcQSmdI3mdu1aDMirNlQQ7YukKgKaNRch9L4xpE8RIqhuPWeMxayJmI_ZhPeTnsgLHQ8a7HqS1YcRnxPZXKDdxjs4bQUqWnDnSb3v_H3XInp7VV5fN5bi6eMue-fcsw_j22eYwW-A7ttXeD5P57CD8iL8BKy_e6A
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=Joint+Traffic+Routing+and+Scheduling+Algorithm+Eliminating+the+Nondeterministic+Interruption+for+TSN+Networks+Used+in+IIoT&rft.jtitle=IEEE+internet+of+things+journal&rft.au=Li%2C+Yuting&rft.au=Jiang%2C+Junhui&rft.au=Hong%2C+Seung+Ho&rft.date=2022-10-01&rft.issn=2327-4662&rft.eissn=2327-4662&rft.volume=9&rft.issue=19&rft.spage=18663&rft.epage=18680&rft_id=info:doi/10.1109%2FJIOT.2022.3163411&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_JIOT_2022_3163411
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2327-4662&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2327-4662&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2327-4662&client=summon