An optimization algorithm for joint routing and scheduling in time-sensitive networks

Time-Sensitive Networking (TSN) is an Ethernet communication standard developed by the IEEE TSN working group. It is an emerging industrial communication technology that can meet the requirements of low latency and high reliability for time-sensitive applications. However, the TSN protocol does not...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2023 8th International Conference on Multimedia Communication Technologies (ICMCT) S. 32 - 37
Hauptverfasser: Lin, ZhenWei, Xu, Bo, Qiu, Kun
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 04.08.2023
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract Time-Sensitive Networking (TSN) is an Ethernet communication standard developed by the IEEE TSN working group. It is an emerging industrial communication technology that can meet the requirements of low latency and high reliability for time-sensitive applications. However, the TSN protocol does not specify the specific implementation methods for traffic scheduling, making traffic scheduling algorithm research an ongoing open problem in the TSN field. In this paper, we propose a joint algorithm for routing selection and scheduling. The routing selection considers the requirements of link load and transmission delay, while the scheduling algorithm determines the transmission time of traffic using a hybrid strategy of basic and hyper cycles. Additionally, an improved tabu search algorithm is employed to optimize the results. Furthermore, we implement a TSN simulation environment using the NeSTiNg framework based on OMNeT. The simulation results demonstrate that the proposed algorithm, compared to the reference algorithm, can consistently complete traffic scheduling within a shorter time as network traffic increases. This ensures the real-time transmission performance of streaming traffic. Moreover, the results show that using the sorted set of traffic as the initial solution for the tabu search yields superior results.
AbstractList Time-Sensitive Networking (TSN) is an Ethernet communication standard developed by the IEEE TSN working group. It is an emerging industrial communication technology that can meet the requirements of low latency and high reliability for time-sensitive applications. However, the TSN protocol does not specify the specific implementation methods for traffic scheduling, making traffic scheduling algorithm research an ongoing open problem in the TSN field. In this paper, we propose a joint algorithm for routing selection and scheduling. The routing selection considers the requirements of link load and transmission delay, while the scheduling algorithm determines the transmission time of traffic using a hybrid strategy of basic and hyper cycles. Additionally, an improved tabu search algorithm is employed to optimize the results. Furthermore, we implement a TSN simulation environment using the NeSTiNg framework based on OMNeT. The simulation results demonstrate that the proposed algorithm, compared to the reference algorithm, can consistently complete traffic scheduling within a shorter time as network traffic increases. This ensures the real-time transmission performance of streaming traffic. Moreover, the results show that using the sorted set of traffic as the initial solution for the tabu search yields superior results.
Author Xu, Bo
Lin, ZhenWei
Qiu, Kun
Author_xml – sequence: 1
  givenname: ZhenWei
  surname: Lin
  fullname: Lin, ZhenWei
  email: lzw_4882@163.com
  organization: University of Electronic Science and Technology of China,ChengDu,China
– sequence: 2
  givenname: Bo
  surname: Xu
  fullname: Xu, Bo
  organization: University of Electronic Science and Technology of China,ChengDu,China
– sequence: 3
  givenname: Kun
  surname: Qiu
  fullname: Qiu, Kun
  organization: University of Electronic Science and Technology of China,ChengDu,China
BookMark eNotjMtOwzAUBY0ECyj9A5D8AwnXsZ3YyyriUamITbuuHOe6NSR25bgg-HpawepoRppzQy5DDEjIPYOSMdAPy_a1XdcgFC8rqHgJAIxfkLlutOISuKhEBddkswg0HrIf_Y_JPgZqhl1MPu9H6mKi79GHTFM8Zh921ISeTnaP_XE4ow_0FGIxYZh89p9IA-avmD6mW3LlzDDh_H9nZPP0uG5fitXb87JdrArPmM4F1sqITqNAZq1ELRuhUdtGCMbdSUp0tbNCOqYsNg4UMNVrYTolWGd5z2fk7u_XI-L2kPxo0veWAZdNDcB_ARhxUMs
CODEN IEEPAD
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ICMCT60483.2023.00013
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Xplore
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE/IET Electronic Library
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 9798350342420
EndPage 37
ExternalDocumentID 10357600
Genre orig-research
GroupedDBID 6IE
6IL
CBEJK
RIE
RIL
ID FETCH-LOGICAL-i119t-e68a4b9e4e1cc5e95749e9c74413f4e15ef6fc45f18ce7f08018d94ab841bc3d3
IEDL.DBID RIE
IngestDate Wed Nov 19 08:26:59 EST 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i119t-e68a4b9e4e1cc5e95749e9c74413f4e15ef6fc45f18ce7f08018d94ab841bc3d3
PageCount 6
ParticipantIDs ieee_primary_10357600
PublicationCentury 2000
PublicationDate 2023-Aug.-4
PublicationDateYYYYMMDD 2023-08-04
PublicationDate_xml – month: 08
  year: 2023
  text: 2023-Aug.-4
  day: 04
