WO2013000114A1 - Rate limit method and device for leaky bucket - Google Patents

Abstract

The present invention discloses a rate limit method for leaky buckets. When rate limit is performed for a set of messages which share a same leaky bucket but have different weight priorities, a total leaky bucket is divided into multiple sub-leaky buckets according to the number of the weight priorities and a scaling parameter, wherein the scaling parameter must be determined according to the requirements of jitter absorption by each weight priority traffic. After message-related information is received, parameters related to leaky bucket rate limit are obtained and the total number of tokens required to be added is calculated. According to the calculated total number of tokens, the status of the total leaky bucket after accepting the addition of the total tokens and the weight priority factor parameters of the sub-leaky buckets, the tokens are added to the sub-leaky buckets. According to the packet length of the received message and the number of tokens of the sub-leaky bucket corresponding to the weight priority of the message, the message is forwarded, discarded or marked. The present invention also discloses a rate limit device for leaky buckets accordingly. The present invention enables flexible rate limit for messages according to weight priorities, thereby improving quality of service of data network and user experience.

Description

 Method and device for leaking barrel P1⁄2

 The present invention relates to the field of data networks, and in particular, to a method and an apparatus for speed limit of a leaky bucket. Background technique

 In existing data networks, network congestion is often caused by the burstiness of packet traffic. In order to avoid network congestion and improve the quality of service (QoS) of the data network, the packet needs to be rate-limited at the receiving end. If the rate of the packet is lower than the specified rate, the packet is received normally. If the rate exceeds the specified rate, the packet is discarded or the packet is marked.

 At present, the commonly used method is to use the leaky bucket to limit the rate of packets. The commonly used standards based on the leaky bucket algorithm are RFC2697 and RFC2698, namely single-rate three-color double-barrel and dual-rate three-color double-barrel, RFC standard leaky bucket. The speed limit principle is shown in Figure 1. Specifically, the token is continuously filled into the leaky bucket at a specified rate until the leaky bucket is full. When the packet arrives, the packet length of the packet is compared with the number of tokens in the leaky bucket. If there are enough tokens in the leaky bucket, the packet is allowed to pass, and the packet of the packet is subtracted from the leaky bucket. The number of tokens corresponding to the long one; if the tokens in the leaky bucket are not enough, the text will be discarded, or the text will be marked.

 It can be seen that although RFC2697 and RFC2698 can limit the rate of packets, the service quality of packets with different priorities cannot be distinguished in the process of rate limiting. Therefore, the rate limit method of existing packets is not flexible enough. Improve data network service quality and user experience. Summary of the invention

In view of the above, the main purpose of the present invention is to provide a method and a device for speed limit of a leaky bucket, which can flexibly limit the rate of packets according to the weight priority, thereby improving the quality of the data network and the user. Experience.

 In order to achieve the above object, the technical solution of the present invention is achieved as follows:

 A method for limiting the speed of a leaky bucket, when a rate limit is set for a group of packets that share the same weighted priority, the total leaky bucket is divided into multiple sub-leak buckets according to the number of weight priorities and the proportional parameter. The ratio parameter is determined according to the requirement of each weight priority traffic absorption jitter, and the capacity of each sub-leak bucket is equal to the total leak bucket capacity, and the packet weight priority corresponds to the sub-leak bucket weight priority, and the method includes :

 After receiving the related information of the packet, the parameter related to the rate limit of the leaking bucket is obtained, and the related information of the packet includes at least: a packet length of the packet and a priority parameter of the packet;

 Calculating the total number of tokens to be added according to the obtained parameter related to the rate limit of the leaked bucket; adding a token to the sub-leakage bucket according to the calculated total number of tokens and the weight priority of the sub-leaked bucket; The packet length and the number of tokens in the sub-leak bucket corresponding to the weight priority of the packet, forwarding, or discarding, or marking the packet.

 After the packet is forwarded, discarded, or marked, the method further includes: updating parameters related to the leak rate limit, including the total leak bucket and the number of tokens after each sub-leak rate limit.

 The parameters related to the rate limit of the leaky bucket include: the capacity of the total leaky bucket, the weight priority factor, the total token addition rate, the time when the last speed limit occurs, the number of tokens in the total leaky bucket, and each sub-leak bucket Number of tokens in ,

 The parameters related to the rate limit of the leaking bucket are: updating the time when the last speed limit occurs is the current time, and updating the total leaky bucket and the number of tokens in each of the sub-leakage buckets as the speed limit.

 The parameter related to the rate limit of the leaky bucket further includes a capacity of each sub-leakage bucket or a ratio of sub-leakage bucket capacity division.

