CN116708310A - Flow control method and device, storage medium and electronic equipment - Google Patents
Flow control method and device, storage medium and electronic equipment Download PDFInfo
- Publication number
- CN116708310A CN116708310A CN202310989947.9A CN202310989947A CN116708310A CN 116708310 A CN116708310 A CN 116708310A CN 202310989947 A CN202310989947 A CN 202310989947A CN 116708310 A CN116708310 A CN 116708310A
- Authority
- CN
- China
- Prior art keywords
- rate
- queue
- token bucket
- bucket algorithm
- evaluation
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 142
- 238000011156 evaluation Methods 0.000 claims abstract description 85
- 230000005540 biological transmission Effects 0.000 claims abstract description 16
- 238000012544 monitoring process Methods 0.000 claims description 28
- 238000012545 processing Methods 0.000 claims description 11
- 238000004364 calculation method Methods 0.000 claims description 3
- 230000009286 beneficial effect Effects 0.000 abstract 1
- 238000010586 diagram Methods 0.000 description 6
- 238000007493 shaping process Methods 0.000 description 6
- 230000006870 function Effects 0.000 description 4
- 238000011144 upstream manufacturing Methods 0.000 description 3
- 230000002411 adverse Effects 0.000 description 2
- 230000007423 decrease Effects 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 239000003550 marker Substances 0.000 description 2
- 230000005856 abnormality Effects 0.000 description 1
- 239000003086 colorant Substances 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000013209 evaluation strategy Methods 0.000 description 1
- 238000002372 labelling Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/215—Flow control; Congestion control using token-bucket
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/25—Flow control; Congestion control with rate being modified by the source upon detecting a change of network conditions
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/30—Flow control; Congestion control in combination with information about buffer occupancy at either end or at transit nodes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a flow control method and device, a storage medium and electronic equipment, wherein the method comprises the following steps: when flow control is performed based on a token bucket algorithm, performing queue depth evaluation on a cache queue to obtain an evaluation queue depth; judging whether a token bucket algorithm accords with a preset rate adjustment condition according to the evaluation queue depth; if the first rate meets the condition, determining the first rate; the first rate is the promised information rate currently configured in the token bucket algorithm; performing change rate identification on the cache queue to obtain a queue change rate; determining a rate adjustment amplitude according to the queue change rate and a preset rate range; fine-tuning the first rate based on the rate adjustment amplitude to obtain a second rate; updating the promised information rate at a second rate to adjust the data transmission speed in the flow control process. By applying the method of the invention, the promised information rate can be adaptively adjusted based on the depth of the buffer queue, which is beneficial to avoiding the packet loss caused by the limited buffer capacity.
Description
Technical Field
The present invention relates to the field of flow control technologies, and in particular, to a flow control method and apparatus, a storage medium, and an electronic device.
Background
In the data transmission process of the upstream device and the downstream device, the receiving capability of the downstream device is limited, and burst network traffic cannot be received, so that a large number of faults such as packet loss, service interruption and the like occur, and therefore, the flow control is usually required in the upstream device or the transmission process.
At present, a common flow control mode mainly performs flow shaping on port data or service data through network equipment. The network device transmits data to the downstream device according to a preset transmission rate, firstly caches the data with the flow exceeding a preset upper limit, and then gradually transmits the data to the downstream device, so that the transmitted flow is smooth.
Based on the existing flow control mode, the network device can only transmit data according to a preset transmission rate, when encountering a flow burst, the network device needs to buffer a large amount of data, and the storage space of the network device is limited, so that the data packet loss is most likely to be caused under the scene, and the adverse effect is brought to the service.
Disclosure of Invention
In view of this, the embodiment of the invention provides a flow control method to solve the problem that when a large amount of data needs to be buffered in the existing flow control mode, the data packet is easy to be lost, and adverse effect is brought to the service.
The embodiment of the invention also provides a flow control device which is used for ensuring the practical realization and application of the method.
In order to achieve the above object, the embodiment of the present invention provides the following technical solutions:
a flow control method, comprising:
under the condition of flow control based on a preset token bucket algorithm, when rate evaluation is required, performing queue depth evaluation on the constructed cache queue to obtain an evaluation queue depth corresponding to the cache queue; the buffer queue is a queue constructed based on the token bucket algorithm and is used for storing data to be sent;
judging whether the current token bucket algorithm accords with a preset rate adjustment condition according to the evaluation queue depth;
if the current token bucket algorithm meets the rate adjustment condition, determining a first rate; the first rate is a currently configured promise information rate in the token bucket algorithm; the promised information rate characterizes the data sending speed in the flow control process;
performing change rate identification on the cache queue to obtain a queue change rate corresponding to the cache queue;
determining a rate adjustment amplitude according to the queue change rate and a preset rate range;
Fine-tuning the first rate based on the rate adjustment amplitude to obtain a second rate corresponding to the first rate;
updating the promised information rate configured in the token bucket algorithm to the second rate, and performing flow control by applying the updated promised information rate so as to adjust the data sending speed in the flow control process.
In the above method, optionally, the token bucket algorithm is a single-rate tri-color marking algorithm.
The method, optionally, the flow control process based on the preset token bucket algorithm includes:
when a data message is received, determining the data flow corresponding to the data message;
comparing the data traffic with a preset promise burst size;
if the data traffic is smaller than or equal to the promise burst size, taking a preset green mark as a color mark corresponding to the data message;
if the data traffic is greater than the promised burst size, comparing the data traffic with a preset excess burst size;
if the data flow is smaller than or equal to the excess burst size, taking a preset yellow mark as a color mark corresponding to the data message;
If the data flow is larger than the excess burst size, taking a preset red mark as a color mark corresponding to the data message;
and processing the data message based on the color mark corresponding to the data message so as to realize flow control.
In the above method, optionally, the processing the data packet based on the color mark corresponding to the data packet includes:
if the color mark corresponding to the data message is the green mark, the data message is sent to a designated device, and the number of tokens in a preset token bucket is deleted;
and if the color mark corresponding to the data message is the yellow mark or the red mark, storing the data message into the cache queue.
In the above method, optionally, the performing queue depth evaluation on the constructed cache queue to obtain an evaluation queue depth corresponding to the cache queue includes:
determining a monitoring time period corresponding to the current time point;
determining a queue depth set corresponding to the monitoring time period; the queue depth set comprises queue depths of the cache queue at each monitoring time point in the monitoring time period;
And carrying out average value calculation processing on the queue depth set to obtain an average value corresponding to the queue depth set, and taking the average value corresponding to the queue depth set as the estimated queue depth corresponding to the cache queue.
According to the above method, optionally, the determining whether the current token bucket algorithm meets a preset rate adjustment condition according to the evaluation queue depth includes:
comparing the evaluation queue depth with a preset first length threshold value;
if the evaluation queue depth is smaller than or equal to the first length threshold, judging whether the currently configured promised information rate in the token bucket algorithm is equal to the minimum value in the rate range;
if the currently configured promised information rate in the token bucket algorithm is not equal to the minimum value in the rate range, determining that the current token bucket algorithm accords with the rate adjustment condition;
if the currently configured promised information rate in the token bucket algorithm is equal to the minimum value in the rate range, determining that the current token bucket algorithm does not accord with the rate adjustment condition;
if the evaluation queue depth is larger than the first length threshold, comparing the evaluation queue depth with a preset second length threshold; the second length threshold is greater than the first length threshold;
And if the evaluation queue depth is smaller than or equal to the second length threshold value, determining that the current token bucket algorithm meets the rate adjustment condition.
The method, optionally, further comprises:
and if the evaluation queue depth is greater than the second length threshold, determining that the current token bucket algorithm does not meet the rate adjustment condition.
A flow control device, comprising:
the queue evaluation unit is used for performing queue depth evaluation on the constructed cache queue when the rate evaluation is required under the condition of performing flow control based on a preset token bucket algorithm, so as to obtain the evaluation queue depth corresponding to the cache queue; the buffer queue is a queue constructed based on the token bucket algorithm and is used for storing data to be sent;
the judging unit is used for judging whether the current token bucket algorithm accords with a preset rate adjustment condition according to the evaluation queue depth;
a first determining unit, configured to determine a first rate if the current token bucket algorithm meets the rate adjustment condition; the first rate is a currently configured promise information rate in the token bucket algorithm; the promised information rate characterizes the data sending speed in the flow control process;
The identification unit is used for identifying the change rate of the cache queue to obtain the change rate of the queue corresponding to the cache queue;
the second determining unit is used for determining a rate adjustment amplitude according to the queue change rate and a preset rate range;
the adjusting unit is used for fine-adjusting the first rate based on the rate adjusting amplitude to obtain a second rate corresponding to the first rate;
and the updating unit is used for updating the promised information rate configured in the token bucket algorithm to the second rate, and carrying out flow control on the updated promised information rate so as to adjust the data transmission speed in the flow control process.
A storage medium comprising stored instructions that, when executed, control a device on which the storage medium resides to perform a flow control method as described above.
An electronic device comprising a memory, and one or more instructions, wherein the one or more instructions are stored in the memory and configured to be executed by one or more processors to perform a flow control method as described above.
Based on the above-mentioned method for controlling flow provided by the embodiment of the present invention, the method includes: under the condition of flow control based on a preset token bucket algorithm, when rate evaluation is required, performing queue depth evaluation on the constructed cache queue to obtain an evaluation queue depth corresponding to the cache queue; the buffer queue is a queue constructed based on a token bucket algorithm and is used for storing data to be sent; judging whether the current token bucket algorithm accords with a preset rate adjustment condition according to the evaluation queue depth; if the current token bucket algorithm accords with the rate adjustment condition, determining a first rate; the first rate is the promised information rate currently configured in the token bucket algorithm; the promised information rate characterizes the data sending speed in the flow control process; performing change rate identification on the cache queue to obtain a queue change rate corresponding to the cache queue; determining a rate adjustment amplitude according to the queue change rate and a preset rate range; fine-tuning the first rate based on the rate adjustment amplitude to obtain a second rate corresponding to the first rate; updating the promised information rate configured in the token bucket algorithm to a second rate, and performing flow control by applying the updated promised information rate so as to adjust the data sending speed in the flow control process. By applying the method provided by the embodiment of the invention, the flow control is performed based on the token bucket algorithm, so that the flow of data transmission is smooth, and the flow shaping is realized. In the flow control process, whether the promised information rate needs to be adjusted or not can be estimated based on the queue depth of the cache queue at regular time, and the promised information rate is correspondingly adjusted when the promised information rate needs to be adjusted, so that the data sending speed in the flow control process is adapted to the queue depth of the cache queue, and when more data to be sent in the cache queue, the promised information rate can be correspondingly improved, so that the data sending speed in the cache queue is improved. On the premise of realizing flow control, the buffer queue can maintain a certain free space to store data, so that the data packet loss caused by limited storage space is avoided, and the normal operation of the service is ensured.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings that are required to be used in the embodiments or the description of the prior art will be briefly described below, and it is obvious that the drawings in the following description are only embodiments of the present invention, and that other drawings can be obtained according to the provided drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flow chart of a flow control method according to an embodiment of the present invention;
FIG. 2 is a flow chart of another method of flow control according to an embodiment of the present invention;
FIG. 3 is an exemplary diagram of a flow control system provided in an embodiment of the present invention;
FIG. 4 is a schematic structural diagram of a flow control device according to an embodiment of the present invention;
fig. 5 is a schematic structural diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
In the present disclosure, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
The embodiment of the application provides a flow control method, which can be applied to a flow control system, wherein an execution subject of the method can be a processor of the system, and a flow chart of the method is shown in fig. 1, and the method comprises the following steps:
s101: under the condition of flow control based on a preset token bucket algorithm, when rate evaluation is required, performing queue depth evaluation on the constructed cache queue to obtain an evaluation queue depth corresponding to the cache queue; the buffer queue is a queue constructed based on the token bucket algorithm and is used for storing data to be sent;
The method provided by the embodiment of the invention can be deployed in a flow control system, so that the data which is required to be sent to downstream equipment by upstream equipment is firstly sent to the flow control system, and the flow control system carries out flow forwarding based on a preset token bucket algorithm to realize flow control.
The principle of the token bucket algorithm is mainly based on the control of the data flow sent by the token bucket, the token bucket can be regarded as a container capable of storing a certain number of tokens, the system generates tokens according to a set speed and puts the generated tokens into the token bucket, the token bucket can only hold tokens corresponding to the capacity at most, and when the token bucket can not hold redundant tokens any more, the redundant tokens can overflow. In the flow control process, a certain flow of data messages are forwarded, a corresponding number of tokens are required to be consumed, and the larger the forwarded data flow, the more tokens are consumed. When a data message needing to be forwarded is received, if the number of tokens in the current token bucket meets the flow requirement for forwarding the data message, the data message is sent to a corresponding object. When the token bucket algorithm is applied, a buffer queue is constructed, if the number of tokens in the current token bucket does not meet the flow requirement for forwarding a certain data message when the data message is received, the data message can be buffered in the buffer queue. For the buffer queue, whether the number of tokens in the token bucket meets the flow requirement of the data message to be sent in the buffer queue can be monitored regularly, and if so, the data message to be sent is sent to the corresponding object. It will be appreciated that the rate at which tokens are generated, or placed into the token bucket, actually controls the flow or speed at which data is sent.
The token bucket algorithm preset in the method provided by the embodiment of the invention can adopt the existing token bucket algorithm, such as a single-speed double-bucket algorithm or a double-speed double-bucket algorithm.
In the method provided by the embodiment of the invention, whether the rate of placing the token in the token bucket algorithm is suitable for the current data flow to be sent is evaluated at regular time. The period of rate estimation may be preset, for example, the rate estimation is performed at predetermined time intervals, and when a predetermined estimation time point is reached, the rate estimation is required.
In the process of flow control based on a preset token bucket algorithm, when rate evaluation is required, performing queue depth evaluation on the constructed cache queue according to a preset evaluation strategy to obtain the evaluation queue depth corresponding to the cache queue. The corresponding evaluation queue depth of the cache queue represents the use degree of the queue space in the current cache queue, and the evaluation queue depth can be specifically represented by the data quantity stored in the cache queue or by the free space of the cache queue. In a specific implementation process, relevant data of the cache queue can be monitored in real time, and when rate evaluation is performed, queue depth evaluation can be performed based on the monitored data from the last evaluation time point to the current evaluation time point.
S102: judging whether the current token bucket algorithm accords with a preset rate adjustment condition according to the evaluation queue depth;
in the method provided by the embodiment of the invention, the speed adjustment condition can be preset according to the actual requirement, namely, the condition which is required to be met for adjusting the speed of generating the token in the token bucket algorithm. The rate adjustment condition can be configured based on the size of the evaluation queue depth, and specifically, when the data amount buffered in the buffer queue exceeds a predetermined threshold, the token generation speed is adjusted to increase the data transmission rate.
In the method provided by the embodiment of the invention, whether the depth of the evaluation queue meets the condition requirement of the preset rate adjustment condition is judged, if so, the current token bucket algorithm is considered to be accordant with the rate adjustment condition, otherwise, the current token bucket algorithm is considered not to be accordant with the rate adjustment condition.
In the method provided by the embodiment of the invention, if the current token bucket algorithm does not meet the rate adjustment condition, ending the processing process, and continuing to perform flow control based on the current configuration parameters of the token bucket algorithm, and waiting for the next evaluation time point.
S103: if the current token bucket algorithm meets the rate adjustment condition, determining a first rate; the first rate is a currently configured promise information rate in the token bucket algorithm; the promised information rate characterizes the data sending speed in the flow control process;
In the method provided by the embodiment of the invention, if the token bucket algorithm is judged to meet the rate adjustment condition, the currently configured promised information rate in the token bucket algorithm is obtained, and the rate is taken as the first rate. The committed information rate (Committed Information Rate, CIR) is a parameter in the token bucket algorithm that represents the speed of delivery of tokens into the C-bucket (one of the token bucket algorithms), it being understood that it also characterizes the data transmission speed during flow control.
S104: performing change rate identification on the cache queue to obtain a queue change rate corresponding to the cache queue;
in the method provided by the embodiment of the invention, the change rate identification is carried out on the cache queue according to a preset change rate identification mode, namely, the change rate of the data quantity stored in the cache queue in a preset time period is calculated, so that the queue change rate corresponding to the cache queue is obtained. The predetermined period of time may be a period of time between a last evaluation time point and a current evaluation time point.
S105: determining a rate adjustment amplitude according to the queue change rate and a preset rate range;
in the method provided by the embodiment of the invention, a rate range, that is, a rate minimum value and a rate maximum value can be preset, and under the condition of normal flow, the promised information rate can be configured as the preset rate minimum value, and when the promised information rate is adjusted, the promised information rate can be configured as the preset rate maximum value at most.
In the method provided by the embodiment of the invention, the rate adjustment amplitude can be determined based on the queue change rate and the preset rate range. Specifically, the rate adjustment amplitude may be determined in combination with the magnitude of the queue change rate and the adjustable space within a preset rate range. For example, a plurality of queue change rate ranges and a plurality of adjustment amplitudes may be preset, and each queue change rate range corresponds to each adjustment amplitude one by one. According to the range of the queue change rate, which the queue change rate belongs to, one adjustment amplitude can be matched in each preset adjustment amplitude, a rate value obtained by adjusting the first rate based on the adjustment amplitude can be calculated, if the rate value is in the preset rate range, the adjustment amplitude can be determined as the rate adjustment amplitude, and if the rate value is not in the preset rate range, the change amplitude can be calculated according to the corresponding critical value in the first rate and the rate range, and the change amplitude can be determined as the rate adjustment amplitude.
S106: fine-tuning the first rate based on the rate adjustment amplitude to obtain a second rate corresponding to the first rate;
in the method provided by the embodiment of the invention, the first rate is finely adjusted based on the rate adjustment amplitude, and the rate obtained after adjustment is the second rate. Specifically, if the committed information rate is to be increased currently, then the value corresponding to the rate adjustment amplitude is increased on the basis of the first rate, and if the committed information rate is to be decreased currently, then the value corresponding to the rate adjustment amplitude is subtracted on the basis of the first rate.
S107: updating the promised information rate configured in the token bucket algorithm to the second rate, and performing flow control by applying the updated promised information rate so as to adjust the data sending speed in the flow control process.
In the method provided by the embodiment of the invention, the parameters in the token bucket algorithm are updated, and the configured promised information rate is updated to the second rate, namely, the updated promised information rate is equal to the second rate, so that the adjustment of the data sending speed in the flow control process is realized.
Based on the method provided by the embodiment of the invention, under the condition of controlling the flow based on the token bucket algorithm, the queue depth of the cache queue is evaluated to obtain the evaluation queue depth; judging whether the current token bucket algorithm accords with a preset rate adjustment condition according to the evaluation queue depth; if the current token bucket algorithm accords with the rate adjustment condition, determining a first rate; the first rate is the promised information rate currently configured in the token bucket algorithm; performing change rate identification on the cache queue to obtain a queue change rate; determining a rate adjustment amplitude according to the queue change rate and a preset rate range; fine-tuning the first rate based on the rate adjustment amplitude to obtain a second rate corresponding to the first rate; updating the promised information rate configured in the token bucket algorithm to a second rate, and performing flow control by applying the updated promised information rate so as to adjust the data sending speed in the flow control process. By applying the method provided by the embodiment of the invention, the flow control is performed based on the token bucket algorithm, so that the flow of data transmission is smooth, and the flow shaping is realized. In the flow control process, whether the promised information rate needs to be adjusted or not can be estimated based on the queue depth of the cache queue at regular time, and the promised information rate is correspondingly adjusted when the promised information rate needs to be adjusted, so that the data sending speed in the flow control process is adapted to the queue depth of the cache queue, and when more data to be sent in the cache queue, the promised information rate can be correspondingly improved, so that the data sending speed in the cache queue is improved. On the premise of realizing flow control, the buffer queue can maintain a certain free space to store data, so that the data packet loss caused by limited storage space is avoided, and the normal operation of the service is ensured.
Based on the method shown in fig. 1, in the method provided by the embodiment of the invention, the token bucket algorithm is a single-rate tri-color marking algorithm.
In the method provided by the embodiment of the invention, a single-speed three-color marking algorithm is adopted by a preset token bucket algorithm, and the single-speed three-color marking algorithm is a single-speed double-bucket algorithm. The single rate tri-color marker (single rate three color marker, srTCM) algorithm is primarily concerned with bursts of message size. The evaluation result of the algorithm is that the message is marked with three colors of red, yellow and green, so the message is called as a three-color mark. The algorithm principle of the single-rate three-color marking algorithm is briefly described below.
Two token buckets, referred to as a C bucket and an E bucket, are deployed in the single rate tri-color marking algorithm, the number of tokens in the C bucket being represented by Tc and the number of tokens in the E bucket being represented by Te.
The single rate three-color labeling algorithm has 3 key parameters, namely:
CIR (Committed Information Rate): the promised information rate represents the rate of putting tokens into the C barrel, namely the average rate of allowing the C barrel to transmit or forward messages;
CBS (Committed Burst Size): the promise burst size represents the capacity of the C barrel, namely promise burst flow which can pass through the C barrel instantaneously;
EBS (Excess Burst Size): excess burst size, which indicates the capacity of the E-bucket, i.e., excess burst traffic that the E-bucket can instantaneously pass.
The system puts tokens into the bucket at the CIR rate:
if Tc < CBS, tc increases;
if tc=cbs, te < EBS, te increases;
if tc=cbs, te=ebs, none increases.
For the arriving message, the size of the message is represented by B, and the color marking mode is processed based on the following principle:
if B is less than or equal to Tc, the message is marked as green, and Tc is reduced by B;
if Tc < B is less than or equal to Te, the message is marked as yellow, and Te is reduced by B;
if Te < B, the message is marked red and neither Tc nor Te decreases.
Based on the method provided by the above embodiment, in the method provided by the embodiment of the present invention, the flow control process based on the preset token bucket algorithm mentioned in step S101 includes:
when a data message is received, determining the data flow corresponding to the data message;
in the method provided by the embodiment of the invention, when the flow control system receives a new data message, the data flow corresponding to the data message, namely the data volume of the data message, can be identified.
Comparing the data traffic with a preset promise burst size;
If the data traffic is smaller than or equal to the promise burst size, taking a preset green mark as a color mark corresponding to the data message;
in the method provided by the embodiment of the invention, the data traffic is compared with the promise burst size set in the token bucket algorithm, and if the data traffic does not exceed the promise burst size, the data message is marked as green.
If the data traffic is greater than the promised burst size, comparing the data traffic with a preset excess burst size;
in the method provided by the embodiment of the invention, if the data flow of the current data message exceeds the promised burst size, the data flow is compared with the excess burst size set in the token bucket algorithm.
If the data flow is smaller than or equal to the excess burst size, taking a preset yellow mark as a color mark corresponding to the data message;
if the data flow is larger than the excess burst size, taking a preset red mark as a color mark corresponding to the data message;
in the method provided by the embodiment of the invention, if the data flow of the current data message does not exceed the excess burst size, the data message is marked as yellow, and if the data flow exceeds the excess burst size, the data message is marked as red.
And processing the data message based on the color mark corresponding to the data message so as to realize flow control.
In the method provided by the embodiment of the invention, whether the data message is subjected to data transmission operation or data caching operation is determined according to the color mark corresponding to the data message, and the data message is correspondingly processed so as to control the data transmission flow.
Based on the method provided by the above embodiment, in the method provided by the embodiment of the present invention, the processing the data packet based on the color mark corresponding to the data packet includes:
if the color mark corresponding to the data message is the green mark, the data message is sent to a designated device, and the number of tokens in a preset token bucket is deleted;
and if the color mark corresponding to the data message is the yellow mark or the red mark, storing the data message into the cache queue.
In the method provided by the embodiment of the invention, if the data message is marked as green, the data message is directly subjected to data transmission operation and is sent to the designated equipment, and correspondingly, the number of tokens in the token bucket is deleted, and the deleted number of tokens corresponds to the data flow of the data message. If the data message is marked as yellow or red, the data message is subjected to data caching operation, and the data message is stored in a cache queue to wait for data transmission.
Based on the method shown in fig. 1, in the method provided by the embodiment of the present invention, performing queue depth evaluation on the constructed cache queue mentioned in step S101 to obtain an evaluation queue depth corresponding to the cache queue, where the evaluation queue depth includes:
determining a monitoring time period corresponding to the current time point;
in the method provided by the embodiment of the invention, the time period between the time point of the last rate evaluation and the current time point is determined as the monitoring time period corresponding to the current time point.
Determining a queue depth set corresponding to the monitoring time period; the queue depth set comprises queue depths of the cache queue at each monitoring time point in the monitoring time period;
in the method provided by the embodiment of the invention, the system monitors the queue depth of the cache queue in real time, wherein the queue depth of the cache queue refers to the data quantity stored in the cache queue. And acquiring monitoring data corresponding to the monitoring time period from the pre-recorded monitoring data to obtain the queue depth of the cache queue at each monitoring time point in the monitoring time period, thereby obtaining a queue depth set.
And carrying out average value calculation processing on the queue depth set to obtain an average value corresponding to the queue depth set, and taking the average value corresponding to the queue depth set as the estimated queue depth corresponding to the cache queue.
In the method provided by the embodiment of the invention, the average value of all the queue depths in the queue depth set is calculated, and the calculated result is used as the estimated queue depth corresponding to the cache queue.
Based on the method shown in fig. 1, referring to the flowchart shown in fig. 2, in the method provided by the embodiment of the present invention, the process of determining whether the current token bucket algorithm meets the preset rate adjustment condition according to the evaluation queue depth mentioned in step S102 includes:
s201: comparing the evaluation queue depth with a preset first length threshold value to judge whether the evaluation queue depth is smaller than or equal to the first length threshold value;
in the method provided by the embodiment of the invention, the data quantity stored in the queue depth representation buffer queue is evaluated, a first length threshold value is preset in the system according to actual requirements, the first length threshold value can be regarded as a safety threshold value of the queue depth, and when the queue depth is within the threshold value range, the flow control process can normally run.
And comparing the estimated queue depth with a first length threshold when judging whether the token bucket algorithm meets the rate adjustment condition. If the estimated queue depth does not exceed the first length threshold, the process proceeds to step S202, and if the estimated queue depth exceeds the first length threshold, the process proceeds to step S205.
S202: judging whether the currently configured promised information rate in the token bucket algorithm is equal to the minimum value in the rate range;
in the method provided by the embodiment of the invention, if the estimated queue depth is smaller than or equal to the first length threshold, the fact that the promised information rate does not need to be improved at present is indicated, the promised information rate is configured according to a conventional value, and the conventional value is the minimum value in a preset rate range. It is determined whether the currently configured committed information rate is equal to the minimum in the rate range. If the committed information rate is not equal to the minimum value in the rate range, the process proceeds to step S203, and if it is equal to the minimum value in the rate range, the process proceeds to step S204.
S203: determining that the current token bucket algorithm meets the rate adjustment condition;
in the method provided by the embodiment of the invention, if the currently configured promised information rate in the token bucket algorithm is not equal to the minimum value in the rate range, the current promised information rate is required to be reduced until the promised information rate is restored to the minimum value in the rate range, so that the current token bucket algorithm is determined to accord with the preset rate adjustment condition.
S204: determining that the current token bucket algorithm does not meet the rate adjustment condition;
In the method provided by the embodiment of the invention, if the currently configured promised information rate in the token bucket algorithm is equal to the minimum value in the rate range, the promised information rate is configured according to the value which is suitable for the current queue depth, and adjustment is not needed, so that the token bucket algorithm is determined to be not in accordance with the preset rate adjustment condition.
S205: comparing the evaluation queue depth with a preset second length threshold value; the second length threshold is greater than the first length threshold;
in the method provided by the embodiment of the invention, the second length threshold value can be preset in the system according to actual requirements, and can be regarded as the guard threshold value of the queue depth, and when the queue depth exceeds the threshold value, the data abnormality can be indicated. If the evaluation queue depth is greater than the first length threshold, the evaluation queue depth is compared to a second length threshold.
S206: and if the evaluation queue depth is smaller than or equal to the second length threshold value, determining that the current token bucket algorithm meets the rate adjustment condition.
In the method provided by the embodiment of the invention, if the estimated queue depth does not exceed the second length threshold, the promised information rate is required to be increased until the promised information rate reaches the maximum value in the preset rate range, so that the current token bucket algorithm is determined to meet the rate adjustment condition.
On the basis of the method provided by the embodiment, the method provided by the embodiment of the invention further comprises the following steps:
and if the evaluation queue depth is greater than the second length threshold, determining that the current token bucket algorithm does not meet the rate adjustment condition.
In the method provided by the embodiment of the invention, if the depth of the estimated queue exceeds the second length threshold value, the data volume exceeds the caching capacity of the system, and the data exception is difficult to avoid even if the promised information rate is continuously improved, so that the token bucket algorithm can be determined to be inconsistent with the rate adjustment condition, and an exception alarm can be sent out.
It should be noted that, the specific condition judgment process provided in the embodiment of the present invention is only provided to better illustrate the specific embodiment provided by the method provided in the embodiment of the present invention, and in the specific implementation process, the condition configuration may be performed according to the actual requirement. For example, when the estimated queue depth exceeds the second length threshold, the promised information rate may be further increased, without affecting the implementation function of the method provided by the embodiment of the present invention.
In order to better illustrate the method provided by the embodiment of the present invention, on the basis of the method provided by the foregoing embodiment, in combination with an actual application scenario, the embodiment of the present invention provides another flow control method. The method can be realized by a flow control system, and the system can be specifically designed based on a field programmable gate array (Field Programmable Gate Array, FPGA). The system is an example of the flow control method shown in fig. 1, and an exemplary diagram of the structural composition of the system may be shown in fig. 3, and the system specifically includes: a traffic input module 301, a traffic monitoring module 302, a cache queue module 303, a traffic output module 304, a queue monitoring module 305, and a token generation module 306.
Next, a flow control procedure provided by the embodiment of the present invention will be briefly described from the viewpoint of the functions of the system modules.
The flow input module is mainly responsible for receiving network data packets, and the received data can be a MAC frame of gigabit Ethernet, a network frame of hundred megabytes or megabytes of Ethernet, or any other type of data.
And the flow monitoring module is used for completing the functions of flow monitoring and message marking and is mainly used for marking the received data message based on a token bucket algorithm. The method can be realized by using the token bucket algorithm principle of single-speed double buckets or double-speed double buckets, and the method adopts a single-speed three-color marking algorithm defined based on RFC2697 protocol in the embodiment of the invention, and the algorithm principle can be referred to the description in the previous embodiment. In the method provided by the embodiment of the invention, the single-speed double-bucket mode allows the traffic burst, and according to the algorithm principle, when the traffic rate of the user does not exceed the configured promise information rate CIR, the message is marked as green. When the burst traffic of the user is greater than the configured committed burst size CBS, but the excess burst size EBS is not exceeded, the message is marked yellow. When the burst traffic of the user is greater than the configured excess burst size EBS, the message is marked red. And the flow monitoring module marks yellow or red data messages, the data messages enter the buffer queue module to be buffered, and the data messages marked green enter the flow output module to be transmitted.
And the buffer queue module is used for data buffer. Using FIFO (First Input First Output) memory as buffer queue, marking yellow or red message, temporarily storing in buffer queue, and transmitting the buffered data message to downstream via flow output module when enough token is available.
And the flow output module is used for sending the data message to the designated downstream equipment.
The token generation module is used for controlling the token generation rate through the counter, and taking the number of pulses generated in unit time of the counter as the token generation rate, namely the promised information rate CIR. The greater the number of pulses generated per unit time, the faster the rate at which tokens are generated, and the more messages are marked green. The speed of token generation can be fine-tuned according to feedback from the queue monitoring module, and an expected threshold and an unexpected threshold are set for the token generation module. The queue monitoring module may fine tune the token generation rate in the token generation module from an expected threshold to an over-expected threshold.
The queue monitoring module is used for monitoring the queue depth of the cache queue in real time, when the queue depth of the cache queue in unit time is in a set safety threshold, the token generation rate does not need to be finely adjusted, and when the queue depth in unit time exceeds the safety threshold, the token generation rate is finely adjusted and increased. When the queue depth per unit time reaches the alert threshold, the token generation rate is not trimmed. The amplitude of the fine adjustment of the token generation rate is linearly adjusted according to the speed of the change of the queue depth in unit time. When the queue depth per unit time gradually returns to the safe threshold, the token generation rate also gradually decreases linearly to the expected set rate. That is, when the queue depth is within the preset safety threshold, the token generation rate in the token generation module should be maintained at the preset expected threshold, if the token generation rate is originally within the expected threshold, no adjustment is needed, and if the token generation rate is not within the expected threshold, the token generation rate is gradually and finely adjusted to be reduced until the token generation rate is within the expected threshold. When the queue depth is between the preset safety threshold and the preset warning threshold, the token generation rate is required to be increased, and the token generation rate is gradually and finely adjusted to be increased until the token generation rate reaches the preset super-expected threshold.
In the embodiment of the invention, the queue depth of the buffer queue in unit time refers to the average value of the queue depth of the buffer queue in unit time. The unit time period may be a time period of a preset time range, such as a time period within a preset time period before the current time point.
Based on the method provided by the embodiment of the invention, the token generation rate is finely adjusted in real time by monitoring the change condition of the buffer queue depth, so that the traffic shaping has small-range automatic adjustment, and the possibility of data packet loss is reduced under the condition of not affecting the maximum limit of the service processing capacity of downstream equipment. The flow of flow shaping can be adjusted in a self-adaptive mode, and the problem of packet loss caused by overflow of a buffer queue is reduced as much as possible.
Corresponding to a flow control method shown in fig. 1, an embodiment of the present invention further provides a flow control device, for implementing the method shown in fig. 1, where a schematic structural diagram is shown in fig. 4, and the flow control device includes:
the queue evaluation unit 401 is configured to perform queue depth evaluation on the constructed cache queue when rate evaluation is required under the condition of performing flow control based on a preset token bucket algorithm, so as to obtain an evaluation queue depth corresponding to the cache queue; the buffer queue is a queue constructed based on the token bucket algorithm and is used for storing data to be sent;
A judging unit 402, configured to judge whether the current token bucket algorithm meets a preset rate adjustment condition according to the evaluation queue depth;
a first determining unit 403, configured to determine a first rate if the current token bucket algorithm meets the rate adjustment condition; the first rate is a currently configured promise information rate in the token bucket algorithm; the promised information rate characterizes the data sending speed in the flow control process;
an identifying unit 404, configured to identify a change rate of the buffer queue, so as to obtain a queue change rate corresponding to the buffer queue;
a second determining unit 405, configured to determine a rate adjustment range according to the queue change rate and a preset rate range;
an adjusting unit 406, configured to fine-tune the first rate based on the rate adjustment amplitude, so as to obtain a second rate corresponding to the first rate;
the updating unit 407 is configured to update the committed information rate configured in the token bucket algorithm to the second rate, and apply the updated committed information rate to perform flow control so as to adjust the data sending speed in the flow control process.
By applying the device provided by the embodiment of the invention, the flow control is performed based on the token bucket algorithm, so that the flow of data transmission is smooth, and the flow shaping is realized. In the flow control process, whether the promised information rate needs to be adjusted or not can be estimated based on the queue depth of the cache queue at regular time, and the promised information rate is correspondingly adjusted when the promised information rate needs to be adjusted, so that the data sending speed in the flow control process is adapted to the queue depth of the cache queue, and when more data to be sent in the cache queue, the promised information rate can be correspondingly improved, so that the data sending speed in the cache queue is improved. On the premise of realizing flow control, the buffer queue can maintain a certain free space to store data, so that the data packet loss caused by limited storage space is avoided, and the normal operation of the service is ensured.
The device provided in the embodiment of the present invention may further extend the plurality of units on the basis of the device shown in fig. 4, and the functions of each unit may be referred to in the foregoing description of each embodiment provided by the flow control method, which is not further illustrated herein.
The embodiment of the invention also provides a storage medium, which comprises stored instructions, wherein the equipment where the storage medium is controlled to execute the flow control method when the instructions run.
The embodiment of the present invention further provides an electronic device, whose structural schematic diagram is shown in fig. 5, specifically including a memory 501, and one or more instructions 502, where the one or more instructions 502 are stored in the memory 501, and configured to be executed by the one or more processors 503, where the one or more instructions 502 perform the following operations:
under the condition of flow control based on a preset token bucket algorithm, when rate evaluation is required, performing queue depth evaluation on the constructed cache queue to obtain an evaluation queue depth corresponding to the cache queue; the buffer queue is a queue constructed based on the token bucket algorithm and is used for storing data to be sent;
Judging whether the current token bucket algorithm accords with a preset rate adjustment condition according to the evaluation queue depth;
if the current token bucket algorithm meets the rate adjustment condition, determining a first rate; the first rate is a currently configured promise information rate in the token bucket algorithm; the promised information rate characterizes the data sending speed in the flow control process;
performing change rate identification on the cache queue to obtain a queue change rate corresponding to the cache queue;
determining a rate adjustment amplitude according to the queue change rate and a preset rate range;
fine-tuning the first rate based on the rate adjustment amplitude to obtain a second rate corresponding to the first rate;
updating the promised information rate configured in the token bucket algorithm to the second rate, and performing flow control by applying the updated promised information rate so as to adjust the data sending speed in the flow control process.
In this specification, each embodiment is described in a progressive manner, and identical and similar parts of each embodiment are all referred to each other, and each embodiment mainly describes differences from other embodiments. In particular, for a system or system embodiment, since it is substantially similar to a method embodiment, the description is relatively simple, with reference to the description of the method embodiment being made in part. The systems and system embodiments described above are merely illustrative, wherein the elements illustrated as separate elements may or may not be physically separate, and the elements shown as elements may or may not be physical elements, may be located in one place, or may be distributed over a plurality of network elements. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment. Those of ordinary skill in the art will understand and implement the present invention without undue burden.
Those of skill would further appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both, and that the various illustrative elements and steps are described above generally in terms of functionality in order to clearly illustrate the interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (10)
1. A flow control method, comprising:
under the condition of flow control based on a preset token bucket algorithm, when rate evaluation is required, performing queue depth evaluation on the constructed cache queue to obtain an evaluation queue depth corresponding to the cache queue; the buffer queue is a queue constructed based on the token bucket algorithm and is used for storing data to be sent;
judging whether the current token bucket algorithm accords with a preset rate adjustment condition according to the evaluation queue depth;
if the current token bucket algorithm meets the rate adjustment condition, determining a first rate; the first rate is a currently configured promise information rate in the token bucket algorithm; the promised information rate characterizes the data sending speed in the flow control process;
performing change rate identification on the cache queue to obtain a queue change rate corresponding to the cache queue;
determining a rate adjustment amplitude according to the queue change rate and a preset rate range;
fine-tuning the first rate based on the rate adjustment amplitude to obtain a second rate corresponding to the first rate;
Updating the promised information rate configured in the token bucket algorithm to the second rate, and performing flow control by applying the updated promised information rate so as to adjust the data sending speed in the flow control process.
2. The method of claim 1, wherein the token bucket algorithm is a single rate tri-color marking algorithm.
3. The method of claim 2, wherein the flow control process based on the preset token bucket algorithm comprises:
when a data message is received, determining the data flow corresponding to the data message;
comparing the data traffic with a preset promise burst size;
if the data traffic is smaller than or equal to the promise burst size, taking a preset green mark as a color mark corresponding to the data message;
if the data traffic is greater than the promised burst size, comparing the data traffic with a preset excess burst size;
if the data flow is smaller than or equal to the excess burst size, taking a preset yellow mark as a color mark corresponding to the data message;
if the data flow is larger than the excess burst size, taking a preset red mark as a color mark corresponding to the data message;
And processing the data message based on the color mark corresponding to the data message so as to realize flow control.
4. The method according to claim 3, wherein the processing the data message based on the color mark corresponding to the data message includes:
if the color mark corresponding to the data message is the green mark, the data message is sent to a designated device, and the number of tokens in a preset token bucket is deleted;
and if the color mark corresponding to the data message is the yellow mark or the red mark, storing the data message into the cache queue.
5. The method of claim 1, wherein the performing queue depth evaluation on the constructed cache queue to obtain an evaluation queue depth corresponding to the cache queue comprises:
determining a monitoring time period corresponding to the current time point;
determining a queue depth set corresponding to the monitoring time period; the queue depth set comprises queue depths of the cache queue at each monitoring time point in the monitoring time period;
and carrying out average value calculation processing on the queue depth set to obtain an average value corresponding to the queue depth set, and taking the average value corresponding to the queue depth set as the estimated queue depth corresponding to the cache queue.
6. The method of claim 1, wherein determining whether the current token bucket algorithm meets a preset rate adjustment condition based on the evaluation queue depth comprises:
comparing the evaluation queue depth with a preset first length threshold value;
if the evaluation queue depth is smaller than or equal to the first length threshold, judging whether the currently configured promised information rate in the token bucket algorithm is equal to the minimum value in the rate range;
if the currently configured promised information rate in the token bucket algorithm is not equal to the minimum value in the rate range, determining that the current token bucket algorithm accords with the rate adjustment condition;
if the currently configured promised information rate in the token bucket algorithm is equal to the minimum value in the rate range, determining that the current token bucket algorithm does not accord with the rate adjustment condition;
if the evaluation queue depth is larger than the first length threshold, comparing the evaluation queue depth with a preset second length threshold; the second length threshold is greater than the first length threshold;
and if the evaluation queue depth is smaller than or equal to the second length threshold value, determining that the current token bucket algorithm meets the rate adjustment condition.
7. The method as recited in claim 6, further comprising:
and if the evaluation queue depth is greater than the second length threshold, determining that the current token bucket algorithm does not meet the rate adjustment condition.
8. A flow control device, comprising:
the queue evaluation unit is used for performing queue depth evaluation on the constructed cache queue when the rate evaluation is required under the condition of performing flow control based on a preset token bucket algorithm, so as to obtain the evaluation queue depth corresponding to the cache queue; the buffer queue is a queue constructed based on the token bucket algorithm and is used for storing data to be sent;
the judging unit is used for judging whether the current token bucket algorithm accords with a preset rate adjustment condition according to the evaluation queue depth;
a first determining unit, configured to determine a first rate if the current token bucket algorithm meets the rate adjustment condition; the first rate is a currently configured promise information rate in the token bucket algorithm; the promised information rate characterizes the data sending speed in the flow control process;
the identification unit is used for identifying the change rate of the cache queue to obtain the change rate of the queue corresponding to the cache queue;
The second determining unit is used for determining a rate adjustment amplitude according to the queue change rate and a preset rate range;
the adjusting unit is used for fine-adjusting the first rate based on the rate adjusting amplitude to obtain a second rate corresponding to the first rate;
and the updating unit is used for updating the promised information rate configured in the token bucket algorithm to the second rate, and carrying out flow control on the updated promised information rate so as to adjust the data transmission speed in the flow control process.
9. A storage medium comprising stored instructions, wherein the instructions, when executed, control a device in which the storage medium is located to perform a flow control method according to any one of claims 1 to 7.
10. An electronic device comprising a memory and one or more instructions, wherein the one or more instructions are stored in the memory and configured to be executed by the one or more processors to perform the flow control method of any of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310989947.9A CN116708310B (en) | 2023-08-08 | 2023-08-08 | Flow control method and device, storage medium and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310989947.9A CN116708310B (en) | 2023-08-08 | 2023-08-08 | Flow control method and device, storage medium and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116708310A true CN116708310A (en) | 2023-09-05 |
| CN116708310B CN116708310B (en) | 2023-09-26 |
Family
ID=87824368
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310989947.9A Active CN116708310B (en) | 2023-08-08 | 2023-08-08 | Flow control method and device, storage medium and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116708310B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150236955A1 (en) * | 2012-08-21 | 2015-08-20 | Paul Allen Bottorff | Congestion Notification in a Network |
| CN107743099A (en) * | 2017-08-31 | 2018-02-27 | 华为技术有限公司 | Data flow processing method, device and storage medium |
| WO2021197128A1 (en) * | 2020-03-30 | 2021-10-07 | 阿里巴巴集团控股有限公司 | Traffic rate-limiting method and apparatus |
| CN114520789A (en) * | 2022-02-21 | 2022-05-20 | 北京浩瀚深度信息技术股份有限公司 | Token bucket-based shared cache message processing method, device, equipment and medium |
| CN115348213A (en) * | 2022-08-12 | 2022-11-15 | 北京物芯科技有限责任公司 | Metering device, metering method and chip of TSN (transistor switched network) |
| CN115766591A (en) * | 2022-10-28 | 2023-03-07 | 中科驭数（北京）科技有限公司 | Fragmentation message flow rate limiting method, DPU fragmentation message forwarding method and device |
| CN115766592A (en) * | 2022-10-31 | 2023-03-07 | 中科驭数（北京）科技有限公司 | Flow rate limiting method based on priority, DPU message forwarding method and device |
-
2023
- 2023-08-08 CN CN202310989947.9A patent/CN116708310B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150236955A1 (en) * | 2012-08-21 | 2015-08-20 | Paul Allen Bottorff | Congestion Notification in a Network |
| CN107743099A (en) * | 2017-08-31 | 2018-02-27 | 华为技术有限公司 | Data flow processing method, device and storage medium |
| WO2021197128A1 (en) * | 2020-03-30 | 2021-10-07 | 阿里巴巴集团控股有限公司 | Traffic rate-limiting method and apparatus |
| CN114520789A (en) * | 2022-02-21 | 2022-05-20 | 北京浩瀚深度信息技术股份有限公司 | Token bucket-based shared cache message processing method, device, equipment and medium |
| CN115348213A (en) * | 2022-08-12 | 2022-11-15 | 北京物芯科技有限责任公司 | Metering device, metering method and chip of TSN (transistor switched network) |
| CN115766591A (en) * | 2022-10-28 | 2023-03-07 | 中科驭数（北京）科技有限公司 | Fragmentation message flow rate limiting method, DPU fragmentation message forwarding method and device |
| CN115766592A (en) * | 2022-10-31 | 2023-03-07 | 中科驭数（北京）科技有限公司 | Flow rate limiting method based on priority, DPU message forwarding method and device |
Non-Patent Citations (1)
| Title |
|---|
| ANITHA P等: "PQTBA: Priority Queue based Token Bucket Algorithm for congestion control in IoT network", 2023 IEEE 8TH INTERNATIONAL CONFERENCE FOR CONVERGENCE IN TECHNOLOGY (I2CT) * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116708310B (en) | 2023-09-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP0688481B1 (en) | Device and method for atm end system cell flow regulation | |
| US6643496B1 (en) | System, method, and apparatus for adjusting packet transmission rates based on dynamic evaluation of network characteristics | |
| US6333917B1 (en) | Method and apparatus for red (random early detection) and enhancements. | |
| US8520517B2 (en) | Switch fabric end-to-end congestion avoidance mechanism | |
| US9985899B2 (en) | Re-marking of packets for queue control | |
| EP2235894B1 (en) | A simple adaptive jitter buffering algorithm for network nodes | |
| US9699092B2 (en) | Systems and methods for dynamically adjusting QoS parameters | |
| US8081644B2 (en) | Method and device for controlling a queue buffer | |
| RU2000128051A (en) | DEVICE AND METHOD FOR DATA FLOW CONTROL IN A NETWORK NODE | |
| EP2033366B1 (en) | Network node and method for fast traffic measurement and monitoring | |
| CN112104562B (en) | Congestion control method and device, communication network and computer storage medium | |
| KR20130126816A (en) | Traffic management apparatus for controlling traffic congestion and method thereof | |
| JP5519696B2 (en) | Method and device for performing traffic control in a telecommunications network | |
| US7756028B2 (en) | Pulsed backpressure mechanism for reduced FIFO utilization | |
| EP2957079B1 (en) | Signalling congestion | |
| CN107222358A (en) | Wrap flux monitoring method per second and device | |
| CN106330758A (en) | Transfer method and device based on multilayer queue fluid control back pressure | |
| CN110266604B (en) | Air interface bandwidth self-adaptive control method, device and communication equipment | |
| CN116708310B (en) | Flow control method and device, storage medium and electronic equipment | |
| CN105450441A (en) | TCP-protocol-based weak network acceleration method and apparatus | |
| US8724458B2 (en) | Methods and devices for controlling data unit handling | |
| CA2457812C (en) | Method of dynamic adaptation for jitter buffering in packet networks | |
| EP0814585A2 (en) | Dynamic bandwidth estimation and adaptation in high speed packet switching networks | |
| US9083635B1 (en) | Enqueue policing systems and methods | |
| Kadhum et al. | The impact of the average packet arrival rate on the drop/mark probability of the Fast Congestion Notification (FN) mechanism |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| PE01 | Entry into force of the registration of the contract for pledge of patent right |
Denomination of invention: Flow control methods and devices, storage media and electronic devices Granted publication date: 20230926 Pledgee: Haidian Beijing science and technology enterprise financing Company limited by guarantee Pledgor: Beijing Aoxing Technology Co.,Ltd. Registration number: Y2024110000058 |
|
| PE01 | Entry into force of the registration of the contract for pledge of patent right |