WO2015149488A1 - 一种令牌桶限速方法、装置及计算机存储介质 - Google Patents

一种令牌桶限速方法、装置及计算机存储介质 Download PDF

Info

Publication number
WO2015149488A1
WO2015149488A1 PCT/CN2014/087112 CN2014087112W WO2015149488A1 WO 2015149488 A1 WO2015149488 A1 WO 2015149488A1 CN 2014087112 W CN2014087112 W CN 2014087112W WO 2015149488 A1 WO2015149488 A1 WO 2015149488A1
Authority
WO
WIPO (PCT)
Prior art keywords
token
current
packet
tokens
time
Prior art date
Application number
PCT/CN2014/087112
Other languages
English (en)
French (fr)
Inventor
殷俊杰
庞鸿光
Original Assignee
深圳市中兴微电子技术有限公司
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 深圳市中兴微电子技术有限公司 filed Critical 深圳市中兴微电子技术有限公司
Priority to DK14887743.4T priority Critical patent/DK3128704T3/da
Priority to EP14887743.4A priority patent/EP3128704B1/en
Priority to US15/301,323 priority patent/US10135740B2/en
Publication of WO2015149488A1 publication Critical patent/WO2015149488A1/zh

Links

Images

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
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0876—Network utilisation, e.g. volume of load or congestion level
    • H04L43/0894—Packet rate
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/16—Threshold monitoring
    • 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/12—Avoiding congestion; Recovering from congestion
    • 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/24—Traffic characterised by specific attributes, e.g. priority or QoS