Calculating the total number of tokens to be added according to the obtained parameters related to the rate limit of the leaky bucket is: calculating a time difference between a time when the current rate limit occurs and a time when the last rate limit occurs, and calculating the time difference and the total token The product of the addition rate is taken as the total number of tokens that need to be added. The token is added to the total leaky bucket and each sub-leakage bucket according to the calculated total number of tokens and the weight priority of the sub-leaked bucket:

 In the first step, the total number of tokens calculated is added to the total leaky bucket. If the total leaky bucket is full, the total number of tokens of the leaky bucket is the total leaky bucket capacity, otherwise the total number of tokens added is added; If the total leaky bucket is full, the weighted priority sub-leak buckets are full. Otherwise, the total number of tokens to be added is divided according to the proportional relationship of the weight priority factors, and the sub-leak buckets provided for each weight priority are added. The number of tokens, and then add a token to the sub-leak bucket according to the number of tokens added to each weight priority sub-leak bucket. When the token is added, if some sub-leak buckets are full, but provide If there is any remaining token added to the sub-leak bucket, the remaining tokens are discarded, and the number of tokens of the total leaky bucket also reduces the number of discarded tokens.

 Transmitting, or discarding, or marking the packet according to the packet length of the packet and the number of tokens in the sub-leak bucket corresponding to the weight priority of the packet:

 Selecting a corresponding sub-leak bucket according to the weight priority of the packet, and comparing the number of tokens in the sub-leak bucket with the packet length of the packet, where the number of tokens in the sub-leak bucket is greater than or equal to The packet length of the packet is forwarded, and the number of tokens in the total leaky bucket and the sub-leak bucket is reduced by a number corresponding to the packet length; the token in the sub-leak bucket If the number is smaller than the packet length of the packet, the packet is discarded or the packet is marked, and the number of tokens in the total leaky bucket and all the sub-leaked buckets is unchanged.

 A leaky bucket speed limiting device includes: a total leaking bucket, a message receiving module, a token adding module, a parameter storage module, and a message processing module;

 The total leaky bucket is divided into multiple sub-leaked buckets according to the weight priority of the packet, and the packet weight priority corresponds to the sub-leakage bucket weight priority;

 The packet information receiving module is configured to receive information about the packet, where the information about the packet includes at least: a packet length of the packet and a priority parameter of the packet;

The token adding module is configured to receive information about the packet in the packet information receiving module. After that, the parameters related to the leak rate limit of the leaky bucket are obtained from the parameter storage module; and the total number of tokens to be added is calculated according to the obtained parameters related to the speed limit of the leaky bucket; and the total number of tokens and the sub-leaked bucket according to the calculation The weight priority adds tokens to the sub-leak buckets;

 The parameter storage module is configured to maintain a parameter related to a leak rate limit of the leaky bucket;

 The packet processing module is configured to forward, discard, or mark the packet according to the packet length of the packet and the number of tokens in the sub-leak bucket corresponding to the weight priority of the packet.

 The parameter storage module is further configured to update a parameter related to a leak rate limit of the leaky bucket after the packet processing module forwards, or discards, or marks the message.

 The parameter related to the leak rate limit of the leaked bucket stored by the parameter storage module includes: a total leaky bucket capacity, a weight priority factor, a total token addition rate, a time when the last speed limit occurs, a total leaky bucket, and each sub-leak bucket Number of tokens in ,

 The parameter storage module updates the parameters related to the leak rate limit of the leaking bucket as follows: the time when the last time limit rate is updated is the current time, and the number of the tokens in the total leaky bucket and each sub-leaked bucket is updated after the speed limit.

 The parameter related to the leak rate limit of the leaked bucket stored by the parameter storage module further includes: a capacity of each sub-leaked bucket or a proportion of a sub-leaked bucket capacity.

 The token adding module calculates the total number of tokens to be added according to the obtained parameters related to the rate limit of the leaky bucket:

 The time difference between the time when the current rate limit occurs and the time when the last rate limit occurred is calculated, and the product of the time difference and the total token addition rate is calculated as the total number of tokens to be added.

 The token adding module adds a token to the sub-leakage bucket according to the calculated total number of tokens and the weight priority of the sub-leak bucket:

