*Result*: Deterministic Scheduling for Asymmetric Flows in Future Wireless Networks.
*Further Information*
*In the era of Industry 5.0, future wireless networks are increasingly shifting from traditional symmetric architectures toward heterogeneous and asymmetric paradigms, driven by the demand for diversified and dynamic services. This architectural evolution gives rise to complex and asymmetric flows, such as the coexistence of periodic and burst flows with varying latency, jitter, and deadline constraints, posing new challenges for deterministic transmission. Traditional time-sensitive networking (TSN) is well-suited for periodic flows but lacks the flexibility to effectively handle dynamic, asymmetric traffi. To address this limitation, we propose a two-stage asymmetric flow scheduling framework with dynamic deadline control, termed A-TSN. In the first stage, we design a Deep Q-Network-based Dynamic Injection Time Slot algorithm (DQN-DITS) to optimize slot allocation for periodic flows under varying network loads. In the second stage, we introduce the Dynamic Deadline Online (DDO) scheduling algorithm, which enables real-time scheduling for asymmetric flows while satisfying flow deadlines and capacity constraints. Simulation results demonstrate that our approach significantly reduces end-to-end latency, improves scheduling efficiency, and enhances adaptability to high-volume asymmetric traffic, offering a scalable solution for future deterministic wireless networks. [ABSTRACT FROM AUTHOR]
Copyright of Symmetry (20738994) is the property of MDPI and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)*