Joint Optimization Algorithm of Traffic Scheduling and Routing of Latency Sensitive Services for Time-Sensitive Networking

Time-Sensitive Networking (TSN) is considered to be an important means to achieve deterministic low-latency transmission, and traffic scheduling and routing are the keys to deterministic transmission. In this paper we first formulate the routing and scheduling joint optimization problem in TSN netwo...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2023 IEEE 3rd International Conference on Intelligent Technology and Embedded Systems (ICITES) s. 128 - 136
Hlavní autoři: Liu, Xu, Jiang, Song, Mei, Zengyang, Hua, Weitao, Xu, Huichen
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 27.10.2023
Témata:
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract Time-Sensitive Networking (TSN) is considered to be an important means to achieve deterministic low-latency transmission, and traffic scheduling and routing are the keys to deterministic transmission. In this paper we first formulate the routing and scheduling joint optimization problem in TSN networks, where the schedulability of all data flows in the network is minimized by optimizing the transmission time slots of each data flow while considering routing. The optimal routing scheme is first determined using a heuristic algorithm, and then the scheduling scheme for each data stream is determined based on the constraints. To further optimize the schedulability ratio, the scheduling order among data flows is optimized using the Genetic Algorithm (GA). Simulation results show that compared with the traditional algorithms, the proposed algorithm has a higher schedulability and shorter running time even when the network size increases gradually.
AbstractList Time-Sensitive Networking (TSN) is considered to be an important means to achieve deterministic low-latency transmission, and traffic scheduling and routing are the keys to deterministic transmission. In this paper we first formulate the routing and scheduling joint optimization problem in TSN networks, where the schedulability of all data flows in the network is minimized by optimizing the transmission time slots of each data flow while considering routing. The optimal routing scheme is first determined using a heuristic algorithm, and then the scheduling scheme for each data stream is determined based on the constraints. To further optimize the schedulability ratio, the scheduling order among data flows is optimized using the Genetic Algorithm (GA). Simulation results show that compared with the traditional algorithms, the proposed algorithm has a higher schedulability and shorter running time even when the network size increases gradually.
Author Mei, Zengyang
Liu, Xu
Hua, Weitao
Xu, Huichen
Jiang, Song
Author_xml – sequence: 1
  givenname: Xu
  surname: Liu
  fullname: Liu, Xu
  email: 15751867258@163.com
  organization: State Grid Jiangsu Electric Power Company,Information and Communication Branch,Nanjing,China
– sequence: 2
  givenname: Song
  surname: Jiang
  fullname: Jiang, Song
  organization: State Grid Jiangsu Electric Power Company,Information and Communication Branch,Nanjing,China
– sequence: 3
  givenname: Zengyang
  surname: Mei
  fullname: Mei, Zengyang
  organization: State Grid Jiangsu Electric Power Company,Information and Communication Branch,Nanjing,China
– sequence: 4
  givenname: Weitao
  surname: Hua
  fullname: Hua, Weitao
  organization: State Grid Jiangsu Electric Power Company,Information and Communication Branch,Nanjing,China
– sequence: 5
  givenname: Huichen
  surname: Xu
  fullname: Xu, Huichen
  organization: State Grid Jiangsu Electric Power Company,Information and Communication Branch,Nanjing,China
BookMark eNpFUM1OAjEYrIkeFHkDD_UBFtv9tu32SAgqZiOJrGdS-gONbEtKwcDTu0aNp5lkfpKZG3QZYrAI3VMyopTIh9lk1k4XTNa0HpWkhBElwHgt4AINpZA1MAIVCMau0fkl-pDxfJd9588q-xjweLuOyedNh6PDbVLOeY0XemPNYevDGqtg8Fs85G_eOxqVbdAnvLBh77M_2p6lo9d2j11MuPWdLf61V5s_Y_ros7foyqnt3g5_cYDeH6ft5Llo5k-zybgpPKUyF7qSmjkHhq1MbTk1nCsDFJwBXgpDK8KEASfVilsKQgPpdwuuy6oUasUMDNDdT6-31i53yXcqnZZ_l8AXbRFelg
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ICITES59818.2023.10356873
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 9798350343755
EndPage 136
ExternalDocumentID 10356873
Genre orig-research
GroupedDBID 6IE
6IL
CBEJK
RIE
RIL
ID FETCH-LOGICAL-i119t-c49c5ff3d5bd8e61d66ad313fd3627d14057d3f9ab6e137c3098176c2427ab5d3
IEDL.DBID RIE
IngestDate Wed Jan 10 09:27:55 EST 2024
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i119t-c49c5ff3d5bd8e61d66ad313fd3627d14057d3f9ab6e137c3098176c2427ab5d3
PageCount 9
ParticipantIDs ieee_primary_10356873
PublicationCentury 2000
PublicationDate 2023-Oct.-27
PublicationDateYYYYMMDD 2023-10-27
PublicationDate_xml – month: 10
  year: 2023
  text: 2023-Oct.-27
  day: 27