In the first step, the total number of tokens calculated is added to the total leaky bucket. If the total leaky bucket is full, the total number of tokens of the leaky bucket is the total leaky bucket capacity, otherwise the total number of tokens added is added; If the total leaky bucket is full, the weight priority sub-leak buckets are full, otherwise the total number of tokens to be added will be weighted according to the weight. The proportion relationship of the priority factors is divided, and the number of tokens added to each of the weight priority sub-leak buckets is obtained, and then the number of tokens added to each weight priority sub-leak bucket is added to the sub-leak bucket. The token is added. When the token is added, if some sub-leaked buckets are full, but the tokens added to the sub-leaked buckets are still left, the remaining tokens are discarded, and the total leaked buckets are discarded. The number of tokens also reduces the number of tokens discarded.

 The packet processing module forwards, discards, or marks the packet according to the packet length of the packet and the number of tokens in the sub-leak bucket corresponding to the weight priority of the packet:

 Selecting a corresponding sub-leak bucket according to the weight priority of the packet, and comparing the number of tokens in the sub-leak bucket with the packet length of the packet, where the number of tokens in the sub-leak bucket is greater than or If the packet length is equal to the packet length, the packet is forwarded, and the number of tokens in the total leaky bucket and the sub-leaked bucket is reduced by a number corresponding to the packet length; If the number of tokens is smaller than the packet length of the packet, the packet is discarded or marked, and the number of tokens in the total leaky bucket and all sub-leaked buckets is unchanged.

The method and the device for limiting the rate of the leaking buckets of the present invention treat the packets with different weight priorities differently, and divide the total leaking bucket into multiple sub-leaked buckets according to the requirements of the weighting jitter of each weight priority traffic, where each weight priority corresponds to the A sub-leak bucket, when the token is added, the tokens added to the sub-leak bucket are different according to the corresponding weight priorities. Generally, the tokens added to the high-weight priority sub-leak bucket are more than provided. The token added by the low-weight priority sub-leak bucket performs forwarding, discarding, or marking operations on the received packet according to the token in the sub-leak bucket corresponding to the packet weight priority. The present invention compensates for the insufficiency of the packet loss rate of the traditional buckets, and the packets with different weight priorities have a fixed proportion of pass and drop probabilities under the same rate limit, that is, high-weight priority packets. In the case of network congestion, there is a relatively high probability of passing, while a packet with a low weight has a relatively high probability of dropping. Therefore, the present invention can flexibly limit the rate of packets according to the weight priority, thereby improving the data network. Quality of service and user experience, in addition, The hardware design of the function can save the hardware resources of the network. DRAWINGS

 Figure 1 is a schematic diagram of the principle of the leaky bucket speed limit of the existing RFC standard;

 2 is a schematic flow chart of a method for speed limit of a leaky bucket according to the present invention;

 3 is a schematic diagram of a principle of a speed limit of a leaky bucket according to the present invention;

 FIG. 4 is a schematic flow chart of a method for speed limit of a leaky bucket according to the present invention. detailed description

 The basic idea of the present invention is: for a group of packets having different weight priorities, each weight priority corresponds to a sub-leak bucket in the total leaky bucket, and is added to the sub-leak bucket when the token is added. The tokens are different according to the corresponding weight priorities. Generally, the tokens added to the high-weight priority sub-leak bucket are more than the tokens added to the low-weight priority sub-leak bucket. For the received packets, according to the received packets, The token in the sub-leak bucket corresponding to the weight priority of the packet performs a forwarding, discarding or marking operation.

 In the present invention, the packet for the rate limit of the leaky bucket may be divided according to at least two weight priorities (for example, according to the packet type), and correspondingly, the leaked bucket capacity is divided into at least two sub-weights according to different weight priorities. In the leaky bucket, the packet weight priority corresponds to the sub-leak bucket weight priority.

 It should be noted that the capacity of each sub-leak bucket can be divided according to the proportional relationship of the weight priority factor (such as the weight priority factors respectively, wl, w2, w3 wn ), or can be divided according to actual needs, in general, The capacity of the high-weight priority sub-leaked bucket is large, and the capacity of the low-weight priority sub-leaked bucket is small, and the sum of all sub-leaked buckets is equal to the total leaky bucket capacity, that is, the total leaky bucket capacity is expressed as BS, The capacities of the sub-leak barrels are expressed as BS1, BS2, BS3, ..., BSn, respectively, and they satisfy the following relationship: BS = BS1 + BS2 + BS3 + ... + BSn.

