.png){kind=icon}
.png){kind=icon}
Return
A time-sensitive network scheduling algorithm based on improved ant colony optimization
.png){kind=icon}
OA
AI
DOI：10.1016/j.aej.2020.06.013.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Cyber-physical system (CPS) is the core technology of Industry 4.0. The deterministic behaviors of the CPS require real-time deterministic guarantee. Therefore, this paper improves the ant colony optimization (ACO) into a scheduling algorithm for time-triggered flows in time-sensitive network (TSN), a standard developed by the IEEE 802.1 Working Group that fully satisfies the strict end-to-end delay requirements of industrial applications. Simulation results show that the improved ACO (IACO) can schedule the time-triggered flows in the TSN excellently, and outperform the traditional ACO in convergence speed, optimization ability and the proneness to local optimum trap. To sum up, this paper provides an effective real-time guarantee for the TSNs. (C) 2020 The Authors. Published by Elsevier B.V. on behalf of Faculty of Engineering, Alexandria University.
Keywords:
Cyber-physical system (CPS)
Time-sensitive network (TSN)
Scheduling algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.8
Papers:
6.3K
Citations:
2.6W