A schedulability-aware routing algorithm for time sensitive network based on improved ant colony algorithm

IF 4.4 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Yi Guo, Feng Luo, Zitong Wang, Yingpeng Tong, Yi Ren
{"title":"A schedulability-aware routing algorithm for time sensitive network based on improved ant colony algorithm","authors":"Yi Guo,&nbsp;Feng Luo,&nbsp;Zitong Wang,&nbsp;Yingpeng Tong,&nbsp;Yi Ren","doi":"10.1016/j.adhoc.2024.103741","DOIUrl":null,"url":null,"abstract":"<div><div>With the rapid development of industrial automation, there are higher requirements for reliable and deterministic communication in industrial networks, including in-vehicle networks, avionics and intelligent transport. Time Sensitive Network offers bounded, low-latency transmission assurance for crucial traffic via the Time Aware Shaper described in the IEEE 802.1Qbv. This standard ensures low jitter and deterministic delay for time-sensitive traffic by employing a pre-calculated circular transmission schedule. Current scheduling algorithms typically use the shortest path algorithm to determine paths for time-triggered flows. However, this approach can lead to an excessive concentration of time-triggered flows traversing the same link, thereby impacting the scheduling feasibility of such flows. In this paper, first, the time-sensitive network topology and time-triggered flows are modeled and the SMT-based no-wait scheduling constraints are proposed. Then, a schedulability-aware routing (SAR) algorithm based on the improved ant colony algorithm is designed to enhance the schedulability of time-triggered flows under the no-wait scheduling problem, thereby improving the ability of the time-sensitive network to accommodate time-triggered flows. Finally, SAR is compared with four routing algorithms including the shortest path routing algorithm (Dijkstra) to evaluate its performance under different network loads. The results show a significant improvement in the scheduling success rate of SAR compared to other routing algorithms. In the original network topology, when the link communication rate is 1000 Mbit/s, SAR achieves scheduling success rates that are 44 %, 62 %, and 56 % higher than Dijkstra for 80, 85, and 90 time-triggered flows, respectively, and 18 %, 8 %, and 10 % higher than LBR.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"169 ","pages":"Article 103741"},"PeriodicalIF":4.4000,"publicationDate":"2024-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ad Hoc Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1570870524003524","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

With the rapid development of industrial automation, there are higher requirements for reliable and deterministic communication in industrial networks, including in-vehicle networks, avionics and intelligent transport. Time Sensitive Network offers bounded, low-latency transmission assurance for crucial traffic via the Time Aware Shaper described in the IEEE 802.1Qbv. This standard ensures low jitter and deterministic delay for time-sensitive traffic by employing a pre-calculated circular transmission schedule. Current scheduling algorithms typically use the shortest path algorithm to determine paths for time-triggered flows. However, this approach can lead to an excessive concentration of time-triggered flows traversing the same link, thereby impacting the scheduling feasibility of such flows. In this paper, first, the time-sensitive network topology and time-triggered flows are modeled and the SMT-based no-wait scheduling constraints are proposed. Then, a schedulability-aware routing (SAR) algorithm based on the improved ant colony algorithm is designed to enhance the schedulability of time-triggered flows under the no-wait scheduling problem, thereby improving the ability of the time-sensitive network to accommodate time-triggered flows. Finally, SAR is compared with four routing algorithms including the shortest path routing algorithm (Dijkstra) to evaluate its performance under different network loads. The results show a significant improvement in the scheduling success rate of SAR compared to other routing algorithms. In the original network topology, when the link communication rate is 1000 Mbit/s, SAR achieves scheduling success rates that are 44 %, 62 %, and 56 % higher than Dijkstra for 80, 85, and 90 time-triggered flows, respectively, and 18 %, 8 %, and 10 % higher than LBR.
求助全文
约1分钟内获得全文 求助全文
来源期刊
Ad Hoc Networks
Ad Hoc Networks 工程技术-电信学
CiteScore
10.20
自引率
4.20%
发文量
131
审稿时长
4.8 months
期刊介绍: The Ad Hoc Networks is an international and archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in ad hoc and sensor networking areas. The Ad Hoc Networks considers original, high quality and unpublished contributions addressing all aspects of ad hoc and sensor networks. Specific areas of interest include, but are not limited to: Mobile and Wireless Ad Hoc Networks Sensor Networks Wireless Local and Personal Area Networks Home Networks Ad Hoc Networks of Autonomous Intelligent Systems Novel Architectures for Ad Hoc and Sensor Networks Self-organizing Network Architectures and Protocols Transport Layer Protocols Routing protocols (unicast, multicast, geocast, etc.) Media Access Control Techniques Error Control Schemes Power-Aware, Low-Power and Energy-Efficient Designs Synchronization and Scheduling Issues Mobility Management Mobility-Tolerant Communication Protocols Location Tracking and Location-based Services Resource and Information Management Security and Fault-Tolerance Issues Hardware and Software Platforms, Systems, and Testbeds Experimental and Prototype Results Quality-of-Service Issues Cross-Layer Interactions Scalability Issues Performance Analysis and Simulation of Protocols.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信