In the present invention, the token addition rate of the sub-leak bucket is divided according to the proportional relationship of the weight priority factors (wl, w2, w3, ..., wn), if the total token addition rate is expressed as IR (Information Rate), the token addition rate of the sub-leak bucket is expressed as IR1, IR2, IR3...IRn, respectively, and they satisfy the following relationship:

 IR1 =IR*wl;

 IR2 = IR*w2;

 IR3 = IR*w3;

IRn = IR*wn;

 IR = IR1 + IR2 + IR3 + ... + IRn.

 2 is a schematic flowchart of a method for speed limit of a leaky bucket according to the present invention. As shown in FIG. 2, the method includes the following steps: Step 201: After receiving the related information of the packet, obtain parameters related to the rate limit of the leaky bucket.

 Here, the information related to the packet includes: a packet length of the packet and a priority parameter of the packet, where the parameter related to the leak rate limit may include, but is not limited to:

 (1) The capacity of the total leaky bucket;

 (2) weight priority factor;

 (3) The total token addition rate, also referred to as the total rate limit rate, is the sum of the rate of each sub-leaked token add-on;

 (4) The moment when the last speed limit occurred;

 (5) The number of tokens in the total leaky bucket and each sub-leakage bucket. If the speed limit calculation occurred before, it refers to the number of tokens after the last speed limit operation of the same group of packets.

If the sub-leakage capacity is divided according to the weight priority factor, the capacity of each sub-leakage can be further obtained according to the capacity of the total leaked bucket and the weight priority factor; if the sub-leakage capacity is divided according to the actual demand, the leaky bucket is The speed-related parameters also need to include the capacity of each sub-leaked bucket or the proportion of the sub-leaked bucket capacity. The capacity of each sub-leaked bucket can be obtained according to the total leaky bucket capacity and the proportion of each sub-leaked bucket capacity, but in any case, each The sub-leakage capacity must meet the requirements of the weight-absorption jitter of each weight priority. In practical applications, both hardware and software implementations need to maintain the above parameter configuration. Step 202: Calculate the total number of tokens to be added according to the obtained parameters related to the rate limit of the leaky bucket.

 Specifically, the time difference between the time when the current rate limit occurs and the time when the last rate limit occurs is calculated, and the product of the time difference and the total token addition rate is calculated, and the total number of tokens to be added is obtained.

 Step 203: Add a token to the total leak bucket and each sub-leak bucket according to the calculated total number of tokens and the weight priority of the sub-leak bucket.

 Specifically, in the first step, the total number of tokens calculated is added to the total leaky bucket. If the total leaky bucket is full, the total number of tokens of the leaky bucket is the total leaky bucket capacity, otherwise, the total number of tokens added; In the second step, if the total leaky bucket is full, the weighted priority sub-leak buckets are full, otherwise the total number of tokens to be added is divided according to the proportional relationship of the weight priority factors, and the sub-leakage provided to each weight priority is obtained. The bucket adds the number of tokens, and then adds a token to the sub-leak bucket according to the number of tokens added to each weight priority sub-leak bucket to obtain the number of tokens of the current ownership heavy priority sub-leak bucket.

 For example, if the number of token additions of the child leaky bucket is strictly in accordance with the proportional relationship of the weight priority factor (wl, w2, w3, ..., wn) to obtain the total number of token additions, the total number of tokens to be added is represented. For delta_token, the token addition amount of each sub-leak bucket is expressed as delta_tokenl, delta_token2, delta_token3, ..., delta_tokenn respectively, then the gate satisfies the relationship under the mouth:

 Delta-token 1 = delta-token *wl;

 Delta_token2 = delta-token *w2;

 Delta_token3 = delta-token *w3; delta_tokenn = delta-token* old;

 Delta—token = delta—token 1+ delta_token2 + ... + delta—tokenn.

