Heuristic Routing Algorithms for Time-Sensitive Networks in Smart Factories
Over recent years, traditional manufacturing factories have been accelerating their transformation and upgrade toward smart factories, which are an important concept within Industry 4.0. As a key communication technology in the industrial internet architecture, time-sensitive networks (TSNs) can bre...
| Main Authors: | , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2022-05-01
|
| Series: | Sensors |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1424-8220/22/11/4153 |
| _version_ | 1797491721182904320 |
|---|---|
| author | Yue Li Zhenyu Yin Yue Ma Fulong Xu Haoyu Yu Guangjie Han Yuanguo Bi |
| author_facet | Yue Li Zhenyu Yin Yue Ma Fulong Xu Haoyu Yu Guangjie Han Yuanguo Bi |
| author_sort | Yue Li |
| collection | DOAJ |
| description | Over recent years, traditional manufacturing factories have been accelerating their transformation and upgrade toward smart factories, which are an important concept within Industry 4.0. As a key communication technology in the industrial internet architecture, time-sensitive networks (TSNs) can break through communication barriers between subsystems within smart factories and form a common network for various network flows. Traditional routing algorithms are not applicable for this novel type of network, as they cause unnecessary congestion and latency. Therefore, this study examined the classification of TSN flows in smart factories, converted the routing problem into two graphical problems, and proposed two heuristic optimization algorithms, namely GATTRP and AACO, to find the optimal solution. The experiments showed that the algorithms proposed in this paper could provide a more reasonable routing arrangement for various TSN flows with different time sensitivities. The algorithms could effectively reduce the overall delay by up to 74% and 41%, respectively, with promising operating performances. |
| first_indexed | 2024-03-10T00:52:26Z |
| format | Article |
| id | doaj.art-f88d3209db2c4978bb9156a288790984 |
| institution | Directory Open Access Journal |
| issn | 1424-8220 |
| language | English |
| last_indexed | 2024-03-10T00:52:26Z |
| publishDate | 2022-05-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Sensors |
| spelling | doaj.art-f88d3209db2c4978bb9156a2887909842023-11-23T14:49:28ZengMDPI AGSensors1424-82202022-05-012211415310.3390/s22114153Heuristic Routing Algorithms for Time-Sensitive Networks in Smart FactoriesYue Li0Zhenyu Yin1Yue Ma2Fulong Xu3Haoyu Yu4Guangjie Han5Yuanguo Bi6School of Computer Science and Technology, University of Chinese Academy of Sciences, Beijing 100049, ChinaSchool of Computer Science and Technology, University of Chinese Academy of Sciences, Beijing 100049, ChinaSchool of Computer Science and Technology, University of Chinese Academy of Sciences, Beijing 100049, ChinaSchool of Computer Science and Technology, University of Chinese Academy of Sciences, Beijing 100049, ChinaSchool of Computer Science and Technology, University of Chinese Academy of Sciences, Beijing 100049, ChinaCollege of Internet of Things Engineering, Hohai University, Changzhou 213022, ChinaSchool of Computer Science and Engineering, Northeastern University, Shenyang 110167, ChinaOver recent years, traditional manufacturing factories have been accelerating their transformation and upgrade toward smart factories, which are an important concept within Industry 4.0. As a key communication technology in the industrial internet architecture, time-sensitive networks (TSNs) can break through communication barriers between subsystems within smart factories and form a common network for various network flows. Traditional routing algorithms are not applicable for this novel type of network, as they cause unnecessary congestion and latency. Therefore, this study examined the classification of TSN flows in smart factories, converted the routing problem into two graphical problems, and proposed two heuristic optimization algorithms, namely GATTRP and AACO, to find the optimal solution. The experiments showed that the algorithms proposed in this paper could provide a more reasonable routing arrangement for various TSN flows with different time sensitivities. The algorithms could effectively reduce the overall delay by up to 74% and 41%, respectively, with promising operating performances.https://www.mdpi.com/1424-8220/22/11/4153time-sensitive networksmart factoryindustrial internetroutingheuristic algorithm |
| spellingShingle | Yue Li Zhenyu Yin Yue Ma Fulong Xu Haoyu Yu Guangjie Han Yuanguo Bi Heuristic Routing Algorithms for Time-Sensitive Networks in Smart Factories Sensors time-sensitive network smart factory industrial internet routing heuristic algorithm |
| title | Heuristic Routing Algorithms for Time-Sensitive Networks in Smart Factories |
| title_full | Heuristic Routing Algorithms for Time-Sensitive Networks in Smart Factories |
| title_fullStr | Heuristic Routing Algorithms for Time-Sensitive Networks in Smart Factories |
| title_full_unstemmed | Heuristic Routing Algorithms for Time-Sensitive Networks in Smart Factories |
| title_short | Heuristic Routing Algorithms for Time-Sensitive Networks in Smart Factories |
| title_sort | heuristic routing algorithms for time sensitive networks in smart factories |
| topic | time-sensitive network smart factory industrial internet routing heuristic algorithm |
| url | https://www.mdpi.com/1424-8220/22/11/4153 |
| work_keys_str_mv | AT yueli heuristicroutingalgorithmsfortimesensitivenetworksinsmartfactories AT zhenyuyin heuristicroutingalgorithmsfortimesensitivenetworksinsmartfactories AT yuema heuristicroutingalgorithmsfortimesensitivenetworksinsmartfactories AT fulongxu heuristicroutingalgorithmsfortimesensitivenetworksinsmartfactories AT haoyuyu heuristicroutingalgorithmsfortimesensitivenetworksinsmartfactories AT guangjiehan heuristicroutingalgorithmsfortimesensitivenetworksinsmartfactories AT yuanguobi heuristicroutingalgorithmsfortimesensitivenetworksinsmartfactories |