Definitions

  • the present invention relates to the field of QoS (Quality of Service) of a data network, and in particular, to a token bucket speed limit method, device, and computer storage medium.
  • QoS Quality of Service
  • a method for avoiding network congestion is to limit the rate of the packet at the receiving end. If the rate of the packet is lower than the specified rate, the packet is received normally. If the rate of the packet exceeds the specified rate, the packet is discarded. .
  • the existing method is to use the token bucket to limit the rate of packets.
  • the standards of the token bucket algorithm are RFC2697 and RFC2698, that is, single-rate three-color dual-bucket and dual-rate three-color dual-bucket; existing token bucket limit.
  • the speed map is shown in Figure 1.
  • the token bucket is in a state of being “empty” for a long time. Therefore, the tokens remaining in the token bucket can only satisfy the short packet passing. The long package is discarded; therefore, the speed limit of the long package is not guaranteed.
  • the present invention mainly provides a token bucket speed limit method, device and computer storage medium.
  • the embodiment of the invention provides a token bucket speed limit method, and the method includes:
  • the network node device obtains the token bucket parameter according to the attribute of the packet
  • the comparison between the current number of tokens and the current packet length is performed, and the packet is processed according to the comparison result.
  • the network node device obtains the token bucket parameter according to the attribute of the packet: the network node device searches for the token bucket parameter carried in the packet data packet by using the index of the packet data packet;
  • the token bucket parameters include: the token addition rate, the arrival time of the previous packet, the number of tokens after the token bucket limits the rate of the previous packet, and the token bucket capacity.
  • the obtaining the current number of tokens according to the time threshold and the token bucket parameter includes: determining, by the network node device, a time difference according to a time of arrival of a previous packet in the token bucket parameter; according to a time threshold, the time difference And the token addition rate in the token bucket parameter determines the amount of the current message arrival time token added; and according to the current message arrival time token addition amount and the last packet rate limit in the token bucket parameter The number of tokens after the operation determines the current number of tokens.
  • the network node device determines that the time difference is: subtracting the current message arrival time from the previous message arrival time to obtain a time difference.
  • the adding amount of the current packet arrival time token according to the time threshold and the time difference is: comparing the time threshold and the time difference, and when the time difference is greater than the time threshold, the current packet arrival time token The added amount is equal to the product of the time difference and the token addition rate; when the time difference is less than or equal to the time threshold, the current message arrival time token is added equal to zero.
  • the current number of tokens is obtained according to the added amount of the current packet arrival time token: the current number of tokens is equal to the token bucket's rate limiting operation on the previous packet.
  • the sum of the number of tokens and the added amount of the current packet arrival time token, and the maximum value of the current token number is the token bucket capacity in the token bucket parameter.
  • comparing the current number of tokens with the current packet length, and comparing the packets according to the comparison result including: comparing the current number of tokens with the current packet length, When the current number of tokens is greater than or equal to the current packet length, the current packet is forwarded, and the current number of tokens in the token bucket is reduced by a number equal to the current packet length; when the current token number is less than When the current packet length is exceeded, the packet is discarded, and the current number of tokens in the token bucket does not change.
  • the embodiment of the invention further provides a token bucket speed limit device, the device comprising: a parameter acquisition module, a determination module and a message processing module; wherein
  • a parameter obtaining module configured to obtain a token bucket parameter according to an attribute of the packet
  • a determining module configured to determine a current number of tokens according to a time threshold and the token bucket parameter
  • the packet processing module is configured to compare the current number of tokens with the current packet length, and process the packet according to the comparison result.
  • the parameter obtaining module is specifically configured to search for a token bucket parameter carried in a packet data packet by using an index of the packet data packet;
  • the token bucket parameters include: the token addition rate, the arrival time of the previous packet, the number of tokens after the token bucket limits the rate of the previous packet, and the token bucket capacity.
  • the determining module includes: a time difference determining module, a token adding amount determining module, and a token quantity determining module;
  • a time difference determining module configured to determine a time difference according to a time of arrival of a previous message in the token bucket parameter
  • a token adding amount determining module configured to determine, according to a time threshold, the time difference, and a token adding rate in the token bucket parameter, an added amount of a current packet arrival time token
  • a token quantity determining module configured to add, according to the current message arrival time token, The number of tokens after the last packet rate limit operation in the token bucket parameter determines the current number of tokens.
  • the time difference determining module is specifically configured to obtain a time difference by subtracting the current message arrival time from the previous message arrival time.
  • the token adding amount determining module is specifically configured to compare the time threshold and the time difference. When the time difference is greater than the time threshold, the time difference is multiplied by the token adding rate to obtain the current packet arrival time. The added amount of the token; when the time difference is less than or equal to the time threshold, the current message arrival time token is added equal to zero;
  • the token quantity determining module is specifically configured to add the number of tokens after the token bucket is subjected to the rate limiting operation of the previous packet and the added amount of the current packet arrival time token.
  • the current number of tokens, and the maximum value of the current number of tokens is the token bucket capacity in the token bucket parameter.
  • the packet processing module is configured to compare the current number of tokens with the current packet length, and forward the current packet when the current number of tokens is greater than or equal to the current packet length. And the number of tokens in the token bucket is reduced by the same number as the current packet length. When the current number of tokens is smaller than the current packet length, the packet is discarded, and the number of tokens in the token bucket is maintained. .
  • the computer storage medium provided by the embodiment of the present invention stores a computer program for executing the token bucket speed limit method.
  • the network node device obtains the token bucket parameter according to the attribute of the packet, and obtains the current token according to the preset time threshold and the token bucket parameter.
  • the quantity compares the current number of tokens with the current packet length, and processes the packet according to the comparison result; thus, the token bucket can overcome the problem of being in a short-term "empty" state for a long time, so that the packet is long and short. Get equal token service opportunities and improve the quality of long-package services.
  • FIG. 1 is a schematic diagram of a current linear token bucket speed limit
  • FIG. 2 is a schematic flowchart of a token bucket speed limit method according to an embodiment of the present invention
  • FIG. 3 is a schematic diagram of a rate limit of a token bucket according to an embodiment of the present disclosure
  • FIG. 4 is a schematic structural diagram of a token bucket speed limit device according to an embodiment of the present invention.
  • FIG. 5 is a schematic structural diagram of a determining module according to an embodiment of the present invention.
  • the network node device obtains the token bucket parameter according to the attribute of the packet; and obtains the current token number according to the set time threshold and the token bucket parameter; compares the current token number with the current The length of the packet is processed according to the comparison result.
  • the flow of the token bucket speed limit method provided by the embodiment of the present invention is as shown in FIG. 1 , and the method mainly includes the following steps:
  • Step 201 The network node device acquires the token bucket parameter according to the attribute of the packet.
  • the network node device searches for the token bucket parameter carried in the packet data packet by using an index of the packet data packet.
  • the message is a currently received message or a message data packet; the attribute of the message may be an index of the message data packet.
  • the token bucket parameter includes: a token addition rate token_rate, a previous packet arrival time time_last, a token bucket token_last token_last token rate, and a token bucket capacity bucket_size;
  • the token bucket capacity bucket_size is used to limit the total number of tokens in the token bucket. For example, if the capacity bucket_size of a token bucket is 100 Mbit, the token bucket can accommodate a maximum of 100 Mbit tokens. The card will overflow the token bucket.
  • the previous message is a report before the currently received message or packet data packet. Text or a message packet.
  • Step 202 The network node device determines the current number of tokens according to a time threshold (time_threshhold) and the token bucket parameter.
  • the network node device determines the time difference delta_time according to the arrival time of the last packet in the token bucket parameter, and determines the current packet according to the time threshold time_threshhold, the time difference delta_time, and the token addition rate in the token bucket parameter.
  • the amount of arrival tokens delta_token of the arrival time token; and the current number of tokens token_current is determined according to the added amount delta_token of the current packet arrival time token and the number of tokens of the previous packet in the token bucket parameter .
  • the time threshold is a preset value according to an actual situation.
  • the current message arrival time time_now is 10 ms
  • the previous message arrival time time_last is 6 ms
  • the time difference delta_time is equal to 4 ms by the above algorithm
  • time_threshhold can divide the addition of the token bucket token into a random block, that is, add a token to the token bucket every time (this time is greater than the time threshold).
  • the number of tokens added will be relatively large. Therefore, the total number of tokens in the token bucket will be maintained at a large amount each time it is added, so that the token is long or short, regardless of whether the currently arriving packet is a long packet or a short packet. The total amount is sufficient to serve the current message, so that the long package obtains the same token service opportunity as the short package;
  • the time threshold time_threshhold may be a preset threshold; the setting of the time threshold time_threshhold may not be too large, and the token overflow in the token bucket may occur due to the excessive event, resulting in loss of the speed limit bandwidth, and may not be too small, too small The effect of improving the quality of the long-packet rate-limiting service is not achieved; the time threshold value time_threshhold is set according to the sending rate of the packet and the token adding rate of the token bucket;
  • the current message arrival time is 10ms
  • the time_threshhold 3ms set in advance; according to the above method:
  • Delta_time 4ms; 4ms is greater than the time threshold of 3ms; therefore,
  • the number of the current tokens token_current is obtained according to the added amount of the current packet arrival time token.
  • the token_current is equal to the token number of the token bucket.
  • Step 203 The network node device compares the current number of tokens with the current packet length, and performs corresponding processing on the packet according to the comparison result.
  • the current number of tokens token_curren is 5032 bits. If the current packet length is 100 bytes, that is, 800 bits, the packet length is less than token_curren, indicating that the token in the token bucket is sufficient for the packet. The token bucket forwards the packet, and the number of tokens in the token bucket is reduced by 800 bits. The number of tokens in the current token bucket is 4232 bits. If the current packet length is 1000 bytes, that is, 8000 bits, the packet length. If the number of tokens in the token bucket is insufficient and the number of tokens in the token bucket is insufficient, the packet is discarded. The number of tokens in the token bucket is still 5032 bits.
  • FIG. 3 is a schematic diagram of a rate limit of a token bucket according to an embodiment of the present invention. As shown in the figure, when adding a token to a token bucket, it is first determined whether the time difference delta_time is greater than a time threshold time_threshhold, when the time is greater than the time Add the token to the token bucket when the threshold time_threshhold, otherwise the token is not added.
  • the time difference delta_time is the time difference between the current message arrival time time_now and the previous message arrival time time_last;
  • the time threshold time_threshhold is a preset threshold for adding the token to the random block instead of adding it linearly;
  • the current number of tokens in the token bucket token_current is the sum of the token add amount delta_token and the token number token_last of the previous packet; and, currently The number of tokens token_current is the total capacity of the token bucket.
  • the bucket_size that is, when the sum of the token add amount delta_token and the token number of the previous packet limit token_last exceeds the total bucket size of the token bucket, the token overflows the bucket;
  • the processing of the current packet is: comparing the current packet length with the current token number token_current, and the current token number token_current is greater than or equal to the current packet length, indicating that the token in the token bucket is sufficient at this time.
  • the service can serve the current packet, forward the packet, and reduce the number of tokens in the token bucket to the same number as the packet length. If the current token number token_current is smaller than the current packet length, it indicates that the token bucket is in the token bucket. The tokens are insufficient to serve the current packet and discard the packet. The number of tokens in the token bucket remains unchanged.
  • the addition of the token becomes a non-contiguous block addition. Since the block addition method has a larger number of tokens added each time, the packet long packet and the short packet face equal.
  • the forwarding opportunity solves the problem that the short packet passing opportunity in the existing token speed limiting method is far greater than the long packet;
  • the capacity of the token bucket is 1500 bytes.
  • the token bucket is full at the beginning.
  • the token bucket is limited to a set of packets with different lengths and shorts.
  • the packets of the two packets are 60 bytes and 1000 bytes. If the packet is transmitted at a rate of 120 bytes/s and the token bucket is added at a rate of 100 bytes/s, if the rate is based on the existing linear token bucket, the token bucket will be used after a certain amount of time. It will be in a state of “empty”, the token in the token bucket is only enough to serve 60-byte messages, and the 1000-byte message is difficult to obtain the token service for a long time. Therefore, the 1000-byte report The quality of the service will be greatly affected.
  • FIG. 4 is a schematic structural diagram of a token bucket speed limit device according to an embodiment of the present invention, where the device includes: a parameter obtaining module 40, a determining module 41, and a packet processing module 42;
  • the parameter obtaining module 40 is configured to obtain a token bucket parameter according to an attribute of the packet
  • a determining module 41 configured to determine a current number of tokens according to a time threshold and the token bucket parameter
  • the message processing module 42 is configured to compare the current number of tokens with the current packet length, and perform corresponding processing on the packet according to the comparison result;
  • the parameter obtaining module 40 is specifically configured to search for a token bucket parameter carried in the packet data packet by using an index of the packet data packet;
  • the token bucket parameter includes: a token addition rate token_rate, a previous packet arrival time time_last, a token bucket token_last token_last token rate, and a token bucket capacity bucket_size;
  • the token bucket capacity bucket_size is used to limit the total amount of tokens in the token bucket
  • the structure of the determining module 41 is as shown in FIG. 5, and specifically includes: a time difference determining module 50, a token adding amount determining module 51, and a token number determining module 52;
  • the time difference determining module 50 is configured to determine a time difference delta_time according to a previous message arrival time in the token bucket parameter
  • the token adding amount determining module 51 is configured to determine, according to the time threshold time_threshhold, the time difference delta_time, and the token adding rate in the token bucket parameter, the added amount delta_token of the current packet arrival time token;
  • the token quantity determining module 52 is configured to determine the current number according to the added amount delta_token of the current packet arrival time token and the number of tokens of the last packet in the token bucket parameter Number of tokens token_current;
  • the time threshold time_threshhold is a preset threshold
  • the token quantity determining module 52 is specifically configured to add the token number token_last of the token bucket to the previous packet rate limit and the add amount delta_token of the current packet arrival time token to obtain the current
  • the packet processing module 42 is configured to compare the current token number token_current with the current packet length, and forward the current packet when the current token number token_current is greater than or equal to the current packet length, and The number of the tokens in the token bucket is reduced by the number of the tokens in the token bucket. When the current number of tokens is less than the current packet length, the packet is discarded, and the number of tokens in the token bucket is maintained. constant;
  • the parameter obtaining module 40, the determining module 41, and the message processing module 42 may all be implemented by a CPU or a main chip in the network node device; the network node device includes: a device such as a router or a switch.
  • the token bucket speed limit method according to the embodiment of the present invention may also be stored in a computer readable storage medium if it is implemented in the form of software and sold or used as an independent product.
  • a computer readable storage medium if it is implemented in the form of software and sold or used as an independent product.
  • embodiments of the present application can be provided as a method, system, or computer program product.
  • the present application can take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment in combination of software and hardware.
  • the application can take the form of a computer program product embodied on one or more computer-usable storage media containing computer usable program code, including but not limited to a USB flash drive, a mobile hard drive, a read only memory ( ROM, Read-Only Memory), disk storage, CD-ROM, optical storage, etc.
  • the network node device disclosed in the embodiment of the present invention obtains the token bucket parameter according to the attribute of the packet, and obtains the current number of tokens according to the time threshold and the token bucket parameter, and compares the current number of tokens with the current report.
  • the length of the text is processed according to the comparison result, so that the long packet and the short packet have equal token service opportunities, improve the service quality of the packet long packet, and make up for the existing token bucket speed limit method. defect.
  • the invention discloses a token bucket speed limit method and device, and a computer storage medium, which can obtain a token bucket parameter according to an attribute of a packet, and obtain a current token according to a preset time threshold and the token bucket parameter.
  • the quantity compares the current number of tokens with the current packet length, and processes the packet according to the comparison result; thus, the token bucket can overcome the problem of being in a short-term "empty" state for a long time, so that the packet is long and short. Get equal token service opportunities and improve the quality of long-package services.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Environmental & Geological Engineering (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

本发明公开了一种令牌桶限速方法、装置及计算机存储介质，该方法包括：网络节点设备根据报文的属性获取令牌桶参数，再根据时间阈值和所述令牌桶参数得到当前的令牌数量，比较所述当前的令牌数量与当前报文长度，根据比较结果对报文进行处理。

Description

一种令牌桶限速方法、装置及计算机存储介质 技术领域
本发明涉及数据网络的服务质量(QoS，Quality of Service)领域，尤其涉及一种令牌桶限速方法、装置及计算机存储介质。
背景技术
在现有的数据网络中，由于报文流量的突发性，常常会导致网络拥塞。避免网络拥塞的一种方法是：在接收端对报文进行限速，如果报文的速率低于规定的速率，则正常接收报文；如果报文的速率超过规定的速率，则丢弃报文。
现有采用的方法是利用令牌桶对报文进行限速，令牌桶算法的标准有RFC2697和RFC2698，即单速率三色双桶和双速率三色双桶；现有的令牌桶限速示意图如图1所示；当一个报文到来时，系统确定当前报文与上一报文的时间差，然后将时间差乘以令牌桶令牌的添加速率得到当前令牌桶的填充令牌数量，最后将填充令牌加上原令牌即可得到当前令牌桶令牌数量，直到当前令牌桶满为止。
但是在实际应用中，由于报文速率往往大于令牌的添加速率，所以令牌桶长期处于即将“耗空”的状态，如此，令牌桶中残存的令牌往往只能满足短包的通过，而长包则被丢弃；因此，长包的限速质量得不到保证。
发明内容
为了解决现有存在的问题，本发明主要提供一种令牌桶限速方法、装置及计算机存储介质。
本发明的技术方案是这样实现的：
本发明实施例提供一种令牌桶限速方法，该方法包括：
网络节点设备根据报文的属性获取令牌桶参数；
根据时间阈值和所述令牌桶参数，确定当前的令牌数量；
比较所述当前的令牌数量与当前报文长度得到比较结果，根据所述比较结果对报文进行处理。
上述方案中，所述网络节点设备根据报文的属性获取令牌桶参数为：网络节点设备通过报文数据包的索引查找到报文数据包中所携带的令牌桶参数；其中，
所述令牌桶参数包括：令牌添加速率、上一个报文到达时刻、令牌桶对上一个报文限速运算后的令牌数量以及令牌桶容量。
上述方案中，所述根据时间阈值和令牌桶参数得到当前的令牌数量包括：网络节点设备根据所述令牌桶参数中的上一个报文到达时刻确定时间差；根据时间阈值、所述时间差和令牌桶参数中的令牌添加速率确定当前报文到达时刻令牌的添加量；再根据所述当前报文到达时刻令牌的添加量和令牌桶参数中的上一个报文限速运算后的令牌数量确定当前的令牌数量。
上述方案中，所述网络节点设备确定时间差为：将当前报文到达时刻减去所述上一个报文到达时刻得到时间差。
上述方案中，所述根据时间阈值和时间差得到当前报文到达时刻令牌的添加量为：比较时间阈值和时间差的大小，当所述时间差大于所述时间阈值时，当前报文到达时刻令牌的添加量等于时间差与所述令牌添加速率的乘积；当所述时间差小于或等于所述时间阈值时，当前报文到达时刻令牌的添加量等于零。
上述方案中，所述根据所述当前报文到达时刻令牌的添加量得到当前的令牌数量为：当前的令牌数量等于所述令牌桶对上一个报文限速运算后 的令牌数量与所述当前报文到达时刻令牌的添加量的和，且所述当前的令牌数量的最大值为令牌桶参数中的令牌桶容量。
上述方案中，所述比较所述当前的令牌数量与当前报文长度得到比较结果，根据所述比较结果对报文进行处理，包括：比较所述当前的令牌数量与当前报文长度，当所述当前的令牌数量大于或等于当前报文长度时，转发当前报文，令牌桶中当前的令牌数量减少与当前报文长度相等的数目；当所述当前的令牌数量小于当前报文长度时，丢弃报文，令牌桶中当前的令牌数量不变。
本发明实施例还提供了一种令牌桶限速装置，该装置包括：参数获取模块、确定模块和报文处理模块；其中，
参数获取模块，用于根据报文的属性获取令牌桶参数；
确定模块，用于根据时间阈值和所述令牌桶参数确定当前的令牌数量；
报文处理模块，用于比较所述当前的令牌数量与当前报文长度得到比较结果，根据所述比较结果对报文进行处理。
上述方案中，所述参数获取模块具体用于通过报文数据包的索引查找报文数据包中所携带的令牌桶参数；其中，
所述令牌桶参数包括：令牌添加速率、上一个报文到达时刻、令牌桶对上一个报文限速运算后的令牌数量以及令牌桶容量。
上述方案中，所述确定模块包括：时间差确定模块、令牌添加量确定模块和令牌数量确定模块；其中，
时间差确定模块，用于根据令牌桶参数中的上一个报文到达时刻确定时间差；
令牌添加量确定模块，用于根据时间阈值、所述时间差和令牌桶参数中的令牌添加速率确定当前报文到达时刻令牌的添加量；
令牌数量确定模块，用于根据所述当前报文到达时刻令牌的添加量和 令牌桶参数中的上一个报文限速运算后的令牌数量确定当前的令牌数量。
上述方案中，所述时间差确定模块，具体用于将当前报文到达时刻减去所述上一个报文到达时刻得到时间差。
上述方案中，所述令牌添加量确定模块，具体用于比较时间阈值与时间差的大小，当所述时间差大于所述时间阈值时，将时间差与令牌添加速率相乘得到当前报文到达时刻令牌的添加量；当所述时间差小于或等于所述时间阈值时，当前报文到达时刻令牌的添加量等于零；其中。
上述方案中，所述令牌数量确定模块，具体用于将所述令牌桶对上一个报文限速运算后的令牌数量与所述当前报文到达时刻令牌的添加量相加得到当前的令牌数量，且所述当前的令牌数量的最大值为令牌桶参数中的令牌桶容量。
上述方案中，所述报文处理模块，具体用于比较所述当前的令牌数量与当前报文长度，当所述当前的令牌数量大于或等于当前报文长度时，转发当前报文，并将令牌桶中的令牌数量减少与当前报文长度相等的数目；当所述当前的令牌数量小于当前报文长度时，丢弃报文，维持令牌桶中的令牌数量不变。
本发明实施例提供的计算机存储介质存储有计算机程序，该计算机程序用于执行上述令牌桶限速方法。
本发明实施例提供的一种令牌桶限速方法和装置，网络节点设备根据报文的属性获取令牌桶参数，再根据预先设置的时间阈值和所述令牌桶参数得到当前的令牌数量，比较当前的令牌数量与当前报文长度，根据比较结果对报文进行处理；如此，能够使令牌桶克服长期处于即将“耗空”状态的问题，使报文长包和短包获得均等的令牌服务机会，提高长包的服务质量。
附图说明
图1为现有的线性令牌桶限速示意图；
图2为本发明实施例提供的令牌桶限速方法的流程示意图；
图3为本发明实施例提供的令牌桶限速示意图；
图4为本发明实施例提供的令牌桶限速装置的结构示意图；
图5为本发明实施例提供的确定模块的结构示意图。
具体实施方式
本发明实施例中，网络节点设备根据报文的属性获取令牌桶参数；再根据设置的时间阈值和所述令牌桶参数得到当前的令牌数量；比较所述当前的令牌数量与当前报文长度，根据比较结果对报文进行处理。
下面通过附图及具体实施例对本发明做进一步的详细说明。
本发明实施例提供的令牌桶限速方法的流程如图1所示，该方法主要包括以下步骤：
步骤201：网络节点设备根据报文的属性获取令牌桶参数。
具体的，网络节点设备通过报文数据包的索引查找到报文数据包中所携带的令牌桶参数。
这里，所述报文为当前接收到的报文或者报文数据包；所述报文的属性可以为所述报文数据包的索引。
所述令牌桶参数包括：令牌添加速率token_rate、上一个报文到达时刻time_last、令牌桶对上一个报文限速运算后的令牌数量token_last以及令牌桶容量bucket_size；
所述令牌桶容量bucket_size，用于限定令牌桶中的总令牌量；例如，一个令牌桶的容量bucket_size为100Mbit，则表示该令牌桶中最多容纳100Mbit的令牌，超出的令牌则会溢出令牌桶。
所述上一个报文为所述当前接收到的报文或报文数据包之前的一个报 文或一个报文数据包。
步骤202：网络节点设备根据时间阈值(time_threshhold)和所述令牌桶参数，确定当前的令牌数量。
具体的，网络节点设备根据令牌桶参数中的上一个报文到达时刻确定时间差delta_time；根据时间阈值time_threshhold、所述时间差delta_time以及令牌桶参数中的令牌添加速率，确定当前所述报文到达时刻令牌的添加量delta_token；再根据所述当前报文到达时刻令牌的添加量delta_token和令牌桶参数中的上一个报文限速运算后的令牌数量确定当前的令牌数量token_current。
其中，所述时间阈值为根据实际情况预设值。
所述网络节点设备根据令牌桶参数中的上一个报文到达时刻确定时间差delta_time具体为：将当前报文到达时刻time_now减去所述上一个报文到达时刻time_last得到时间差delta_time，即：delta_time＝time_now-time_last；
例如，从0时刻开始计时，当前报文到达时刻time_now为10ms，上一个报文到达时刻time_last为6ms，由上述算法可以得到时间差delta_time等于4ms；
所述根据时间阈值time_threshhold、时间差delta_time以及令牌桶参数中的令牌添加速率得到当前报文到达时刻令牌的添加量delta_token具体为：比较时间阈值time_threshhold与时间差delta_time的大小，当所述时间差delta_time大于所述时间阈值time_threshhold时，当前报文到达时刻令牌的添加量delta_token等于时间差delta_time与所述令牌添加速率token_rate的乘积，即delta_token＝delta_time*token_rate；当所述时间差delta_time小于或等于所述时间阈值time_threshhold时，当前报文到达时刻令牌的添加量delta_token等于零，即delta_token＝0。
之所以采用上述方法，是因为时间阈值time_threshhold可以将令牌桶令牌的添加划分为随机块状添加，即隔一段时间(这段时间大于时间阈值)往令牌桶中添加令牌，每次令牌的添加数量都会比较大，因此，每次添加后令牌桶中的令牌总量会一直维持一个比较大的数量，这样，不管当前到达的报文是长包还是短包，令牌总量足够服务于当前报文，使长包获得与短包一样的令牌服务机会；
所述时间阈值time_threshhold可以为预先设置好的一个阈值；时间阈值time_threshhold的设置不能过大，过大会引起令牌桶中令牌溢出，导致限速带宽的损失，也不能过小，过小则起不到改善长包限速服务质量的作用；根据报文的发送速率和令牌桶的令牌添加速率设置大小合适的时间阈值time_threshhold；
例如，报文数据包中携带的令牌桶参数分别如下：令牌添加速率token_rate＝8000bit/s，上一个报文到达时刻time_last＝6ms、令牌桶对上一个报文限速运算后的令牌数量token_last＝5000bit，当前报文到达时刻为10ms，事先设置的time_threshhold＝3ms；根据上述方法可得：
delta_time＝4ms；4ms大于时间阈值3ms；因此，
delta_token＝delta_time*token_rate＝0.004s*8000bit/s＝32bit；
所述根据所述当前报文到达时刻令牌的添加量delta_token得到当前的令牌数量token_current具体为：当前的令牌数量token_current等于所述令牌桶对上一个报文限速运算后的令牌数量token_last与所述当前报文到达时刻令牌的添加量delta_token的和，即token_current＝token_last+delta_token；且当前的令牌数量token_current的最大值为令牌桶容量bucket_size值，即token_current＝<bucket_size；由于网络管理人员会根据实际情况设置时间阈值time_threshhold，因此，当前的令牌数量token_current的值一般不会超过令牌桶容量bucket_size值，当超过时，使token_current＝bucket_size；
例如，在上述示例中，token_current＝5000+32＝5032bit。
步骤203：网络节点设备比较当前的令牌数量与当前报文长度得到比较结果，根据所述比较结果对报文进行相应处理。
具体的，比较所述当前的令牌数量token_current与当前报文长度，当所述当前的令牌数量token_current大于或等于当前报文长度时，转发当前报文，令牌桶中的令牌数量token_current减少与当前报文长度相等的数目；当所述当前的令牌数量token_current小于当前报文长度时，丢弃报文，令牌桶中的令牌数量不变；
例如，在上述示例中，当前的令牌数量token_curren为5032bit，如果当前报文长度为100字节，即800bit时，报文长度小于token_curren，表示令牌桶中的令牌足够服务于该报文，令牌桶转发该报文，且令牌桶中的令牌数量减少800bit，当前令牌桶中的令牌数量为4232bit；如果当前报文长度为1000字节，即8000bit时，报文长度大于token_curren，表示令牌桶中的令牌不足，无法服务于该报文，则丢弃该报文，令牌桶中的令牌数量仍然为5032bit。
图3所示为本发明实施例提供的令牌桶限速示意图；如图所示，在往令牌桶中添加令牌时，首先要判断时间差delta_time是否大于时间阈值time_threshhold，当大于所述时间阈值time_threshhold时，往令牌桶中添加令牌，否则不添加令牌；
上述时间差delta_time为当前报文到达时刻time_now与上一个报文到达时刻time_last的时间差；时间阈值time_threshhold为预先设置好的一个阈值，用于使令牌的添加呈随机块状添加，而不是线性添加；
令牌桶中添加了令牌之后，令牌桶中的当前的令牌数量token_current为此次的令牌添加量delta_token与上一个报文限速运算后的令牌数量token_last之和；而且，当前的令牌数量token_current最大为令牌桶的总容 量bucket_size，即当此次的令牌添加量delta_token与上一个报文限速运算后的令牌数量token_last之和超过令牌桶的总容量bucket_size时，令牌会溢出桶外；
对当前报文的处理为：比较当前报文长度与当前的令牌数量token_current的大小，当前的令牌数量token_current大于或等于当前报文长度时，表明此时令牌桶中的令牌足够，可以服务于当前报文，转发报文，并将令牌桶中的令牌数目减少与报文长度相等的数目；当前的令牌数量token_current小于当前报文长度时，表明此时令牌桶中的令牌不足，无法服务于当前报文，丢弃报文，令牌桶中的令牌数量保持不变；
通过上述设置的时间阈值time_threshhold，使得令牌的添加变成非连续的块状添加，由于这种块状添加方法每次添加的令牌数量比较多，报文长包和短包都面临相等的转发机会，解决了现有令牌限速方法中短包通过机会远大于长包的问题；
例如，令牌桶的容量为1500字节，初始时令牌桶满，对一组长短参差不齐的报文进行令牌桶限速，两种报文60字节和1000字节的报文混合发送，报文发送速率120字节/s，令牌桶令牌添加速率100字节/s时，如果按照现有的线性令牌桶限速方式，则过若干时间后，令牌桶就会处于即将“耗空”的状态，令牌桶中具有的令牌只足够服务于60字节的报文，1000字节的报文则长期难以得到令牌服务，因此，1000字节的报文服务质量将会受到很大影响，只在报文开始发送初期，可以通过令牌桶得到转发，后期则无法得到令牌服务，60字节报文的通过机会远大于1000字节的报文；然而，利用本发明提供的方案，就会避免上述问题；假如，设置时间阈值time_threshhold为6s，当报文的发送间隔大于6s时添加令牌，否则不添加；这种随机的块状添加方式的好处在于，每一次都可以添加数量较大的令牌，添加量大于600字节，令牌桶中的令牌数量在每次添加后都会维持一个较 大的基数，不会因为报文的发送速率大于令牌添加速率而使令牌桶消耗殆尽，令牌桶中的令牌数量足够服务于1000字节的长包和60字节的短包，而且，长包和短包获得令牌服务的机会是均等的。
图4所示为本发明实施例提供的令牌桶限速装置的结构示意图，该装置包括：参数获取模块40、确定模块41和报文处理模块42；其中，
参数获取模块40，用于根据报文的属性获取令牌桶参数；
确定模块41，用于根据时间阈值和所述令牌桶参数确定当前的令牌数量；
报文处理模块42，用于比较所述当前的令牌数量与当前报文长度，根据比较结果对报文进行相应处理；
参数获取模块40具体用于通过报文数据包的索引查找报文数据包中所携带的令牌桶参数；其中，
所述令牌桶参数包括：令牌添加速率token_rate、上一个报文到达时刻time_last、令牌桶对上一个报文限速运算后的令牌数量token_last以及令牌桶容量bucket_size；
所述令牌桶容量bucket_size，用于限定令牌桶中的总令牌量；
所述确定模块41的结构如图5所示，具体包括：时间差确定模块50、令牌添加量确定模块51和令牌数量确定模块52；其中，
时间差确定模块50，用于根据令牌桶参数中的上一个报文到达时刻确定时间差delta_time；
令牌添加量确定模块51，用于根据时间阈值time_threshhold、所述时间差delta_time以及令牌桶参数中的令牌添加速率确定当前报文到达时刻令牌的添加量delta_token；
令牌数量确定模块52，用于根据所述当前报文到达时刻令牌的添加量delta_token和令牌桶参数中的上一个报文限速运算后的令牌数量确定当前 的令牌数量token_current；
所述时间差确定模块50，具体用于将当前报文到达时刻time_now减去所述上一个报文到达时刻time_last得到时间差delta_time，即delta_time＝time_now-time_last；
所述令牌添加量确定模块51，具体用于比较时间阈值time_threshhold与时间差delta_time的大小，当所述时间差delta_time大于所述时间阈值time_threshhold时，将时间差delta_time与令牌添加速率token_rate相乘得到当前报文到达时刻令牌的添加量delta_token，即delta_token＝delta_time*token_rate；当所述时间差delta_time小于或等于所述时间阈值time_threshhold时，当前报文到达时刻令牌的添加量delta_token等于零，即delta_token＝0；
所述时间阈值time_threshhold为预先设置好的一个阈值；
所述令牌数量确定模块52，具体用于将所述令牌桶对上一个报文限速运算后的令牌数量token_last与所述当前报文到达时刻令牌的添加量delta_token相加得到当前的令牌数量token_current，即token_current＝token_last+delta_token；且当前的令牌数量token_current的最大值且令牌桶容量bucket_size值，即token_current＝<bucket_size；
所述报文处理模块42，具体用于比较所述当前的令牌数量token_current与当前报文长度，当所述当前的令牌数量token_current大于或等于当前报文长度时，转发当前报文，并将令牌桶中当前的令牌数量token_current减少与当前报文长度相等的数目；当所述当前的令牌数量token_current小于当前报文长度时，丢弃报文，维持令牌桶中的令牌数量不变；
上述参数获取模块40、确定模块41和报文处理模块42都可以由网络节点设备中的CPU或主芯片来实现；所述网络节点设备包括：如路由器、交换机等设备。
本发明实施例所述令牌桶限速方法如果以软件的形式实现并作为独立的产品销售或使用时，也可以存储在一个计算机可读取存储介质中。基于这样的理解，本领域内的技术人员应明白，本申请的实施例可提供为方法、系统、或计算机程序产品。因此，本申请可采用完全硬件实施例、完全软件实施例、或结合软件和硬件方面的实施例的形式。而且，本申请可采用在一个或多个其中包含有计算机可用程序代码的计算机可用存储介质上实施的计算机程序产品的形式，所述存储介质包括但不限于U盘、移动硬盘、只读存储器(ROM，Read-Only Memory)、磁盘存储器、CD-ROM、光学存储器等。
本发明实施例中公开的网络节点设备根据报文的属性获取令牌桶参数，再根据时间阈值和所述令牌桶参数得到当前的令牌数量，比较所述当前的令牌数量与当前报文长度，根据比较结果对报文进行相应处理，从而使报文长包和短包具有均等的令牌服务机会，提高报文长包的服务质量，弥补了现有令牌桶限速方法的缺陷。
以上所述，仅为本发明的较佳实施例而已，并非用于限定本发明的保护范围，凡在本发明的精神和原则之内所作的任何修改、等同替换和改进等，均应包含在本发明的保护范围之内。
工业实用性
本发明公开了一种令牌桶限速方法、装置及计算机存储介质，能够根据报文的属性获取令牌桶参数，再根据预先设置的时间阈值和所述令牌桶参数得到当前的令牌数量，比较当前的令牌数量与当前报文长度，根据比较结果对报文进行处理；如此，能够使令牌桶克服长期处于即将“耗空”状态的问题，使报文长包和短包获得均等的令牌服务机会，提高长包的服务质量。

Claims (15)

  1. 一种令牌桶限速方法，该方法包括：
    网络节点设备根据报文的属性获取令牌桶参数；
    根据时间阈值和所述令牌桶参数，确定当前的令牌数量；
    比较所述当前的令牌数量与当前报文长度得到比较结果，根据所述比较结果对报文进行处理。
  2. 根据权利要求1所述的方法，其中，所述网络节点设备根据报文的属性获取令牌桶参数，包括：
    网络节点设备通过报文数据包的索引查找到报文数据包中所携带的令牌桶参数；
    其中，所述令牌桶参数包括：令牌添加速率、上一个报文到达时刻、令牌桶对上一个报文限速运算后的令牌数量以及令牌桶容量。
  3. 根据权利要求1所述的方法，其中，所述根据时间阈值和令牌桶参数得到当前的令牌数量，包括：
    网络节点设备根据所述令牌桶参数中的上一个报文到达时刻确定时间差；根据时间阈值、所述时间差和令牌桶参数中的令牌添加速率确定当前报文到达时刻令牌的添加量；再根据所述当前报文到达时刻令牌的添加量和令牌桶参数中的上一个报文限速运算后的令牌数量确定当前的令牌数量。
  4. 根据权利要求3所述的方法，其中，所述网络节点设备确定时间差为：将当前报文到达时刻减去所述上一个报文到达时刻得到时间差。
  5. 根据权利要求4所述的方法，其中，所述根据时间阈值和时间差得到当前报文到达时刻令牌的添加量为：
    比较时间阈值和时间差的大小，当所述时间差大于所述时间阈值时， 当前报文到达时刻令牌的添加量等于时间差与所述令牌添加速率的乘积；当所述时间差小于或等于所述时间阈值时，当前报文到达时刻令牌的添加量等于零。
  6. 根据权利要求5所述的方法，其中，所述根据所述当前报文到达时刻令牌的添加量得到当前的令牌数量为：
    当前的令牌数量等于所述令牌桶对上一个报文限速运算后的令牌数量与所述当前报文到达时刻令牌的添加量的和，且所述当前的令牌数量的最大值为令牌桶参数中的令牌桶容量。
  7. 根据权利要求1至6任一所述的方法，其中，所述比较所述当前的令牌数量与当前报文长度得到比较结果，根据所述比较结果对报文进行处理，包括：
    比较所述当前的令牌数量与当前报文长度，当所述当前的令牌数量大于或等于当前报文长度时，转发当前报文，令牌桶中当前的令牌数量减少与当前报文长度相等的数目；当所述当前的令牌数量小于当前报文长度时，丢弃报文，令牌桶中当前的令牌数量不变。
  8. 一种令牌桶限速装置，该装置包括：参数获取模块、确定模块和报文处理模块；其中，
    参数获取模块，配置为根据报文的属性获取令牌桶参数；
    确定模块，配置为根据时间阈值和所述令牌桶参数确定当前的令牌数量；
    报文处理模块，配置为比较所述当前的令牌数量与当前报文长度得到比较结果，根据所述比较结果对报文进行处理。
  9. 根据权利要求8所述的装置，其中，
    所述参数获取模块，配置为通过报文数据包的索引查找报文数据包中所携带的令牌桶参数；其中，所述令牌桶参数包括：令牌添加速率、上一 个报文到达时刻、令牌桶对上一个报文限速运算后的令牌数量以及令牌桶容量。
  10. 根据权利要求8所述的装置，其中，所述确定模块包括：时间差确定模块、令牌添加量确定模块和令牌数量确定模块；其中，
    时间差确定模块，配置为根据令牌桶参数中的上一个报文到达时刻确定时间差；
    令牌添加量确定模块，配置为根据时间阈值、所述时间差和令牌桶参数中的令牌添加速率确定当前报文到达时刻令牌的添加量；
    令牌数量确定模块，配置为根据所述当前报文到达时刻令牌的添加量和令牌桶参数中的上一个报文限速运算后的令牌数量确定当前的令牌数量。
  11. 根据权利要求10所述的装置，其中，所述时间差确定模块，配置为将当前报文到达时刻减去所述上一个报文到达时刻得到时间差。
  12. 根据权利要求11所述的装置，其中，所述令牌添加量确定模块，配置为比较时间阈值与时间差的大小，当所述时间差大于所述时间阈值时，将时间差与令牌添加速率相乘得到当前报文到达时刻令牌的添加量；当所述时间差小于或等于所述时间阈值时，当前报文到达时刻令牌的添加量等于零；其中。
  13. 根据权利要求12所述的装置，其中，所述令牌数量确定模块，配置为将所述令牌桶对上一个报文限速运算后的令牌数量与所述当前报文到达时刻令牌的添加量相加得到当前的令牌数量，且所述当前的令牌数量的最大值为令牌桶参数中的令牌桶容量。
  14. 根据权利要求8至13任一所述的装置，其中，所述报文处理模块，配置为比较所述当前的令牌数量与当前报文长度，当所述当前的令牌数量大于或等于当前报文长度时，转发当前报文，并将令牌桶中的令牌数量减 少与当前报文长度相等的数目；当所述当前的令牌数量小于当前报文长度时，丢弃报文，维持令牌桶中的令牌数量不变。
  15. 一种计算机存储介质，所述计算机存储介质中存储有计算机可执行指令，该计算机可执行指令用于执行权利要求1至7任一项令牌桶限速方法。
PCT/CN2014/087112 2014-04-03 2014-09-22 一种令牌桶限速方法、装置及计算机存储介质 WO2015149488A1 (zh)

Priority Applications (3)

Application Number Priority Date Filing Date Title
DK14887743.4T DK3128704T3 (da) 2014-04-03 2014-09-22 Metode og apparat til hastighedsbegrænsning ved hjælp af token-bucket og computerlagringsmedium
EP14887743.4A EP3128704B1 (en) 2014-04-03 2014-09-22 Method and apparatus for limiting rate by means of token bucket, and computer storage medium
US15/301,323 US10135740B2 (en) 2014-04-03 2014-09-22 Method and apparatus for limiting rate by means of token bucket, and computer storage medium

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201410134335.2 2014-04-03
CN201410134335.2A CN104980367B (zh) 2014-04-03 2014-04-03 一种令牌桶限速方法和装置

Publications (1)

Publication Number Publication Date
WO2015149488A1 true WO2015149488A1 (zh) 2015-10-08

Family

ID=54239362

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2014/087112 WO2015149488A1 (zh) 2014-04-03 2014-09-22 一种令牌桶限速方法、装置及计算机存储介质

Country Status (5)

Country Link
US (1) US10135740B2 (zh)
EP (1) EP3128704B1 (zh)
CN (1) CN104980367B (zh)
DK (1) DK3128704T3 (zh)
WO (1) WO2015149488A1 (zh)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106411773A (zh) * 2016-08-29 2017-02-15 武汉微创光电股份有限公司 基于令牌桶的视频传输中的流量整形方法及系统
CN114598658A (zh) * 2022-03-07 2022-06-07 浪潮云信息技术股份公司 一种流量限制方法及装置

Families Citing this family (27)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10524278B2 (en) * 2015-11-20 2019-12-31 Qualcomm Incorporated Scheduling and token bucket for communication co-existence
CN105376175B (zh) * 2015-12-03 2019-01-25 北京浩瀚深度信息技术股份有限公司 具有带宽保障功能的级联令牌桶实现方法
US10044751B2 (en) * 2015-12-28 2018-08-07 Arbor Networks, Inc. Using recurrent neural networks to defeat DNS denial of service attacks
CN106936734B (zh) * 2015-12-30 2020-04-24 深圳市中兴微电子技术有限公司 信息上报方法及装置
CN105635145B (zh) * 2015-12-31 2019-01-04 盛科网络（苏州）有限公司 Capwap dtls隧道的芯片级安全防护方法
CN107465629A (zh) * 2016-06-06 2017-12-12 中兴通讯股份有限公司 限速方法及装置
CN106302211B (zh) * 2016-07-18 2018-04-03 网易无尾熊（杭州）科技有限公司 一种网络资源的请求量控制方法和装置
CN106656849B (zh) * 2016-11-01 2019-09-06 杭州迪普科技股份有限公司 报文限速方法及装置
CN107181699B (zh) * 2017-05-27 2019-10-01 西南交通大学 列车控制与服务网络的流量监管和入队管理方法
CN108989239B (zh) * 2017-06-02 2023-10-13 中兴通讯股份有限公司 过载保护方法及装置、控制器及存储介质
CN107682279B (zh) * 2017-11-03 2020-04-10 东软集团股份有限公司 一种时延控制方法、装置及存储介质、程序产品
CN107623641B (zh) * 2017-11-03 2019-11-19 湖南天冠电子信息技术有限公司 限速方法及装置
US11777785B2 (en) * 2018-01-21 2023-10-03 Cisco Technology, Inc. Alert throttling
CN108259377A (zh) * 2018-02-13 2018-07-06 中国联合网络通信集团有限公司 队列分配方法及装置
US10951532B2 (en) 2018-07-18 2021-03-16 Huawei Technologies Co., Ltd. Method and system for cluster rate limiting in a cloud computing system
CN109525500B (zh) * 2018-12-27 2021-08-24 北京天融信网络安全技术有限公司 一种自调整阈值的信息处理方法及信息处理装置
US11243977B2 (en) * 2019-03-01 2022-02-08 Intel Corporation SGX based flow control for distributed ledgers
US10771392B1 (en) * 2019-06-12 2020-09-08 International Business Machines Corporation Increasing efficiency to rate limiting
CN112328613B (zh) * 2020-11-04 2022-07-22 迈普通信技术股份有限公司 联机分析处理方法、装置、电子设备及存储介质
CN113518017B (zh) * 2021-06-29 2023-04-18 新华三信息安全技术有限公司 一种网络状态分析方法、装置、设备及机器可读存储介质
CN113422737B (zh) * 2021-08-25 2022-01-11 阿里云计算有限公司 一种流量控制方法、设备及存储介质
US11977513B2 (en) 2022-01-26 2024-05-07 Microsoft Technology Licensing, Llc. Data flow control in distributed computing systems
CN114745333B (zh) * 2022-03-03 2023-05-30 珠海高凌信息科技股份有限公司 一种ims系统自适应流量控制方法
US11863675B2 (en) * 2022-04-06 2024-01-02 Microsoft Technology Licensing, Llc Data flow control in distributed computing systems
CN114969670A (zh) * 2022-04-19 2022-08-30 北京月新时代科技股份有限公司 一种软件许可资源的管理方法、系统及计算机设备
CN114641033B (zh) * 2022-05-09 2022-08-30 上海大汉三通通信股份有限公司 5g消息推送速度控制方法、装置、设备及介质
CN114915596A (zh) * 2022-05-10 2022-08-16 北京奇艺世纪科技有限公司 数据发送方法、装置、设备及存储介质

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101227410A (zh) * 2008-02-03 2008-07-23 杭州华三通信技术有限公司 流量监管方法及流量监管设备
CN101478491A (zh) * 2009-02-10 2009-07-08 中兴通讯股份有限公司 一种实现分组业务区分服务的方法及装置
CN101741603A (zh) * 2008-11-11 2010-06-16 中兴通讯股份有限公司 一种基于令牌桶的流量监管方法及设备

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1672436B1 (fr) 2004-12-20 2008-03-19 Rolex S.A. Cadran pour pièce d'horlogerie et procédés de fabrication de ce cadran
US7738382B2 (en) * 2004-12-21 2010-06-15 Cisco Technology, Inc. Hierarchical multi-rate multi-precedence policer

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101227410A (zh) * 2008-02-03 2008-07-23 杭州华三通信技术有限公司 流量监管方法及流量监管设备
CN101741603A (zh) * 2008-11-11 2010-06-16 中兴通讯股份有限公司 一种基于令牌桶的流量监管方法及设备
CN101478491A (zh) * 2009-02-10 2009-07-08 中兴通讯股份有限公司 一种实现分组业务区分服务的方法及装置

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP3128704A4 *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106411773A (zh) * 2016-08-29 2017-02-15 武汉微创光电股份有限公司 基于令牌桶的视频传输中的流量整形方法及系统
CN106411773B (zh) * 2016-08-29 2018-10-23 武汉微创光电股份有限公司 基于令牌桶的视频传输中的流量整形方法及系统
CN114598658A (zh) * 2022-03-07 2022-06-07 浪潮云信息技术股份公司 一种流量限制方法及装置

Also Published As

Publication number Publication date
US10135740B2 (en) 2018-11-20
EP3128704A1 (en) 2017-02-08
EP3128704A4 (en) 2017-05-03
EP3128704B1 (en) 2020-01-01
CN104980367B (zh) 2019-04-30
CN104980367A (zh) 2015-10-14
US20170026295A1 (en) 2017-01-26
DK3128704T3 (da) 2020-03-09

Similar Documents

Publication Publication Date Title
WO2015149488A1 (zh) 一种令牌桶限速方法、装置及计算机存储介质
CN109412964B (zh) 报文控制方法及网络装置
CN109039936B (zh) 传输速率控制方法、装置、发送设备和接收设备
CN108243116B (zh) 一种流量控制方法及交换设备
US9185047B2 (en) Hierarchical profiled scheduling and shaping
CN102629910B (zh) 一种基于加权随机早期检测的拥塞避免方法和系统
WO2017161967A1 (zh) 包每秒流量监管方法、装置和计算机存储介质
FI123302B (fi) Menetelmä ja laitteisto tietoliikennevuon lähetysnopeuden muokkaamiseksi
WO2016086542A1 (zh) 一种传输报文的方法及装置、计算机存储介质
CN107800643B (zh) 报文转发方法及装置
EP2728812A1 (en) Method and device for leaky bucket speed-limitation
WO2013060191A1 (zh) 一种转发报文的方法、生成表项的方法及装置
JP2009027400A (ja) 過大フロー検出装置、過大フロー検出回路、端末装置及びネットワークノード
WO2018076641A1 (zh) 一种减少时延的方法、装置及存储介质
CN112866135A (zh) 发送报文的方法、第一网络设备及计算机可读存储介质
WO2017107363A1 (zh) 缓存管理的方法和装置、计算机存储介质
US20150195209A1 (en) Congestion Notification in a Network
CN104580008A (zh) 基于硬件提高多队列随机丢弃报文精度的方法及装置
CN111385220B (zh) 传输报文的方法和装置
JP2007189592A (ja) トークンバケットによるトラヒック制御装置、方法及びプログラム
CN109787922B (zh) 一种获取队列长度的方法、设备及计算机可读存储介质
CN102611621B (zh) 信元级联的处理方法和设备
CN106911586B (zh) 一种服务质量Qos优化方法和装置
WO2013000112A1 (zh) 一种漏桶限速方法及装置
CN116915709B (zh) 负载均衡的方法及装置、电子设备和存储介质

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 14887743

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

WWE Wipo information: entry into national phase

Ref document number: 15301323

Country of ref document: US

REEP Request for entry into the european phase

Ref document number: 2014887743

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 2014887743

Country of ref document: EP