It should be noted that, when the token is added, if the sub-leaked bucket is full, but the token provided for the sub-leaked bucket is still left, the remaining token is discarded, and the sub-leaked bucket is ordered. The number of cards is the corresponding sub-leaked bucket capacity, and the number of tokens in the total leaky bucket is also reduced by the corresponding number of discards; If the sub-leaked bucket is not full, but the token provided for the sub-leaked bucket has been exhausted, the number of tokens of the sub-leaked bucket is the number of tokens in the sub-leaked bucket obtained in step 201 and correspondingly added. The sum of the number of tokens.

 Step 204: Forward, or discard, or mark the packet according to the packet length of the packet and the number of tokens in the sub-leak bucket corresponding to the weight priority of the packet.

 Specifically, the corresponding sub-leak bucket is selected according to the packet weight priority, and then the number of tokens in the sub-leak bucket is compared with the packet length of the packet to determine whether to forward the packet. If the number of tokens in the leaky bucket is greater than or equal to the packet length of the packet, the packet is forwarded, and the number of tokens in the total leaky bucket and the sub-leaked bucket is decreased and the packet length is long. Corresponding number; if the number of tokens in the sub-leaked bucket is smaller than the packet length of the packet, discarding the packet or marking the packet, the total leaking bucket and all the sub-leaked buckets The number of tokens does not change.

 The principle of the rate limit of the leaky buckets in the present invention is as shown in FIG. 3, and it can be seen that for the packets with different weight priorities, the number of tokens of the sub-leak buckets of each weight priority is strictly according to the weight priority factor (wl, w2). The proportional relationship of , w3, ..., wn ) is added, so the messages of different weight priorities can be passed according to the proportional relationship of the weight priority factors (wl, w2, w3, ..., wn ). When the rate limit of the packet is leaked, the rate limit can be differentiated according to the weight priority of the packet.

 Step 205: Update the parameters related to the leak rate limit of the leaky bucket.

 Here, it mainly refers to updating the current time when the last speed limit occurs as the current time, and updating the total leaky bucket and the number of tokens in each sub-leaked bucket as the speed limit.

 It should be noted that if the present invention is implemented by hardware, the logic and parameter storage resources of the speed limit calculation will increase linearly with the number of sub-leakage buckets, and comprehensive evaluation needs to be performed according to actual needs. The detailed flow of the method for limiting the speed of the leaky bucket of the present invention is shown in FIG.

 The present invention also provides a leaky bucket speed limiting device, which includes: a total leaking bucket, a message information receiving module, a token adding module, a parameter storage module, and a message processing module;

