A predictable and deterministic scheduling method and device suitable for quasi-dynamic links
A scheduling method and deterministic technology, applied in the field of communication, can solve the problems of dynamic node data loss, affecting the reliability and stability of distributed collaborative systems, etc., and achieve the effect of improving stability and reliability
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0078] Before introducing the present invention, some professional knowledge involved in the present invention will be introduced first.
[0079] TSN is a set of protocol standards proposed by the IEEE802.1 working group in 2012. This protocol cluster defines the transmission mechanism of time-sensitive data on deterministic Ethernet. It mainly includes key protocols such as IEEE 802.1AS (synchronization), IEEE802.1Qav (scheduling), IEEE802.1Qbv (scheduling).
[0080] Quasi-dynamic link:
[0081] The traditional deterministic network link is based on the ground system, the distance between nodes is fixed, and the transmission rate does not change at the same time. When the network nodes are no longer fixed, the distance changes and affects the link rate change, but this change is not random, but can be predicted and perceived. The change of distance can be theoretically described by the corresponding mathematical function. This new link form is referred to herein as a quasi-...
Embodiment 2
[0103] As an optional embodiment of the present invention, the step of S3 includes:
[0104] S31. Obtain the CBS at the last transmission moment;
[0105] S32. Calculate the lower bound of the credit value at the target transmission moment by using a preset calculation formula for the lower bound of the credit value;
[0106] S33. Calculate the upper limit of the credit value at the target transmission moment by using the preset calculation formula of the upper limit of the credit value;
[0107] S34, changing the credit value increase rate of the CBS at the last transmission moment to the value of the first reserved bandwidth at the target transmission moment;
[0108] S35, changing the CBS credit value reduction rate at the last transmission moment to the difference between the transmission rate required at the target transmission moment and the first reserved bandwidth;
[0109] S36. In the CBS at the last transmission moment, change the lower bound of the credit value to...
Embodiment 3
[0122] As an optional embodiment of the present invention, the step of S5 includes:
[0123] S51, for multiple current transmission queues, when the credit value of the frame data sent by the transmission queues is negative, determine the target transmission queues according to the ranks of the transmission queues from high to low;
[0124] S52. When the credit value of the frame data sent by the transmission queue is not negative, determine the transmission queue as the target transmission queue;
[0125] S53, transmit the frame data sent by the target transmission queue at the target transmission time.
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


