Research on routing and scheduling algorithms for the simultaneous transmission of diverse data streaming services on the industrial internet
Abstract OPC UA PubSub Over TSN is the core of the Industrial Internet and guarantees flexible interaction features for multiple parties in real-time for industrial communication. To achieve the transmission of time-triggered traffic in PubSub NetworkMessage, routing and scheduling data need to be a...
Guardado en:
Autores principales: | , , , , |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Nature Portfolio
2021
|
Materias: | |
Acceso en línea: | https://doaj.org/article/f346b70cde62475d8117ee183f09770f |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
id |
oai:doaj.org-article:f346b70cde62475d8117ee183f09770f |
---|---|
record_format |
dspace |
spelling |
oai:doaj.org-article:f346b70cde62475d8117ee183f09770f2021-12-02T17:23:39ZResearch on routing and scheduling algorithms for the simultaneous transmission of diverse data streaming services on the industrial internet10.1038/s41598-021-97613-92045-2322https://doaj.org/article/f346b70cde62475d8117ee183f09770f2021-09-01T00:00:00Zhttps://doi.org/10.1038/s41598-021-97613-9https://doaj.org/toc/2045-2322Abstract OPC UA PubSub Over TSN is the core of the Industrial Internet and guarantees flexible interaction features for multiple parties in real-time for industrial communication. To achieve the transmission of time-triggered traffic in PubSub NetworkMessage, routing and scheduling data need to be analyzed. Traditional routing and scheduling methods have disadvantages such as low calculation efficiency, slow convergence speed, and poor reliability. Therefore, a routing and scheduling method for OPC UA PubSub NetworkMessage time-triggered traffic based on an improved ant colony algorithm is proposed. First, we analyze the network topology model, traffic model, and traffic transmission constraints of TSN; then, we apply the K-means clustering algorithm, the KSP algorithm based on the shortest path idea, and an improved ant colony algorithm for traffic classification, routing, and scheduling calculation. Experimental results show that this method can effectively reduce the delay increase caused by link congestion, improve the ability to schedule time-triggered traffic, and accelerate the convergence rate of iteration.Yan SongChenyang GuoPanfeng XuLina LiRui ZhangNature PortfolioarticleMedicineRScienceQENScientific Reports, Vol 11, Iss 1, Pp 1-13 (2021) |
institution |
DOAJ |
collection |
DOAJ |
language |
EN |
topic |
Medicine R Science Q |
spellingShingle |
Medicine R Science Q Yan Song Chenyang Guo Panfeng Xu Lina Li Rui Zhang Research on routing and scheduling algorithms for the simultaneous transmission of diverse data streaming services on the industrial internet |
description |
Abstract OPC UA PubSub Over TSN is the core of the Industrial Internet and guarantees flexible interaction features for multiple parties in real-time for industrial communication. To achieve the transmission of time-triggered traffic in PubSub NetworkMessage, routing and scheduling data need to be analyzed. Traditional routing and scheduling methods have disadvantages such as low calculation efficiency, slow convergence speed, and poor reliability. Therefore, a routing and scheduling method for OPC UA PubSub NetworkMessage time-triggered traffic based on an improved ant colony algorithm is proposed. First, we analyze the network topology model, traffic model, and traffic transmission constraints of TSN; then, we apply the K-means clustering algorithm, the KSP algorithm based on the shortest path idea, and an improved ant colony algorithm for traffic classification, routing, and scheduling calculation. Experimental results show that this method can effectively reduce the delay increase caused by link congestion, improve the ability to schedule time-triggered traffic, and accelerate the convergence rate of iteration. |
format |
article |
author |
Yan Song Chenyang Guo Panfeng Xu Lina Li Rui Zhang |
author_facet |
Yan Song Chenyang Guo Panfeng Xu Lina Li Rui Zhang |
author_sort |
Yan Song |
title |
Research on routing and scheduling algorithms for the simultaneous transmission of diverse data streaming services on the industrial internet |
title_short |
Research on routing and scheduling algorithms for the simultaneous transmission of diverse data streaming services on the industrial internet |
title_full |
Research on routing and scheduling algorithms for the simultaneous transmission of diverse data streaming services on the industrial internet |
title_fullStr |
Research on routing and scheduling algorithms for the simultaneous transmission of diverse data streaming services on the industrial internet |
title_full_unstemmed |
Research on routing and scheduling algorithms for the simultaneous transmission of diverse data streaming services on the industrial internet |
title_sort |
research on routing and scheduling algorithms for the simultaneous transmission of diverse data streaming services on the industrial internet |
publisher |
Nature Portfolio |
publishDate |
2021 |
url |
https://doaj.org/article/f346b70cde62475d8117ee183f09770f |
work_keys_str_mv |
AT yansong researchonroutingandschedulingalgorithmsforthesimultaneoustransmissionofdiversedatastreamingservicesontheindustrialinternet AT chenyangguo researchonroutingandschedulingalgorithmsforthesimultaneoustransmissionofdiversedatastreamingservicesontheindustrialinternet AT panfengxu researchonroutingandschedulingalgorithmsforthesimultaneoustransmissionofdiversedatastreamingservicesontheindustrialinternet AT linali researchonroutingandschedulingalgorithmsforthesimultaneoustransmissionofdiversedatastreamingservicesontheindustrialinternet AT ruizhang researchonroutingandschedulingalgorithmsforthesimultaneoustransmissionofdiversedatastreamingservicesontheindustrialinternet |
_version_ |
1718381003537383424 |