The total leaky bucket is divided into multiple sub-leaked buckets according to the weight priority of the packet, and the packet weight priority corresponds to the sub-leakage bucket weight priority; The packet information receiving module is configured to receive related information of the packet, where the information about the packet includes at least: a packet length of the packet and a priority parameter of the packet;

 The token adding module is configured to: after the packet information receiving module receives the related information of the packet, acquire a parameter related to the rate limit of the leaked bucket from the parameter storage module; and obtain a parameter related to the rate limit of the leaked bucket according to the acquired parameter Calculating the total number of tokens to be added; and adding tokens to the total leaky bucket and each of the sub-leakage buckets according to the calculated total number of tokens and the weight priority of the sub-leakage buckets;

 The parameter storage module is configured to maintain a parameter related to a leak rate limit of the leaky bucket;

 The packet processing module is configured to forward, discard, or mark the packet according to the packet length of the packet and the number of tokens in the sub-leak bucket corresponding to the weight priority of the packet.

 The parameter storage module is further configured to update a parameter related to a leak rate limit of the leaky bucket after the packet processing module forwards, or discards, or marks the message.

 The parameter related to the leak rate limit of the leaked bucket stored by the parameter storage module includes: a total leaky bucket capacity, a weight priority factor, a total token addition rate, a time when the last speed limit occurs, a total leaky bucket, and each sub-leak bucket Number of tokens in ,

 The parameter storage module updates the parameters related to the leak rate limit of the leaking bucket as follows: the time when the last time limit rate is updated is the current time, and the number of the tokens in the total leaky bucket and each sub-leaked bucket is updated after the speed limit.

 The parameter related to the leak rate limit of the leaked bucket stored by the parameter storage module further includes: a capacity of each sub-leaked bucket or a proportion of a sub-leaked bucket capacity.

 The token adding module calculates the total number of tokens to be added according to the obtained parameters related to the rate limit of the leaky bucket:

 The time difference between the time when the current rate limit occurs and the time when the last rate limit occurred is calculated, and the product of the time difference and the total token addition rate is calculated as the total number of tokens to be added.

The token adding module adds a token to the total leaking bucket and each sub-leaked bucket according to the calculated total number of tokens and the weight priority of the sub-leaked bucket: In the first step, the total number of tokens calculated is added to the total leaky bucket. If the total leaky bucket is full, the total number of tokens of the leaky bucket is the total leaky bucket capacity, otherwise the total number of tokens added is added; If the total leaky bucket is full, the weighted priority sub-leak buckets are full. Otherwise, the total number of tokens to be added is divided according to the proportional relationship of the weight priority factors, and the sub-leak buckets provided for each weight priority are added. The number of tokens, and then add a token to the sub-leak bucket according to the number of tokens added to each weight priority sub-leak bucket. When the token is added, if the sub-leak bucket is full, but is provided to If there is any remaining token added by the sub-leak bucket, the remaining tokens are discarded, and the total leaky bucket also reduces the number of discarded tokens accordingly.

 The packet processing module forwards, or discards, or marks the packet according to the packet length of the received packet and the number of tokens in the sub-leak bucket corresponding to the weight priority of the packet:

 Selecting a corresponding sub-leak bucket according to the weight priority of the packet, and comparing the number of tokens in the sub-leak bucket with the packet length of the packet, where the number of tokens in the sub-leak bucket is greater than or If the packet length is equal to the packet length, the packet is forwarded, and the number of tokens in the total leaky bucket and the sub-leaked bucket is reduced by a number corresponding to the packet length; If the number of tokens is smaller than the packet length of the packet, the packet is discarded or marked, and the number of tokens in the total leaky bucket and all sub-leaked buckets is unchanged.

 On the basis of the RFC leaky bucket algorithm standard, the present invention makes up for the shortage of the packet priority of the traditional leaky bucket speed limit mode for the shared speed limit leaky bucket, so that different priority packets are in the same Under the condition of speed limit, there is a fixed proportion of pass and drop probability, which improves the combination, and the hardware design of part of the scheduling function can be omitted, thereby saving network hardware resources.

 The above is only the preferred embodiment of the present invention and is not intended to limit the scope of the present invention.

Claims

