Deterministic network dynamic bandwidth reservation method and device
By adopting programmable queues and gated queue mechanisms on the data plane, dynamically adjusting bandwidth reservations, solving the problems of delay, jitter and reliability of Ethernet in deterministic networks, and improving device utilization and configuration flexibility.
Patent Information
- Application Number
- CN202411042408.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-31
- Publication Date
- 2024-11-22
- Estimated Expiration
- 2044-07-31
AI Technical Summary
Existing Ethernet lacks real-time transmission quality assurance mechanism in deterministic networks, making it difficult to achieve deterministic delay, jitter, packet loss rate and reliability, and the bandwidth reservation mechanism cannot be dynamically adjusted in real time, resulting in low equipment utilization and complex configuration. .
By adopting the adjudication and queue mapping mechanism of programmable queues in the data plane, the bandwidth reservation is dynamically adjusted in real time and the gated queues are used for traffic statistics and congestion control, ensuring the delay and jitter requirements of deterministic services.
Real-time adjustment of bandwidth reservation is realized, equipment utilization is improved, deterministic service delay and jitter problems in bursts and congestion scenarios are solved, and bandwidth reservation configuration complexity is avoided when frequent service changes are made.
Smart Images

Figure CN119011502A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of data communication technology, and in particular to a method and device for dynamic bandwidth reservation in a deterministic network. Background Art
[0002] Since its birth in the 1970s, Ethernet has been widely used due to its simple network connection mechanism, ever-increasing bandwidth, scalability and compatibility.
[0003] Traditional Ethernet can only reduce the end-to-end delay to tens of milliseconds. However, many emerging businesses, such as smart driving, Internet of Vehicles, smart transportation, industrial control, smart agriculture, remote surgery, unmanned driving, VR games, smart services, etc., need to control the end-to-end delay to microseconds to milliseconds, the delay jitter to microseconds, and the reliability to more than 99.9999%. Therefore, there is an urgent need to establish a deterministic network that can provide "on-time and accurate" data transmission service quality.
[0004] Deterministic networks are the direction of technology updates and iterations for communications vendors, and have become an important technology upgrade requirement for communications vendors. Existing Ethernet networks lack real-time transmission quality assurance mechanisms, global clock and synchronization mechanisms, bandwidth reservation mechanisms, and packet filtering mechanisms, making it difficult to guarantee deterministic service quality.
[0005] At present, the technical key of deterministic network lies in achieving deterministic delay, jitter, packet loss rate, bandwidth and reliability. Deterministic delay is mainly achieved through clock synchronization, frequency synchronization, scheduling shaping, resource reservation and other mechanisms; deterministic jitter and packet loss rate are achieved through priority division, jitter reduction, buffer absorption and other mechanisms; deterministic bandwidth is achieved through network slicing and edge computing and other technologies; deterministic reliability is achieved through multiplexing, packet replication and elimination, redundant backup and other technologies.
[0006] In order to achieve priority scheduling of deterministic traffic, a resource reservation and admission control mechanism for deterministic business flows is required. The resource reservation mechanism is responsible for path reservation and bandwidth reservation. There are two types of resource reservation mechanisms: distributed and centralized. IEEE 802.1Qat uses a distributed registration and reservation method. Changes in registration requests may overload the network and cause delays in key traffic classes. IEEE 802.1Qcc provides a set of centralized global management and control network tools that can perform resource reservation, scheduling, and other configurations through remote management protocols (such as NETCONF or RESTCONF).
[0007] Whether it is centralized or distributed resource reservation (including bandwidth reservation), it is implemented on the control unit to manage bandwidth reservation before sending services. Once the bandwidth reservation value is determined, it will not be adjusted dynamically in real time. In addition, the existing bandwidth reservation mechanism needs to be configured accordingly for newly added services. The current traffic shaping mechanism cannot guarantee deterministic latency and jitter requirements in burst and congestion scenarios.
[0008] Therefore, based on the above description, it can be known that bandwidth reservation in a deterministic network has the following problems:
[0009] 1. Bandwidth reservation is implemented on the control plane and determined before sending. Once the reserved value is determined, it cannot be adjusted dynamically in real time. This results in large bandwidth waste and low equipment utilization.
[0010] 2. The traffic shaping algorithm lacks a bandwidth protection mechanism for deterministic traffic congestion and burst scenarios, which affects the deterministic service delay of subsequent services.
[0011] 3. The traffic shaping algorithm requires the reserved bandwidth ratio to be configured in advance. In application scenarios with frequent business changes, the configuration is complex and has poor flexibility. Summary of the invention
[0012] The present application provides a deterministic network dynamic bandwidth reservation method and device, which can dynamically adjust bandwidth reservation in real time through a decision and queue mapping mechanism of a programmable queue on a data plane without the need for control plane configuration.
[0013] In a first aspect, an embodiment of the present application provides a deterministic network dynamic bandwidth reservation method, the deterministic network dynamic bandwidth reservation method comprising the following steps:
[0014] Receiving the deterministic service features and gating list issued according to the configuration on the forwarding plane;
[0015] Differentiate the service type of the received data packet according to the deterministic service characteristics, the service type includes deterministic service and non-deterministic service, make a queue entry decision according to the traffic statistics and the current bandwidth reservation value, and judge whether the data packet can enter the programmable queue of the corresponding service type;
[0016] Map the data packets in the programmable queue to the gated queue. The gated queue performs periodic forwarding according to the gated list, performs traffic statistics for deterministic services and non-deterministic services, and calculates the service bandwidth usage ratio of the corresponding service type;
[0017] When the gated forwarding cycle ends, if the bandwidth reservation value needs to be adjusted, the bandwidth reservation value for the next cycle is determined based on the corresponding service bandwidth usage ratio and the current bandwidth reservation value.
[0018] In combination with the first aspect, in one implementation, performing queue entry decision according to traffic statistics and the current bandwidth reservation value to determine whether a data packet can enter a programmable queue of a corresponding service type includes:
[0019] Calculate whether the corresponding service type has sufficient queue length based on traffic statistics and current bandwidth reservation value to determine whether the data packet can enter the programmable queue of the corresponding service type;
[0020] If the deterministic service data packet meets the queue entry conditions, it will enter the deterministic service programmable queue cache in the order of the time when the deterministic service data packet arrives;
[0021] If the deterministic service data packet does not meet the queue entry condition, it will enter the non-deterministic service programmable queue cache, and the deterministic service data packet will be prioritized in the non-deterministic programmable queue;
[0022] If the non-deterministic service data packets meet the queue entry conditions, they will enter the non-deterministic programmable queue cache in the order of their arrival time;
[0023] If the non-deterministic data packet does not meet the enqueue decision conditions, the data packet is discarded.
[0024] In combination with the first aspect, in one implementation, the calculating whether the corresponding service type has sufficient queue length according to traffic statistics and the current bandwidth reservation value to determine whether the data packet can enter the programmable queue of the corresponding service type includes:
[0025] According to the formula: remaining queue length = current bandwidth reservation value * (gating list cycle end time - current message receiving time), determine the remaining queue length;
[0026] If the remaining queue length - current data packet length - programmable queue cache length ≥ 0, it means that the queue can be entered, otherwise it cannot be entered.
[0027] In combination with the first aspect, in one implementation, mapping the data packets in the programmable queue to the gated queue includes:
[0028] Mapping the priority of the deterministic service data packet with the priority of the gated queue, and mapping the non-deterministic service data packet to the lowest priority in the gated queue;
[0029] The maximum queue length of the priority of the deterministic service in the gated queue is calculated according to the gated list and the current bandwidth reservation value, and the congestion of the queue of the corresponding priority in the gated queue is judged according to the maximum queue length;
[0030] If no congestion occurs, the deterministic service data packets are dequeued from the programmable queue and enter the gated queue according to the priority;
[0031] If congestion occurs, the deterministic service data packets are placed in the queue that can be sent later in the gated state and filled in accordance with the principle of high to low priority.
[0032] In combination with the first aspect, in one implementation, the calculating the maximum queue length of the priority of the deterministic service corresponding to the gated queue according to the gating list and the current bandwidth reservation value, and performing congestion judgment on the queue of the corresponding priority in the gated queue according to the maximum queue length, includes:
[0033] According to the sending status of the gated queue and the message receiving time, calculate the remaining sending time T of the queue in this cycle p1 ;
[0034] According to the formula: MAX_QL p1 =BW st *T p1 , calculate the maximum queue length MAX_QL p1 ;
[0035] According to the gating list, find the target queue that overlaps with the current priority queue, determine the target queue cache, and calculate the target queue cache according to MAX_QL. p1 , current priority queue cache, target queue cache and current packet length to determine whether congestion occurs.
[0036] In combination with the first aspect, in one implementation, the service bandwidth usage ratio is calculated according to the formula: service bandwidth usage ratio = sent packet length in the period / current bandwidth reservation value * sending time length in the priority queue period;
[0037] The current bandwidth reservation value is a set initial value in the first cycle, and is a bandwidth reservation value of the previous cycle starting from the second cycle.
[0038] In combination with the first aspect, in one implementation, the bandwidth reservation value for the next period is calculated according to the formula: bandwidth reservation value=service bandwidth usage ratio*(1+1 / 2)*current bandwidth reservation value.
[0039] In a second aspect, an embodiment of the present application provides a deterministic network dynamic bandwidth reservation device, the deterministic network dynamic bandwidth reservation device comprising:
[0040] A receiving module, which is used to receive the deterministic service characteristics and gating list issued according to the configuration on the forwarding plane;
[0041] A decision module, which distinguishes the service type of the received data packet according to the deterministic service characteristics, the service type includes deterministic service and non-deterministic service, and makes a queue entry decision according to the traffic statistics and the current bandwidth reservation value to determine whether the data packet can enter the programmable queue of the corresponding service type;
[0042] A control module is used to map data packets in the programmable queue to the gated queue. The gated queue performs periodic forwarding according to the gated list, performs traffic statistics for deterministic services and non-deterministic services, and calculates the service bandwidth usage ratio of the corresponding service type;
[0043] The bandwidth reservation module is used to: when the gated forwarding cycle ends, if the bandwidth reservation value needs to be adjusted, determine the bandwidth reservation value of the next cycle according to the corresponding service bandwidth usage ratio and the current bandwidth reservation value.
[0044] In combination with the second aspect, in one implementation, the decision module performs a queue entry decision based on traffic statistics and a current bandwidth reservation value to determine whether a data packet can enter a programmable queue of a corresponding service type, including:
[0045] Calculate whether the corresponding service type has sufficient queue length based on traffic statistics and current bandwidth reservation value to determine whether the data packet can enter the programmable queue of the corresponding service type;
[0046] If the deterministic service data packet meets the queue entry conditions, it will enter the deterministic service programmable queue cache in the order of the time when the deterministic service data packet arrives;
[0047] If the deterministic service data packet does not meet the queue entry condition, it will enter the non-deterministic service programmable queue cache, and the deterministic service data packet will be prioritized in the non-deterministic programmable queue;
[0048] If the non-deterministic service data packets meet the queue entry conditions, they will enter the non-deterministic programmable queue cache in the order of their arrival time;
[0049] If the non-deterministic data packet does not meet the enqueue decision conditions, the data packet is discarded.
[0050] In conjunction with the second aspect, in one implementation, the control module maps data packets in the programmable queue to the gated queue, including:
[0051] Mapping the priority of the deterministic service data packet with the priority of the gated queue, and mapping the non-deterministic service data packet to the lowest priority in the gated queue;
[0052] The maximum queue length of the priority of the deterministic service in the gated queue is calculated according to the gated list and the current bandwidth reservation value, and the congestion of the queue of the corresponding priority in the gated queue is judged according to the maximum queue length;
[0053] If no congestion occurs, the deterministic service data packets are dequeued from the programmable queue and enter the gated queue according to the priority;
[0054] If congestion occurs, the deterministic service data packets are placed in the queue that can be sent later in the gated state and filled in accordance with the principle of high to low priority.
[0055] The beneficial effects brought by the technical solution provided by the embodiment of the present application include at least:
[0056] The deterministic network dynamic bandwidth reservation method in this application utilizes the device forwarding plane to dynamically implement bandwidth reservation based on the gating cycle, ensures the real-time bandwidth adjustment, and improves the device utilization rate. The programmable queue is used to make a queue entry decision before the data packet enters the queue to ensure bandwidth protection in burst scenarios. The gated queue mapping and congestion control are used to ensure the delay and jitter of deterministic services in congested scenarios. The deterministic service bandwidth reservation is dynamically adjusted using real-time bandwidth statistics. The control plane configuration of the bandwidth reservation value can be avoided in the case of frequent service changes.
[0057] Compared with the existing deterministic network bandwidth reservation technology, the dynamic traffic bandwidth calculation solves the bandwidth reservation configuration requirements when deterministic services frequently change. By implementing bandwidth reservation based on the gating cycle in the forwarding plane, the real-time bandwidth reservation is met and the equipment utilization rate is improved.
[0058] Compared with the existing deterministic network gated time slot forwarding technology, by adding queue entry arbitration and queue mapping congestion control, the delay and jitter guarantee of deterministic services in congestion and burst scenarios is solved. BRIEF DESCRIPTION OF THE DRAWINGS
[0059] Figure 1 This is a flow chart of an embodiment of a method for dynamic bandwidth reservation in a deterministic network according to the present application;
[0060] Figure 2 This is the architecture diagram of the deterministic network dynamic bandwidth reservation method of this application;
[0061] Figure 3 This is the process flow chart for the decision on joining the team;
[0062] Figure 4 This is the queue mapping and congestion control flow chart for this application;
[0063] Figure 5 This is the flow chart of traffic statistics for this application;
[0064] Figure 6 The bandwidth reservation calculation flow chart for this application;
[0065] Figure 7 This is a schematic diagram of the bandwidth reservation table for this application;
[0066] Figure 8 This is a structural block diagram of an embodiment of a deterministic network dynamic bandwidth reservation device of the present application. DETAILED DESCRIPTION
[0067] In order to enable those skilled in the art to better understand the solution of the present application, the technical solution in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.
[0068] The terms "including" and "having" and any variations thereof in the specification and claims of this application and the above-mentioned drawings are intended to cover non-exclusive inclusions. For example, a process, method, system, product or device that includes a series of steps or units is not limited to the listed steps or units, but optionally includes steps or units that are not listed, or optionally includes other steps or units inherent to these processes, methods, products or devices. The terms "first", "second" and "third" are used to distinguish different objects, etc., and do not represent a sequence, nor do they limit "first", "second" and "third" to different types.
[0069] In the description of the embodiments of the present application, "exemplary", "for example" or "for example" are used to indicate examples, illustrations or descriptions. Any embodiment or design described as "exemplary", "for example" or "for example" in the embodiments of the present application should not be interpreted as being more preferred or more advantageous than other embodiments or designs. Specifically, the use of words such as "exemplary", "for example" or "for example" is intended to present related concepts in a specific way.
[0070] In the description of the embodiments of the present application, unless otherwise specified, “ / ” means or, for example, A / B can mean A or B; the “and / or” in the text is merely a description of the association relationship of associated objects, indicating that three relationships may exist, for example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone. In addition, in the description of the embodiments of the present application, “multiple” refers to two or more than two.
[0071] In some processes described in the embodiments of the present application, multiple operations or steps that appear in a specific order are included, but it should be understood that these operations or steps may not be executed in the order in which they appear in the embodiments of the present application or in parallel, and the sequence number of the operation is only used to distinguish the different operations, and the sequence number itself does not represent any execution order. In addition, these processes may include more or fewer operations, and these operations or steps may be executed in sequence or in parallel, and these operations or steps may be combined.
[0072] In order to make the objectives, technical solutions and advantages of the present application clearer, the implementation methods of the present application will be further described in detail below with reference to the accompanying drawings.
[0073] It is worth noting that in the process of deterministic network service transmission, in addition to jitter delay control, bandwidth reservation is also very important. The existing bandwidth reservation mechanism is mainly implemented on the control plane, which requires bandwidth reservation configuration or complex protocol configuration for the service. In addition, the configured or calculated bandwidth reservation value will not be adjusted dynamically in real time. If the bandwidth reservation is too large, the bandwidth will be wasted and the equipment utilization rate will be low. If the bandwidth reservation is too small, congestion will occur, which will affect the latency and jitter requirements of subsequent deterministic services.
[0074] Considering the real-time and flexibility of the programmable queue of the forwarding plane, the present application classifies packets before the traffic shaping of the device forwarding plane, and distinguishes the packets for deterministic services and non-deterministic services. And according to the bandwidth reservation value of the previous cycle, the queue entry decision is made, and the successful decision enters the programmable queue of the corresponding service type. When the data packet is dequeued from the programmable queue, the queue mapping and congestion control calculation are performed according to the bandwidth reservation value of the previous cycle, and the data packet is mapped to the corresponding gated queue according to the rules, and forwarded evenly within the cycle according to the gated queue status list. After the data packet is forwarded from the gated queue, the traffic statistics are performed according to the service type in the gated cycle, and the bandwidth ratio of the sent traffic in the gated cycle is calculated, and the value is written into the bandwidth reservation table item. At the end of the gated cycle, based on the result of the comparison between the bandwidth ratio of the sent traffic bandwidth in the cycle and the set threshold, the bandwidth reservation value of each service is adjusted and calculated, and written into the bandwidth reservation table item. The bandwidth reservation value in the bandwidth reservation table item is used as the basis for the queue entry decision, queue mapping and congestion control when the next data packet enters the queue.
[0075] Based on this, in a first aspect, an embodiment of the present application provides a deterministic network dynamic bandwidth reservation method.
[0076] In one embodiment, referring to Figure 1 , Figure 1 This is a flow chart of an embodiment of a method for dynamic bandwidth reservation in a deterministic network according to the present application. Figure 1 As shown, the deterministic network dynamic bandwidth reservation method includes:
[0077] S1. Receive the deterministic service features and gating list issued according to the configuration on the forwarding plane;
[0078] Specifically, the control plane (control unit) will send the deterministic service features and gating list according to the configuration, and then the forwarding plane (forwarding unit) will receive the deterministic service features and gating list.
[0079] S2. Distinguish the service type of the received data packet according to the deterministic service characteristics, wherein the service type includes deterministic services and non-deterministic services, and make a queue entry decision according to the traffic statistics and the current bandwidth reservation value to determine whether the data packet can enter the programmable queue of the corresponding service type;
[0080] Specifically, in step S2, a queue entry decision is made based on traffic statistics and the current bandwidth reservation value to determine whether the data packet can enter the programmable queue of the corresponding service type, including:
[0081] Calculate whether the corresponding service type has sufficient queue length based on traffic statistics and current bandwidth reservation value to determine whether the data packet can enter the programmable queue of the corresponding service type;
[0082] If the deterministic service data packet meets the queue entry conditions, it will enter the deterministic service programmable queue cache in the order of the time when the deterministic service data packet arrives;
[0083] If the deterministic service data packet does not meet the queue entry condition, it will enter the non-deterministic service programmable queue cache, and the deterministic service data packet will be prioritized in the non-deterministic programmable queue;
[0084] If the non-deterministic service data packets meet the queue entry conditions, they will enter the non-deterministic programmable queue cache in the order of their arrival time;
[0085] If the non-deterministic data packet does not meet the enqueue decision conditions, the data packet is discarded.
[0086] In this embodiment, the following method can be used to determine whether a deterministic service data packet and a non-deterministic service data packet can be queued.
[0087] According to the formula: remaining queue length = current bandwidth reservation value * (gating list cycle end time - current message receiving time), determine the remaining queue length;
[0088] If the remaining queue length - current data packet length - programmable queue cache length ≥ 0, it means that the queue can be entered, otherwise it cannot be entered.
[0089] S3, mapping the data packets in the programmable queue to the gated queue, the gated queue performs periodic forwarding according to the gated list, performs traffic statistics according to the deterministic service and the non-deterministic service, and calculates the service bandwidth usage ratio of the corresponding service type;
[0090] In this embodiment, the data packets in the programmable queue are mapped to the gated queue, and the mapping mechanism and congestion situation need to be considered.
[0091] Specifically, it includes the following steps:
[0092] Mapping the priority of the deterministic service data packet with the priority of the gated queue, and mapping the non-deterministic service data packet to the lowest priority in the gated queue;
[0093] The maximum queue length of the priority of the deterministic service in the gated queue is calculated according to the gated list and the current bandwidth reservation value, and the congestion of the queue of the corresponding priority in the gated queue is judged according to the maximum queue length;
[0094] If no congestion occurs, the deterministic service data packets are dequeued from the programmable queue and enter the gated queue according to the priority;
[0095] If congestion occurs, the deterministic service data packets are placed in the queue that can be sent later in the gated state and filled in accordance with the principle of high to low priority.
[0096] It is worth noting that the maximum queue length of the priority of the deterministic service in the gated queue is calculated according to the gated list and the current bandwidth reservation value, and the congestion judgment of the queue of the corresponding priority in the gated queue is performed according to the maximum queue length, including:
[0097] According to the sending status of the gated queue and the message receiving time, calculate the remaining sending time T of the queue in this cycle p1 ;
[0098] According to the formula: MAX_QL p1 =BW st *T p1 , calculate the maximum queue length MAX_QL p1 ;
[0099] According to the gating list, find the target queue that overlaps with the current priority queue, determine the target queue cache, and calculate the target queue cache according to MAX_QL. p1 , current priority queue cache, target queue cache and current packet length to determine whether congestion occurs.
[0100] After the gated queue performs periodic forwarding according to the gated list, traffic statistics are collected for deterministic services and non-deterministic services. The bandwidth usage ratio of both deterministic and non-deterministic services can be calculated using the following method:
[0101] The service bandwidth usage ratio is calculated according to the formula: service bandwidth usage ratio = length of packets sent in a period / current bandwidth reservation value * sending time of the priority queue in a period;
[0102] The current bandwidth reservation value is a set initial value in the first cycle, and is a bandwidth reservation value of the previous cycle starting from the second cycle.
[0103] S4. When the gated forwarding cycle ends, if the bandwidth reservation value needs to be adjusted, the bandwidth reservation value for the next cycle is determined according to the corresponding service bandwidth usage ratio and the current bandwidth reservation value.
[0104] In this embodiment, if the bandwidth reservation value needs to be adjusted, then:
[0105] The bandwidth reservation value for the next period is calculated according to the formula: bandwidth reservation value = service bandwidth usage ratio * (1 + 1 / 2) * current bandwidth reservation value.
[0106] The above steps are further explained below in combination with the principles:
[0107] See also Figure 2 As shown, it is an architecture diagram of the deterministic network dynamic bandwidth reservation method of the present application, which is mainly applicable to programmable network transmission equipment, and implements periodic dynamic adjustment of the bandwidth reservation value in the forwarding unit of the programmable equipment.
[0108] In this method, the forwarding unit mainly implements the receiving control unit to issue deterministic service configuration; when receiving a data packet, the service message is enqueued according to the traffic statistics and bandwidth reservation; the service message is gated queue mapped and congestion control calculated according to the traffic statistics and bandwidth reservation; after the data packet is sent, the traffic statistics and bandwidth reservation are adjusted according to the gated list status.
[0109] The main processing flow of each module of the forwarding unit is as follows:
[0110] 1. Receive the deterministic service features and gating list sent by the control unit according to the configuration.
[0111] 2. After receiving the data packet, it enters the decision module to distinguish between deterministic services and non-deterministic services based on service characteristics; then, based on the result of bandwidth reservation, it determines whether it can enter the programmable queue with the corresponding service characteristics.
[0112] 3. In the programmable queue, deterministic services use the arrival time of data packets as the rank, sort the data packets in the order of arrival and dequeue them. Non-deterministic services use the arrival time and priority of data packets as the rank, ensuring that congested deterministic services are prioritized in the queue.
[0113] 4. The data packet enters the queue mapping and congestion control module and is mapped to different priorities of the gated queue according to the deterministic service configuration. During the process, congestion and burst scenarios need to be considered.
[0114] 5. The gated queue forwards messages periodically based on the gated list.
[0115] 6. After the data packet is forwarded, traffic statistics are performed and bandwidth reservation entries are maintained.
[0116] 7. When the gated queue period ends, the bandwidth reservation result is calculated based on the traffic statistics.
[0117] To this end, the specific processing flow is as follows:
[0118] Step S1: The control unit sends the deterministic service features and gating list according to the deterministic service configuration
[0119] The control unit sends deterministic service features and gating lists according to the deterministic service configuration, the forwarding unit receives and stores the table entries, and subsequently performs service differentiation and deterministic traffic shaping according to the content of the table entries.
[0120] Step S2: Packet Enqueue Decision
[0121] Deterministic services and non-deterministic services are distinguished according to service characteristics, and then based on the result of bandwidth reservation in the previous cycle, it is determined whether the service can be included in the programmable queue with the corresponding service characteristics.
[0122] In step S2, the packet is queued for adjudication, see Figure 3 This is the process flow chart for team entry, and the specific processing flow is as follows:
[0123] Step S201: The forwarding unit receives a data packet.
[0124] Step S202: According to the deterministic service feature table items issued by the control unit, distinguish between deterministic services and non-deterministic services. If the service is a deterministic service, the length of the data packet that can be queued needs to be calculated according to the bandwidth reservation value. The calculation method is as follows:
[0125] Remaining queue length = bandwidth reservation value * (gated list cycle end time - current message reception time);
[0126] The packet enqueuing behavior is then decided based on the enqueuable length. The decision is based on the following:
[0127] If the remaining queue length minus the current data packet length minus the programmable queue buffer length is greater than or equal to 0, it indicates that the queue can be entered; otherwise, the queue entry condition is not met.
[0128] Step S203: Differentiate between deterministic services and non-deterministic services according to the deterministic service feature table items issued by the control unit. If the service is a deterministic service, the length of the data packet that can be queued needs to be calculated according to the bandwidth reservation value, and the calculation method is the same as S202.
[0129] Step S204: If the deterministic service data packet meets the queue entry condition, the data packet enters the deterministic service programmable queue cache.
[0130] Step S205: If the deterministic service data packet does not meet the queue entry conditions, it needs to enter the non-deterministic service programmable queue cache. And set its entry rank in the programmable queue to be lower than the priority of the non-deterministic service message, to ensure that the deterministic message is prioritized in the non-deterministic programmable queue; if the non-deterministic service data packet meets the queue entry conditions, it will enter the non-deterministic programmable queue in sequence according to the order of the time when the data packet arrives.
[0131] Step S206: If the non-deterministic data packet does not meet the queue determination condition, the data packet is discarded.
[0132] Step S3: Programmable Queue Buffer
[0133] In the programmable queue, deterministic services use the arrival time of data packets as the rank, sort the data packets in the order of arrival and dequeue them. Non-deterministic services use the arrival time and priority of data packets as the rank, ensuring that deterministic services that do not meet the entry conditions are given priority in the queue.
[0134] Step S4: Queue mapping and congestion control
[0135] When data packets enter the control module, they are mapped to different priorities of the gated queue according to the deterministic service configuration. During this process, congestion and burst scenarios need to be considered.
[0136] In step S4, queue mapping and congestion control are performed, see Figure 4 This is a flowchart of queue mapping and congestion control. The specific processing flow is as follows:
[0137] Step S401: Data packets in the programmable queue that meet the dequeue conditions are dequeued in sequence.
[0138] Step S402: According to the deterministic service feature table item sent by the control plane, distinguish whether the service message is a deterministic service or a non-deterministic service. If it is a deterministic service, map the priority of the deterministic service message with the priority of the gated queue.
[0139] Step S403: According to the deterministic service feature table item sent by the control plane, distinguish whether the service message is a deterministic service or a non-deterministic service. If it is a non-deterministic service, map the message to the lowest priority 0 in the gated queue.
[0140] Step S404: Calculate the priority queue length of the corresponding deterministic service in the gated queue according to the gated status list and the bandwidth reservation value. First, calculate the remaining sendable time T of the queue in this cycle according to the gated queue sending status and message receiving time. p1 Available bandwidth reserved value BW st , calculate the maximum queue length MAX_QL p1 =BW st *T p1 .
[0141] Then, based on the maximum queue length, the congestion of the queue of the corresponding priority in the gated queue is judged based on:
[0142] According to the maximum queue length MAX_QL above p1 and the queue buffer length QBL p1 , to determine whether congestion occurs. Because gating can send to multiple queues, it is necessary to find other queues p2, p3, etc. that overlap with the current priority queue according to the gating list, and the corresponding queue cache QBL p2 and QBL p3 .
[0143] MAX_QL p1 -QBL p1 -QBL p2 -QBL p3 -packet.length<0 indicates congestion, otherwise there is no congestion.
[0144] Step S405: The data packet is dequeued from the programmable queue and is entered into the access control queue according to the principle of one-to-one correspondence of priorities when no congestion occurs.
[0145] Step S406: When congestion occurs, the queue entry rules are adjusted to put the message into the queue that can be sent later in the gated state, and fill it according to the principle of high priority to low priority. For example, when the queue with priority 7 is sent congested, the subsequent sending queues in the gated state forwarding table are 4, 5, and 2 in the cycle, then the messages that cannot be sent in queue 7 can be mapped to queues 5, 4, and 2 in sequence.
[0146] Step S5: Gate queue cache and forward according to gate list
[0147] The gating-based queue scheduling and traffic shaping algorithm can meet the latency and jitter requirements of deterministic services.
[0148] Step S6: Traffic statistics
[0149] After the data packets are forwarded, traffic statistics are collected and bandwidth reservation entries are maintained.
[0150] In step S6, traffic statistics are calculated, see Figure 5 This is a flow chart of traffic statistics. The specific processing flow is as follows:
[0151] Step S601: After a data packet is sent from a gated queue, traffic statistics are performed for deterministic services and non-deterministic services according to the configured deterministic service characteristics.
[0152] Step S602: If it is a deterministic service, the sent packet length field in the period of the deterministic service entry in the bandwidth reservation table is updated.
[0153] Step S603: If it is a non-deterministic service, the sent packet length field in the period of the non-deterministic service entry in the bandwidth reservation table is updated.
[0154] Step S604: Calculate the bandwidth usage ratio of the deterministic service in this period according to the length of the packets sent in the deterministic service period, and record it in the bandwidth usage ratio of the deterministic service entry period in the bandwidth reservation table.
[0155] Step S605: Calculate the bandwidth usage ratio of the non-deterministic service in this period according to the packet length sent in the non-deterministic service period, and record it in the bandwidth usage ratio of the non-deterministic service entry in the bandwidth reservation table.
[0156] Step S7: Bandwidth reservation
[0157] When the gated queue period ends, the bandwidth reservation result is calculated based on the traffic statistics result, and the bandwidth reservation entry is recorded.
[0158] In step S7, bandwidth reservation is calculated, see Figure 6 This is a bandwidth reservation calculation flow chart. The specific processing flow is as follows:
[0159] Step S701: The gated queue performs periodic forwarding according to the gated status list. If the cycle is not over, the gated switch is controlled to forward according to the gated status list. The first cycle is to ensure deterministic services, and the deterministic service bandwidth reservation ratio is recorded as 100%.
[0160] Step S702: If the gated forwarding period ends, the bandwidth reservation value is calculated according to the set bandwidth usage percentage threshold and recorded in the bandwidth reservation table. The calculation method is as follows:
[0161] Set the upper and lower limits of the service bandwidth usage ratio, l and h. When l≥service bandwidth usage ratio≥h, there is no need to adjust the bandwidth reservation value. Otherwise, adjustment is required. The adjustment rules are as follows:
[0162] Bandwidth reservation ratio = service bandwidth usage ratio * (1 + 1 / 2) * bandwidth reservation ratio of the previous period
[0163] Step S703: Clear the traffic statistics in the bandwidth reservation table in this period, retain the bandwidth reservation value, and enter the next gating period.
[0164] See also Figure 7 The bandwidth reservation table entry used in the present invention is defined, and the fields are described as follows:
[0165] (1) Service characteristics: Based on deterministic service configuration, service messages are divided into two categories: deterministic and non-deterministic.
[0166] (2) Gate cycle start time: used as the basis for calculating the cycle end time.
[0167] (3) Gated service state duration: According to the gating list, the deterministic and non-deterministic services are calculated separately. This serves as the basis for calculating the remaining queue length within the period.
[0168] (4) Length of packets sent within a period: For each packet sent within a period, traffic statistics are collected based on the service characteristics.
[0169] (5) Business bandwidth usage percentage: The percentage of received traffic for the corresponding business in the current period is calculated based on the received traffic in the period, the bandwidth reservation value in the previous period, and the gating duration.
[0170] (6) Bandwidth reservation ratio: The bandwidth reservation value within the recording period is dynamically adjusted according to the threshold each period.
[0171] In summary, the dynamic bandwidth reservation method for deterministic networks in this application utilizes the device forwarding plane to dynamically implement bandwidth reservation based on the gating cycle, ensures the real-time bandwidth adjustment, and improves device utilization. A programmable queue is used to make a queue entry decision before the data packet enters the queue to ensure bandwidth protection in burst scenarios. Gated queue mapping and congestion control are used to ensure the delay and jitter of deterministic services in congested scenarios. Real-time bandwidth statistics are used to dynamically adjust the bandwidth reservation for deterministic services. The configuration of the bandwidth reservation value of the control plane can be avoided in the case of frequent service changes.
[0172] Compared with the existing deterministic network bandwidth reservation technology, the dynamic traffic bandwidth calculation solves the bandwidth reservation configuration requirements when deterministic services frequently change. By implementing bandwidth reservation based on the gating cycle in the forwarding plane, the real-time bandwidth reservation is met and the equipment utilization rate is improved.
[0173] Compared with the existing deterministic network gated time slot forwarding technology, by adding queue entry arbitration and queue mapping congestion control, the delay and jitter guarantee of deterministic services in congestion and burst scenarios is solved.
[0174] In a second aspect, an embodiment of the present application also provides a deterministic network dynamic bandwidth reservation device.
[0175] In one embodiment, referring to Figure 8 , Figure 8 Schematic diagram of functional modules of an embodiment of a deterministic network dynamic bandwidth reservation device. Figure 8 As shown, the deterministic network dynamic bandwidth reservation device includes a control unit and a forwarding unit.
[0176] The control unit is used for determining the service characteristics and the gating list issued according to the configuration, and the forwarding unit includes a receiving module, a decision module, a control module and a bandwidth reservation module.
[0177] Among them, a receiving module is used to receive the deterministic service characteristics and gating list issued according to the configuration on the forwarding plane;
[0178] A decision module, which distinguishes the service type of the received data packet according to the deterministic service characteristics, the service type includes deterministic service and non-deterministic service, and makes a queue entry decision according to the traffic statistics and the current bandwidth reservation value to determine whether the data packet can enter the programmable queue of the corresponding service type;
[0179] A control module is used to map data packets in the programmable queue to the gated queue. The gated queue performs periodic forwarding according to the gated list, performs traffic statistics for deterministic services and non-deterministic services, and calculates the service bandwidth usage ratio of the corresponding service type;
[0180] The bandwidth reservation module is used to: when the gated forwarding cycle ends, if the bandwidth reservation value needs to be adjusted, determine the bandwidth reservation value of the next cycle according to the corresponding service bandwidth usage ratio and the current bandwidth reservation value.
[0181] Further, in one embodiment, the decision module performs queue entry decision based on traffic statistics and the current bandwidth reservation value to determine whether the data packet can enter the programmable queue of the corresponding service type, including:
[0182] Calculate whether the corresponding service type has sufficient queue length based on traffic statistics and current bandwidth reservation value to determine whether the data packet can enter the programmable queue of the corresponding service type;
[0183] If the deterministic service data packet meets the queue entry conditions, it will enter the deterministic service programmable queue cache in the order of the time when the deterministic service data packet arrives;
[0184] If the deterministic service data packet does not meet the queue entry condition, it will enter the non-deterministic service programmable queue cache, and the deterministic service data packet will be prioritized in the non-deterministic programmable queue;
[0185] If the non-deterministic service data packets meet the queue entry conditions, they will enter the non-deterministic programmable queue cache in the order of their arrival time;
[0186] If the non-deterministic data packet does not meet the enqueue decision conditions, the data packet is discarded.
[0187] Further, in one embodiment, the decision module calculates whether the corresponding service type has sufficient queue length according to traffic statistics and the current bandwidth reservation value to determine whether the data packet can enter the programmable queue of the corresponding service type, including:
[0188] According to the formula: remaining queue length = current bandwidth reservation value * (gating list cycle end time - current message receiving time), determine the remaining queue length;
[0189] If the remaining queue length - current data packet length - programmable queue cache length ≥ 0, it means that the queue can be entered, otherwise it cannot be entered.
[0190] Further, in one embodiment, the control module maps the data packets in the programmable queue to the gated queue, including:
[0191] Mapping the priority of the deterministic service data packet with the priority of the gated queue, and mapping the non-deterministic service data packet to the lowest priority in the gated queue;
[0192] The maximum queue length of the priority of the deterministic service in the gated queue is calculated according to the gated list and the current bandwidth reservation value, and the congestion of the queue of the corresponding priority in the gated queue is judged according to the maximum queue length;
[0193] If no congestion occurs, the deterministic service data packets are dequeued from the programmable queue and enter the gated queue according to the priority;
[0194] If congestion occurs, the deterministic service data packets are placed in the queue that can be sent later in the gated state and filled in accordance with the principle of high to low priority.
[0195] Further, in one embodiment, the control module calculates the maximum queue length of the priority of the corresponding deterministic service in the gated queue according to the gating list and the current bandwidth reservation value, and performs congestion judgment on the queue of the corresponding priority in the gated queue according to the maximum queue length, including:
[0196] According to the sending status of the gated queue and the message receiving time, calculate the remaining sending time T of the queue in this cyclep1 ;
[0197] According to the formula: MAX_QL p1 =BW st *T p1 , calculate the maximum queue length MAX_QL p1 ;
[0198] According to the gating list, find the target queue that overlaps with the current priority queue, determine the target queue cache, and calculate the target queue cache according to MAX_QL. p1 , current priority queue cache, target queue cache and current packet length to determine whether congestion occurs.
[0199] Furthermore, in one embodiment, the control module is used to:
[0200] The service bandwidth usage ratio is calculated according to the formula: service bandwidth usage ratio = length of packets sent in a period / current bandwidth reservation value * sending time of the priority queue in a period;
[0201] The current bandwidth reservation value is a set initial value in the first cycle, and is a bandwidth reservation value of the previous cycle starting from the second cycle.
[0202] Furthermore, in one embodiment, the bandwidth reservation module is used to:
[0203] The bandwidth reservation value for the next period is calculated according to the formula: bandwidth reservation value = service bandwidth usage ratio * (1 + 1 / 2) * current bandwidth reservation value.
[0204] Among them, the functional implementation of each module in the above-mentioned deterministic network dynamic bandwidth reservation device corresponds to each step in the above-mentioned deterministic network dynamic bandwidth reservation method embodiment, and its functions and implementation processes are no longer repeated here one by one.
[0205] The above are only preferred embodiments of the present application, and are not intended to limit the patent scope of the present application. Any equivalent structure or equivalent process transformation made using the contents of the present application specification and drawings, or directly or indirectly applied in other related technical fields, are also included in the patent protection scope of the present application.
Claims
1. A deterministic network dynamic bandwidth reservation method, characterized in that: The deterministic network dynamic bandwidth reservation method comprises the following steps: Receiving the deterministic service features and gating list issued according to the configuration on the forwarding plane; Differentiate the service type of the received data packet according to the deterministic service characteristics, the service type includes deterministic service and non-deterministic service, make a queue entry decision according to the traffic statistics and the current bandwidth reservation value, and judge whether the data packet can enter the programmable queue of the corresponding service type; Map the data packets in the programmable queue to the gated queue. The gated queue performs periodic forwarding according to the gated list, performs traffic statistics for deterministic services and non-deterministic services, and calculates the service bandwidth usage ratio of the corresponding service type; When the gated forwarding cycle ends, if the bandwidth reservation value needs to be adjusted, the bandwidth reservation value for the next cycle is determined based on the corresponding service bandwidth usage ratio and the current bandwidth reservation value.
2. The deterministic network dynamic bandwidth reservation method according to claim 1, characterized in that: The step of making a queue entry decision based on traffic statistics and the current bandwidth reservation value to determine whether the data packet can enter the programmable queue of the corresponding service type includes: Calculate whether the corresponding service type has sufficient queue length based on traffic statistics and current bandwidth reservation value to determine whether the data packet can enter the programmable queue of the corresponding service type; If the deterministic service data packet meets the queue entry conditions, it will enter the deterministic service programmable queue cache in the order of the time when the deterministic service data packet arrives; If the deterministic service data packet does not meet the queue entry condition, it will enter the non-deterministic service programmable queue cache, and the deterministic service data packet will be prioritized in the non-deterministic programmable queue; If the non-deterministic service data packets meet the queue entry conditions, they will enter the non-deterministic programmable queue cache in the order of their arrival time; If the non-deterministic data packet does not meet the enqueue decision conditions, the data packet is discarded.
3. The deterministic network dynamic bandwidth reservation method according to claim 2, characterized in that: The step of calculating whether the corresponding service type has sufficient queue length according to traffic statistics and the current bandwidth reservation value to determine whether the data packet can enter the programmable queue of the corresponding service type includes: According to the formula: remaining queue length = current bandwidth reservation value * (gating list cycle end time - current message receiving time), determine the remaining queue length; If the remaining queue length - current data packet length - programmable queue cache length ≥ 0, it means that the queue can be entered, otherwise it cannot be entered.
4. The deterministic network dynamic bandwidth reservation method according to claim 2, characterized in that: Mapping the data packets in the programmable queue to the gated queue includes: Mapping the priority of the deterministic service data packet with the priority of the gated queue, and mapping the non-deterministic service data packet to the lowest priority in the gated queue; The maximum queue length of the priority of the deterministic service in the gated queue is calculated according to the gated list and the current bandwidth reservation value, and the congestion of the queue of the corresponding priority in the gated queue is judged according to the maximum queue length; If no congestion occurs, the deterministic service data packets are dequeued from the programmable queue and enter the gated queue according to the priority; If congestion occurs, the deterministic service data packets are placed in the queue that can be sent later in the gated state and filled in accordance with the principle of high to low priority.
5. The deterministic network dynamic bandwidth reservation method according to claim 4, characterized in that: The step of calculating the maximum queue length of the priority of the deterministic service in the gated queue according to the gated list and the current bandwidth reservation value, and performing congestion judgment on the queue of the corresponding priority in the gated queue according to the maximum queue length includes: According to the sending status of the gated queue and the message receiving time, calculate the remaining sending time T of the queue in this cycle p1 ; According to the formula: MAX_QL p1 =BW st *T p1 , calculate the maximum queue length MAX_QL p1 ; According to the gating list, find the target queue that overlaps with the current priority queue, determine the target queue cache, and calculate the target queue cache according to MAX_QL. p1 , current priority queue cache, target queue cache and current packet length to determine whether congestion occurs.
6. The deterministic network dynamic bandwidth reservation method according to claim 1, characterized in that: The service bandwidth usage ratio is calculated according to the formula: service bandwidth usage ratio = length of packets sent in a period / current bandwidth reservation value * sending time of the priority queue in a period; The current bandwidth reservation value is a set initial value in the first cycle, and is a bandwidth reservation value of the previous cycle starting from the second cycle.
7. The deterministic network dynamic bandwidth reservation method according to claim 6, characterized in that: The bandwidth reservation value for the next period is calculated according to the formula: bandwidth reservation value = service bandwidth usage ratio * (1 + 1 / 2) * current bandwidth reservation value.
8. A deterministic network dynamic bandwidth reservation device, characterized in that: The deterministic network dynamic bandwidth reservation device comprises: A receiving module, which is used to receive the deterministic service characteristics and gating list issued according to the configuration on the forwarding plane; A decision module, which distinguishes the service type of the received data packet according to the deterministic service characteristics, the service type includes deterministic service and non-deterministic service, and makes a queue entry decision according to the traffic statistics and the current bandwidth reservation value to determine whether the data packet can enter the programmable queue of the corresponding service type; A control module is used to map data packets in the programmable queue to the gated queue. The gated queue performs periodic forwarding according to the gated list, performs traffic statistics for deterministic services and non-deterministic services, and calculates the service bandwidth usage ratio of the corresponding service type; The bandwidth reservation module is used to: when the gated forwarding cycle ends, if the bandwidth reservation value needs to be adjusted, determine the bandwidth reservation value of the next cycle according to the corresponding service bandwidth usage ratio and the current bandwidth reservation value.
9. The deterministic network dynamic bandwidth reservation device according to claim 8, characterized in that: The decision module makes a queue entry decision based on traffic statistics and the current bandwidth reservation value to determine whether the data packet can enter the programmable queue of the corresponding service type, including: Calculate whether the corresponding service type has sufficient queue length based on traffic statistics and current bandwidth reservation value to determine whether the data packet can enter the programmable queue of the corresponding service type; If the deterministic service data packet meets the queue entry conditions, it will enter the deterministic service programmable queue cache in the order of the time when the deterministic service data packet arrives; If the deterministic service data packet does not meet the queue entry condition, it will enter the non-deterministic service programmable queue cache, and the deterministic service data packet will be prioritized in the non-deterministic programmable queue; If the non-deterministic service data packets meet the queue entry conditions, they will enter the non-deterministic programmable queue cache in the order of their arrival time; If the non-deterministic data packet does not meet the enqueue decision conditions, the data packet is discarded.
10. The deterministic network dynamic bandwidth reservation device according to claim 9, characterized in that: The control module maps data packets in the programmable queue to the gated queue, including: Mapping the priority of the deterministic service data packet with the priority of the gated queue, and mapping the non-deterministic service data packet to the lowest priority in the gated queue; The maximum queue length of the priority of the deterministic service in the gated queue is calculated according to the gated list and the current bandwidth reservation value, and the congestion of the queue of the corresponding priority in the gated queue is judged according to the maximum queue length; If no congestion occurs, the deterministic service data packets are dequeued from the programmable queue and enter the gated queue according to the priority; If congestion occurs, the deterministic service data packets are placed in the queue that can be sent later in the gated state and filled in accordance with the principle of high to low priority.
Citation Information
Patent Citations
Service quality method for guaranteeing service bandwidth and network equipment
CN107682282A
Deterministic service transmission method and device based on jitter time delay
CN115643220A
Network end-to-end deterministic control system and method and storage medium
CN117579540A
Deterministic service forwarding method for time synchronization error
CN118353854A
Method for putting apart a bandwidth in advance, and equipment for implementing bandwidth put apart in advance
CN1960342A
Cited By
Mobile communication deterministic network service scheduling optimization method and device
CN119729617A
Message transmission method and system, electronic equipment and storage medium
CN121193688A
AVB (Audio Video Broadband) stream bandwidth reservation method, system and network equipment
CN122348930A
