Reuse-based online joint routing and scheduling optimization mechanism in deterministic networks

Deterministic networks plan the entire network traffic and calculate the scheduling time to meet the critical traffic requirements of specific domains, enabling real-time and deterministic interaction of massive data. However, in dynamic industrial automation scenarios where devices undergo changes, existing mechanisms face challenges in quickly responding to dynamic transmission demand changes caused by rapid traffic migration. To address this issue, this paper proposes a reuse-based online scheduling mechanism that utilizes dynamic path planning of flows and coordinated scheduling of time slots to achieve deterministic transmission of dynamic flows. In the offline phase, the mechanism proposes a backbone link selection and a scalable intelligent routing strategy, constructs a set of routing and scheduling co-design constraints, and generates an offline scheduling table using an iterative scheduling algorithm. In the online scheduling phase, a reuse based online scheduling algorithm is proposed to achieve rapid scheduling and deterministic transmission of dynamic real-time flows. It utilizes the offline scheduling results and the period offset of migrated flows. The reuse of offline scheduling results reduces computation time and expands the solution space. Experimental results demonstrate that the proposed mechanism achieves a maximum increase in scheduling success rate of 37.3% and reduces time costs by up to 66.6% compared to existing online scheduling algorithms.

Automated summary

This paper proposes a reuse-based online scheduling mechanism that achieves deterministic transmission of dynamic flows through dynamic path planning and coordinated scheduling of time slots. Experimental results show that the proposed mechanism improves the scheduling success rate by 37.3% and reduces time costs by up to 66.6% compared to existing online scheduling algorithms.