Jul 2026· International Journal of Communication Systems· Vol 39· 0 citations· 45 references
TL;DR
This paper modeled route planning for Audio–Video Bridging (AVB) streams is modeled as a multi‐criteria decision making problem for TSN with mixed criticality support and a K‐shortest paths based heuristic approach is proposed to solve this problem.
Abstract
The effective management of physical processes in cyber physical systems such as in‐vehicle platforms and industrial automation necessitates a deterministic real‐time communication. Although traditional time‐sensitive networks provide low‐delay data transmissions, there is a need for the real‐time variants of IEEE 802.3 Ethernet to satisfy the low‐cost and high‐bandwidth requirements. IEEE 802.1 Time‐Sensitive Networking (TSN) task group is the leading organization that aims to standardize Ethernet‐based deterministic communication technologies. In this paper, route planning for Audio–Video Bridging (AVB) streams is modeled as a multi‐criteria decision making problem for TSN with mixed criticality support and a K‐shortest paths based heuristic approach is proposed to solve this problem. Our heuristic is integrated into metaheuristic approaches relying on Greedy Randomized Adaptive Search Procedure to construct initial solutions, as generating good‐quality initial solutions can improve the performance of a metaheuristic by increasing the convergence speed and accuracy of the solution. Experimental results relying on realistic automotive and Industry 4.0 use cases show that our approach significantly improves the schedulability of AVB streams in presence of time‐triggered traffic and features a better computational efficiency compared with the other approaches in the literature.
The proposed SPN model enables system architects to compare routing configurations, identify performance bottlenecks, and size infrastructure components without requiring physical deployment, and enables the identification of communication bottlenecks without requiring physical deployment.
José Miquéias Araújo, L. Lopes, Luiz Nelson Lima et al.· Journal of Internet Services...· 0 citations
DNSGA-II-ALNS is presented, an epoch-based dynamic multi-objective evolutionary algorithm that couples an event-conditioned warm-start projection with an exact marginal assignment cost, feasibility-aware destroy-and-repair search and NSGA-II selection, and achieves comparable front quality at an order of magnitude less...
Jia-Hao Tian, Min Zou, Zhi-Fei Li et al.· Applied Sciences· 0 citations
Investigating QoS‐aware relay node deployment by incorporating probabilistic link reliability, retransmission‐induced expected delay, and deadline satisfaction into the deployment optimization stage suggests that deployment‐stage QoS optimization is useful for latency‐sensitive WSN applications such as industrial monit...
YongGuk So, KangSa Yun· International Journal of Com...· 0 citations
Results show that topology‐aware cooperative learning can provide a scalable and practical solution for reliable UAV communication in future intelligent aerial and 6G‐enabled networks, particularly in dense deployments.
V. Nam, A. Chehri, Weiwei Jiang et al.· Expert Syst. J. Knowl. Eng.· 0 citations
The proposed Centre of Mass‐Based Sorting algorithm (CMBS) is a cost‐effective solution with the lowest average (S‐C) latency for the controller placement problem in Software‐Defined Networks compared to (PSO and DBCP).
Mili Dhar, Bidyut K. Bhattacharyya· Concurrency and Computation· 0 citations
Recently, in‐network computing has been proposed as a new paradigm to integrate computation and communication at the network edge, enabling data to be processed while being transmitted toward its destination. To achieve this, the problem of joint optimization of computation path selection and workload allocation has ga...
Junyu Mai, Tian Yang, Ouyang Sheng et al.· Concurrency and Computation· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.