PublicationDecade 2020
PublicationTitle 2023 8th International Conference on Multimedia Communication Technologies (ICMCT)
PublicationTitleAbbrev ICMCT
PublicationYear 2023
Publisher IEEE
Publisher_xml – name: IEEE
Score 1.840179
Snippet Time-Sensitive Networking (TSN) is an Ethernet communication standard developed by the IEEE TSN working group. It is an emerging industrial communication...
SourceID ieee
SourceType Publisher
StartPage 32
SubjectTerms Delays
Job shop scheduling
Real-time systems
Routing
routing and scheduling
Scheduling algorithms
Simulation
Telecommunication traffic
time-sensitive networking
Title An optimization algorithm for joint routing and scheduling in time-sensitive networks
URI https://ieeexplore.ieee.org/document/10357600
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV09T0MhFCW2cXBSY43fYXCllgIPGE2j0cGmQ5t0ax5w0Wcsz7Sv_n6BPjUODm7kLoRL4B7gHA5C16YQlFnLiIt4lcR67IlRnhMrhwIGlpoBuGw2IcdjNZ_rSStWz1oYAMjkM-inZn7Ld7XdpKuyuMKZSA9JHdSRstiKtVpVDh3om8fR02hapD_S-8kUvJ_xzS_XlFw07vf_2d0B6v3I7_Dku7Acoh0IR2h2G3Ad1_eyFU7i8u25jif7lyWOuBO_1lVo8KreJBozLoPD8dgay0hSm-Mq4OQhT9aJrZ72Nxy27O91D83u76ajB9J6IpCKUt0QKFTJjQYO1FoBWkiuQVsZUQ3zMSjAF95y4amyIH3Eg1Q5zUujODWWOXaMuqEOcIIwi1DLO2njGAtOLaghE8Cc4EVpIhCQp6iXcrJ43357sfhKx9kf8XO0l9Ke2XH8AnWb1QYu0a79aKr16ipP1ienSpjb
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NTwMhFCRaTfSkxhq_5eCVuhTYXY6msWlj2_TQJr01u_DQNZZt2q2_X6CrxoMHb4QL4RF482CGQeg-jwVlSjGiHV4lLh8bkqeGE5W0BUSK5hHoYDaRjEbpbCbHtVg9aGEAIJDPoOWb4S1fl2rjr8rcDmfCPyTtoj3BeTvayrVqXQ6N5EO_M-xMYv9LesvbgrcCwvnlmxLSRvfonwMeo-aPAA-Pv1PLCdoBe4qmjxaXbocvaukkzt5fSlfbvy6wQ574rSxshVflxhOZcWY1doWrSyReb44Li72LPFl7vro_4bDd8r_XTTTtPk06PVK7IpCCUlkRiNOM5xI4UKUESJFwCVIlDtcw4zoFmNgoLgxNFSTGIUKaasmzPOU0V0yzM9SwpYVzhJkDW0Ynys0x5lRB2mYCmBY8znIHBZIL1PQxmS-3H1_Mv8Jx-Uf_HTroTYaD-aA_er5Ch34JAleOX6NGtdrADdpXH1WxXt2GhfsEyG2cIg
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%3Abook&rft.genre=proceeding&rft.title=2023+8th+International+Conference+on+Multimedia+Communication+Technologies+%28ICMCT%29&rft.atitle=An+optimization+algorithm+for+joint+routing+and+scheduling+in+time-sensitive+networks&rft.au=Lin%2C+ZhenWei&rft.au=Xu%2C+Bo&rft.au=Qiu%2C+Kun&rft.date=2023-08-04&rft.pub=IEEE&rft.spage=32&rft.epage=37&rft_id=info:doi/10.1109%2FICMCT60483.2023.00013&rft.externalDocID=10357600