一种时间敏感网络调度数据生成的方法和装置
By modeling the 802.1Qbv scheduling problem as a wait-free job shop scheduling problem, and using a parallel insertion and movement method to optimize data stream scheduling, the problem of low scheduling efficiency of 802.1Qbv is solved, and the data transmission efficiency of time-sensitive networks is improved.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- FIBERHOME TELECOMMUNICATION TECHNOLOGIES CO LTD
- Filing Date
- 2023-03-24
- Publication Date
- 2026-07-17
AI Technical Summary
The existing 802.1Qbv has the problem of low scheduling efficiency, which fails to effectively optimize the data transmission efficiency of time-sensitive networks.
The 802.1Qbv scheduling problem is modeled as a wait-free job shop scheduling problem (NW-JSP). By establishing a wait-free job shop scheduling model, the correlation of data streams is calculated and classified into sets of data streams that can be processed in parallel. The optimal scheduling solution is solved iteratively by using a parallel insertion and move method, thereby optimizing the scheduling process of data streams.
It optimizes the scheduling efficiency of 802.1Qbv, improves the transmission efficiency of data streams in time-sensitive networks, and reduces scheduling cycles and resource consumption.
Smart Images
Figure CN116827881B_ABST