PublicationDecade 2020
PublicationTitle 2023 IEEE 3rd International Conference on Intelligent Technology and Embedded Systems (ICITES)
PublicationTitleAbbrev ICITES
PublicationYear 2023
Publisher IEEE
Publisher_xml – name: IEEE
Score 1.8488151
Snippet Time-Sensitive Networking (TSN) is considered to be an important means to achieve deterministic low-latency transmission, and traffic scheduling and routing...
SourceID ieee
SourceType Publisher
StartPage 128
SubjectTerms Bandwidth
Embedded systems
Heuristic algorithms
Integrity of the Specifications
Low latency communication
Routing
routing and scheduling
Scheduling
Simulation
TSN
Title Joint Optimization Algorithm of Traffic Scheduling and Routing of Latency Sensitive Services for Time-Sensitive Networking
URI https://ieeexplore.ieee.org/document/10356873
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NS8NAEF1sEfGkYsVvVvCamu0ms8lRikVFaqEKvZXNftSCTaSmgv56Z9LU4sGDtyXZEJhh9s0k780wdikjoJYlUQAOa9VImCTQ2orAYckMFoxJhK-GTah-PxmN0kEtVq-0MM65inzm2rSs_uXbwizoUxlGuIwhUbLBGkrBUqy1xS7qvplXd12M9mGcIga1aSp4e7X_1-SUCjh6O_985S5rrSV4fPADLntsw-X77Ou-mOYlf8Qwn9X6SX79OimwwH-Z8cJzRB5qCcGH6ApLHPMJ17nlRPuhNe540JQkf_IhEdfpqOOr04Jj-spJERKs7_WXJHF8tsWeezdP3dugHp4QTIVIy8BEqYm9lzbObOJAWABtpZDeImQpKyhRs9KnOgMnpDIyRLspMAjZSmexlQesmRe5O2Q8dLGA0HhMBiCCLNS6Y5KOx8TRZQlAdsRaZLjx27I_xnhls-M_rp-wbXIPIUBHnbJmOV-4M7ZpPsrp-_y88uo3q_6mlQ
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NS8NAEF20inpSseK3K3hNzWaTTXKUYmm1xkIr9FY2-1ELNpGaCvrrnUlTiwcP3pYkS2CG2fcmmTdDyDX3BbYs8R1hIFf1mYocKTVzDKTMQgulImbLYRNhkkTDYdyrxOqlFsYYUxafmQYuy3_5Oldz_FQGEc4DEYV8nWwEvu-5C7nWFrmqOmfedJoQ7_0gBhRq4FzwxnLHr9kpJXS0dv_50j1SX4nwaO8HXvbJmskOyNd9PskK-gSBPq0UlPT2dZxDiv8ypbmlgD3YFIL2wRkaq8zHVGaaYuEPruGJrkSa_En7WLqOhx1dnhcUCCxFTYizupcsysRhb508t-4GzbZTjU9wJozFhaP8WAXWch2kOjKCaSGk5oxbDaAVaoZUTXMby1QYxkPFXbBbKBSAdijTQPNDUsvyzBwR6pqACVdZoAPCF6krpacizwJ1NGkkRHpM6mi40duiQ8ZoabOTP65fku324LE76naSh1Oyg65CPPDCM1IrZnNzTjbVRzF5n12UHv4Gf_mp3A
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+IEEE+3rd+International+Conference+on+Intelligent+Technology+and+Embedded+Systems+%28ICITES%29&rft.atitle=Joint+Optimization+Algorithm+of+Traffic+Scheduling+and+Routing+of+Latency+Sensitive+Services+for+Time-Sensitive+Networking&rft.au=Liu%2C+Xu&rft.au=Jiang%2C+Song&rft.au=Mei%2C+Zengyang&rft.au=Hua%2C+Weitao&rft.date=2023-10-27&rft.pub=IEEE&rft.spage=128&rft.epage=136&rft_id=info:doi/10.1109%2FICITES59818.2023.10356873&rft.externalDocID=10356873