Claim  A method for limiting the speed of a leaky bucket, wherein when the rate limit is set for a group of packets sharing the same leaky bucket but having different weight priorities, the number of weighted buckets according to the weight priority and the proportional parameter are used. Dividing into multiple sub-leaked buckets, the ratio parameter is determined according to the requirements of each weight priority traffic absorption jitter, and the capacity of each sub-leak bucket is equal to the total leaked bucket capacity, the packet weight priority and the sub-drain bucket weight priority. Correspondingly, the method includes:  After receiving the related information of the packet, the parameter related to the rate limit of the leaking bucket is obtained, and the related information of the packet includes at least: a packet length of the packet and a priority parameter of the packet;  Calculating the total number of tokens to be added according to the obtained parameter related to the rate limit of the leaked bucket; adding a token to the sub-leakage bucket according to the calculated total number of tokens and the weight priority of the sub-leaked bucket; The packet length and the number of tokens in the sub-leak bucket corresponding to the weight priority of the packet, forwarding, or discarding, or marking the packet.  The method for limiting the rate of a leaky bucket according to claim 1, wherein after the forwarding, or discarding, or marking the message, the method further comprises: updating parameters related to the rate limit of the leaky bucket, including The number of tokens after the total leaky bucket and each sub-leakage speed limit.  3. The leaky barrel speed limiting method according to claim 2, wherein  The parameters related to the rate limit of the leaky bucket include: the capacity of the total leaky bucket, the weight priority factor, the total token addition rate, the time when the last speed limit occurs, the number of tokens in the total leaky bucket, and each sub-leak bucket Number of tokens in ,  The parameters related to the rate limit of the leaking bucket are: updating the time when the last speed limit occurs is the current time, and updating the total leaky bucket and the number of tokens in each of the sub-leakage buckets as the speed limit.  The method for limiting the speed of a leaky bucket according to claim 3, wherein the parameter related to the speed limit of the leaky bucket further comprises a capacity of each sub-drain bucket or a ratio of sub-leakage bucket capacity division. The method for limiting the speed of the leaky bucket according to claim 3, wherein the total number of tokens to be added according to the obtained parameters related to the speed limit of the leaky bucket is: The time difference between the time when the current rate limit occurs and the time when the last speed limit occurred is calculated, and the product of the time difference and the total token addition rate is calculated as the total number of tokens to be added.  The method for rate limiting a leaky bucket according to any one of claims 1 to 5, wherein the total number of tokens and the priority of the sub-leaked buckets are based on the total leaky bucket and each of the sub-leakage buckets. Add the token as:  In the first step, the total number of tokens calculated is added to the total leaky bucket. If the total leaky bucket is full, the total number of tokens of the leaky bucket is the total leaky bucket capacity, otherwise the total number of tokens added is added; If the total leaky bucket is full, the weighted priority sub-leak buckets are full. Otherwise, the total number of tokens to be added is divided according to the proportional relationship of the weight priority factors, and the sub-leak buckets provided for each weight priority are added. The number of tokens, and then add a token to the sub-leak bucket according to the number of tokens added to each weight priority sub-leak bucket. When the token is added, if some sub-leak buckets are full, but provide If there is any remaining token added to the sub-leak bucket, the remaining tokens are discarded, and the number of tokens of the total leaky bucket also reduces the number of discarded tokens.  The method for rate limiting the leaky bucket according to claim 6, wherein the packet length and the number of tokens in the sub-leak bucket corresponding to the weight priority of the packet are forwarded, or discarded. , or mark the >3⁄4 text as:  Selecting a corresponding sub-leak bucket according to the weight priority of the packet, and comparing the number of tokens in the sub-leak bucket with the packet length of the packet, where the number of tokens in the sub-leak bucket is greater than or equal to The packet length of the packet is forwarded, and the number of tokens in the total leaky bucket and the sub-leak bucket is reduced by a number corresponding to the packet length; the token in the sub-leak bucket If the number is smaller than the packet length of the packet, the packet is discarded or the packet is marked, and the number of tokens in the total leaky bucket and all the sub-leaked buckets is unchanged.  A leaky bucket speed limiting device, the device comprising: a total leaking bucket, a message information receiving module, a token adding module, a parameter storage module, and a message processing module; The total leaky bucket is divided into multiple sub-leaked buckets according to the weight priority of the packet, and the weight of the packet is prioritized. The level corresponds to the sub-leak bucket weight priority;  The packet information receiving module is configured to receive information about the packet, where the information about the packet includes at least: a packet length of the packet and a priority parameter of the packet;  The token adding module is configured to: after the packet information receiving module receives the related information of the packet, acquire a parameter related to the rate limit of the leaked bucket from the parameter storage module; and obtain a parameter related to the rate limit of the leaked bucket according to the acquired parameter Calculate the total number of tokens to be added; and add tokens to the sub-leak buckets based on the calculated total number of tokens and the weight priority of the sub-leak buckets;  The parameter storage module is configured to maintain a parameter related to a leak rate limit of the leaky bucket;  The packet processing module is configured to forward, discard, or mark the packet according to the packet length of the packet and the number of tokens in the sub-leak bucket corresponding to the weight priority of the packet.  9. The leaky barrel speed limiting device according to claim 8, wherein:  The parameter storage module is further configured to update a parameter related to a leak rate limit of the leaky bucket after the packet processing module forwards, or discards, or marks the message.  10. The leaky barrel speed limiting device according to claim 9, wherein:  The parameter related to the leak rate limit of the leaked bucket stored by the parameter storage module includes: a total leaky bucket capacity, a weight priority factor, a total token addition rate, a time when the last speed limit occurs, a total leaky bucket, and each sub-leak bucket Number of tokens in ,  The parameter storage module updates the parameters related to the leak rate limit of the leaking bucket as follows: the time when the last time limit rate is updated is the current time, and the number of the tokens in the total leaky bucket and each sub-leaked bucket is updated after the speed limit.  The leaky bucket speed limiting device according to claim 10, wherein the parameters related to the leaky bucket speed limit stored by the parameter storage module further include: a capacity of each sub-leaked bucket or a sub-leakage bucket capacity division ratio .  12. The leaky barrel speed limiting device according to claim 10, wherein: The token adding module calculates the required addition according to the obtained parameter related to the leak rate limit of the leaky bucket. The total number of tokens is:  The time difference between the time when the current rate limit occurs and the time when the last rate limit occurred is calculated, and the product of the time difference and the total token addition rate is calculated as the total number of tokens to be added.  The leaky bucket speed limit device according to any one of claims 8 to 12, wherein the token adding module performs the sub-leak bucket according to the calculated total number of tokens and the weight priority of the sub-leak bucket The token is added as:  In the first step, the total number of tokens calculated is added to the total leaky bucket. If the total leaky bucket is full, the total number of tokens of the leaky bucket is the total leaky bucket capacity, otherwise the total number of tokens added is added; If the total leaky bucket is full, the weighted priority sub-leak buckets are full. Otherwise, the total number of tokens to be added is divided according to the proportional relationship of the weight priority factors, and the sub-leak buckets provided for each weight priority are added. The number of tokens, and then add a token to the sub-leak bucket according to the number of tokens added to each weight priority sub-leak bucket. When the token is added, if some sub-leak buckets are full, but provide If there is any remaining token added to the sub-leak bucket, the remaining tokens are discarded, and the number of tokens of the total leaky bucket also reduces the number of discarded tokens.  14. The leaky barrel speed limiting device according to claim 13, wherein:  The packet processing module forwards, discards, or marks the packet according to the packet length of the packet and the number of tokens in the sub-leak bucket corresponding to the weight priority of the packet:  Selecting a corresponding sub-leak bucket according to the weight priority of the packet, and comparing the number of tokens in the sub-leak bucket with the packet length of the packet, where the number of tokens in the sub-leak bucket is greater than or If the packet length is equal to the packet length, the packet is forwarded, and the number of tokens in the total leaky bucket and the sub-leaked bucket is reduced by a number corresponding to the packet length; If the number of tokens is smaller than the packet length of the packet, the packet is discarded or marked, and the number of tokens in the total leaky bucket and all sub-leaked buckets is unchanged.