CN102164083A - Method and device for refreshing token bucket - Google Patents

Method and device for refreshing token bucket Download PDF

Info

Publication number
CN102164083A
CN102164083A CN201110096479XA CN201110096479A CN102164083A CN 102164083 A CN102164083 A CN 102164083A CN 201110096479X A CN201110096479X A CN 201110096479XA CN 201110096479 A CN201110096479 A CN 201110096479A CN 102164083 A CN102164083 A CN 102164083A
Authority
CN
China
Prior art keywords
token
token bucket
current
depth
cpu
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
Application number
CN201110096479XA
Other languages
Chinese (zh)
Other versions
CN102164083B (en
Inventor
翟勇
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
ZTE Corp
Original Assignee
ZTE Corp
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 ZTE Corp filed Critical ZTE Corp
Priority to CN201110096479.XA priority Critical patent/CN102164083B/en
Publication of CN102164083A publication Critical patent/CN102164083A/en
Application granted granted Critical
Publication of CN102164083B publication Critical patent/CN102164083B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Abstract

The invention relates to a method and a device for refreshing a token bucket. The method comprises the following steps: obtaining the current use ratio of a CPU (Central Processing Unit); according to the current use ratio of the CPU, calculating the current depth and the current token refreshing rate of a token bucket; according to the current token refreshing rate, calculating the estimated number of added tokens refreshed this time; and adding the estimated number of tokens into the token bucket. The device comprises a data acquisition module, a calculation module and an execution module. The method and the device are simple to realize, and the processing efficiency and the processing capability of the CPU are improved.

Description

The method for refreshing of token bucket and device
Technical field
The present invention relates to the communication data field, relate in particular to a kind of method for refreshing and device of token bucket.
Background technology
Generally, the core component of three-tier switch and router is to be made up of exchange chip, network processing unit and CPU devices such as (Central Processing Unit, central processing units).Exchange chip and network processing unit are responsible for the forwarding of data message, by data message forwarding is finished repeating process to other ports on the switch.For IP (Internet Protocol, procotol) protocol massages in the network such as ARP (Address Resolution Protocol, address resolution protocol) bag, OSPF (Open Shortest Path First, ospf) protocol package and IGMP (Internet Group Multicast Protocol, IGMP) to wait be to be forwarded to CPU by exchange chip and network processing unit to bag, finishes processing to protocol package by CPU.
Increasing protocol massages need make that the burden of CPU is more and more heavier by delivering to CPU on exchange chip or the network processing unit.Send frequency and little on the common protocol massages, but if a plurality of devices in the system send protocol package simultaneously, and on deliver to the words that the protocol package number of CPU does not limit, the big flow protocol bag that CPU is easy to be happened suddenly dashes dead, cause equipment normally not move, limit so must engrave the protocol package quantity of giving CPU when a certain, the most frequently used method realizes by token bucket exactly.
Token bucket method for refreshing commonly used is by the token bucket degree of depth and brush token rate are set, and is put in the token bucket according to this refresh time and the time difference of brushing the token time last time and the new token of brush token rate generation.When sending, check the token bucket state on protocol package, if the token bucket state is available, then obtain a token from token bucket, send on the protocol package, if the token bucket state is unavailable, then this protocol package is dropped, not transmitted to CPU.The deficiency of this token bucket method for refreshing is, the token bucket degree of depth and brush token rate are fixed, and no matter cpu busy is still idle, the token number that brush its each second is the same, this makes CPU when busy, is easy to be dashed extremely by big flow protocol bag, causes equipment normally not move.
Summary of the invention
The object of the present invention is to provide a kind of method for refreshing and device of token bucket, the present invention has promoted the disposal ability of existing CPU, realizes easily.
The invention provides a kind of method for refreshing of token bucket, said method may further comprise the steps:
Obtain the current utilance of CPU,
Calculate the current degree of depth and the current brush token rate of above-mentioned token bucket according to the current utilance of above-mentioned CPU;
According to above-mentioned current brush token rate, calculate this and refresh and increase token number in advance;
Put into above-mentioned several tokens of token that increase in advance to above-mentioned token bucket.
Preferably, said method is carried out following steps when initialization:
The maximum and the minimum value of the above-mentioned token bucket degree of depth are set, the maximum and the minimum value of above-mentioned token bucket brush token rate, the minimum threshold of token number in the above-mentioned token bucket, above-mentioned token bucket depth increments and brush token rate increment;
The minimum threshold of cpu busy percentage and the step value of wealthy family's limit value and cpu busy percentage are set.
Preferably, above-mentionedly put into above-mentioned several tokens of token that increase in advance after the above-mentioned token bucket step, further comprising the steps of:
Obtain the current state of above-mentioned token bucket;
Judge the type of the current state of above-mentioned token bucket, if available, then this refreshes end; If it is unavailable,
Judge that then whether current token number in the above-mentioned token bucket is greater than minimum threshold, if then the state with token bucket is made as available; Otherwise this refreshes end.
Preferably, the current degree of depth and the current brush token rate step of above-mentioned current utilance computational token bucket according to CPU specifically may further comprise the steps:
Whether the current utilance of judging above-mentioned CPU is less than the minimum threshold of above-mentioned cpu busy percentage, if, then the current degree of depth of above-mentioned token bucket equals the maximum of the above-mentioned token bucket degree of depth, and the current brush token rate of above-mentioned token bucket equals the maximum of above-mentioned token bucket brush token rate; Otherwise,
Whether the current utilance of judging above-mentioned CPU is greater than the wealthy family limit value of above-mentioned cpu busy percentage, if, then the current degree of depth of above-mentioned token bucket equals the minimum value of the above-mentioned token bucket degree of depth, and the current brush token rate of above-mentioned token bucket equals the minimum value of above-mentioned token bucket brush token rate; Otherwise,
According to the current utilance of above-mentioned CPU, calculate the current number of steps of CPU;
According to the current number of steps of above-mentioned CPU, calculate the current degree of depth and the current brush token rate of above-mentioned token bucket.
Preferably, the current number of steps of above-mentioned CPU is calculated by following formula:
step_number=(rate-low?_ate)/utility
Wherein, step_number represents the current number of steps of CPU, and rate represents the current utilance of CPU, and low_rate represents the minimum threshold of cpu busy percentage, and utility represents the step value of cpu busy percentage.
Preferably, the current degree of depth of above-mentioned token bucket is calculated by following formula:
depth=min_depth+A*step_number
Wherein, depth represents the current degree of depth of token bucket, and min_depth represents the minimum value of the token bucket degree of depth, and A represents the token bucket depth increments, and step_number represents the current number of steps of CPU.
Preferably, the current brush token rate of above-mentioned token bucket is calculated by following formula:
speed=min_speed+B*step_number
Wherein, speed represents the current brush token rate of token bucket, and min_speed represents the minimum value of token bucket brush token rate, and B represents token bucket brush token rate increment, and step_number represents the current number of steps of CPU.
Preferably, above-mentioned according to current brush token rate, calculate this and refresh and increase the token number step in advance and specifically may further comprise the steps:
Obtain the current time, as this refresh time and the preservation of above-mentioned token bucket;
Calculate this refresh time and last time refresh time time difference;
Calculating this according to the current brush token rate of above-mentioned time difference and above-mentioned token bucket refreshes and increases token number in advance.
Preferably, the above-mentioned token number that increases in advance calculates by following formula:
new_number=time_difference*speed
Wherein, new_number represents to increase in advance token number, time_difference represent this refresh time of token bucket and last time refresh time time difference, speed represents the current brush token rate of token bucket.
Preferably, above-mentioned putting into increases several tokens of token in advance and specifically may further comprise the steps to above-mentioned token bucket step:
Obtain existing token number in the above-mentioned token bucket;
Judge in the above-mentioned token bucket existing token number with above-mentioned increase in advance token number and whether smaller or equal to the current degree of depth of above-mentioned token bucket, if then put into above-mentioned several tokens of token that increase in advance and arrive above-mentioned token bucket; Otherwise,
Calculate the difference of existing token number in the current degree of depth of above-mentioned token bucket and the above-mentioned token bucket;
Put into an above-mentioned difference token to above-mentioned token bucket.
The present invention also provides a kind of refreshing apparatus of token bucket, comprises data acquisition module, computing module, Executive Module,
Above-mentioned data acquisition module is used to obtain the current utilance of CPU and sends to the aforementioned calculation module;
The aforementioned calculation module is used to calculate the degree of depth, the brush token rate of above-mentioned token bucket and increases token number in advance, and the above-mentioned token number that increases is in advance sent to above-mentioned Executive Module;
Above-mentioned Executive Module is used for the data according to the transmission of aforementioned calculation module, drops into a corresponding number token to above-mentioned token bucket.
Preferably, said apparatus also comprises initialization module and judge module,
Above-mentioned initialization module, the interface of the step value of the minimum threshold of the minimum threshold of token number in the maximum that is used to the user to provide to be provided with the maximum of the above-mentioned token bucket degree of depth and minimum value, above-mentioned token bucket brush token rate and minimum value, the above-mentioned token bucket, above-mentioned token bucket depth increments and brush token rate increment, cpu busy percentage and wealthy family's limit value and cpu busy percentage, and preserve above-mentioned user's setting;
Whether whether above-mentioned judge module, the current utilance that is used to judge above-mentioned CPU less than the minimum threshold of above-mentioned cpu busy percentage or greater than the wealthy family limit value of above-mentioned cpu busy percentage, and judged result is sent to the aforementioned calculation module; And judge the current state of above-mentioned token bucket type, whether judge current token number in the above-mentioned token bucket greater than minimum threshold, and judged result is sent to above-mentioned Executive Module.
Preferably, above-mentioned data acquisition module also is used to obtain the current state of above-mentioned token bucket and sends to above-mentioned judge module, and obtains in current time or the token bucket existing token number and send to the aforementioned calculation module;
The aforementioned calculation module, the current time that also is used for receiving is as this refresh time and preservation; Perhaps calculate the current number of steps of CPU, calculate this refresh time and last time refresh time time difference, and calculate the difference of existing token number in the current degree of depth of above-mentioned token bucket and the above-mentioned token bucket and send to above-mentioned Executive Module;
Above-mentioned Executive Module, the current token number that also is used for type in the current state of token bucket and is unavailable and token bucket be during greater than minimum threshold, is available with the status modifier of token bucket.
The present invention adjusts the degree of depth, the brush token rate of token bucket real-time dynamicly according to the current utilance of CPU; when the current utilance of CPU is low, increase the degree of depth and the brush token rate of token bucket; when the current utilance of CPU is higher, reduce the degree of depth and the brush token rate of token bucket; make under the prerequisite of replacing CPU of not upgrading, promoted treatment effeciency and the disposal ability of CPU when having protected CPU.The present invention is applicable to the occasion that realizes speed limit in the communication equipments such as switch, router by token bucket.
Description of drawings
Accompanying drawing described herein is used to provide further understanding of the present invention, constitutes a part of the present invention, and illustrative examples of the present invention and explanation thereof are used to explain the present invention, does not constitute improper qualification of the present invention.In the accompanying drawings:
Fig. 1 is the flow chart of the method for refreshing of token bucket of the present invention;
Fig. 2 is the refreshing apparatus theory diagram of token bucket of the present invention.
Embodiment
In order to make technical problem to be solved by this invention, technical scheme and beneficial effect clearer, clear,, the present invention is further elaborated below in conjunction with drawings and Examples.Should be appreciated that specific embodiment described herein only in order to explanation the present invention, and be not used in qualification the present invention.
As shown in Figure 1, be the method for refreshing flow chart of token bucket of the present invention, present embodiment specifically may further comprise the steps:
Step S001: the parameter that needs when initialization refreshes, comprise maximum max_depth and minimum value min_depth that the token bucket degree of depth is set, the maximum max_speed and the minimum value min_speed of token bucket brush token rate, the minimum threshold threshold of token number in the token bucket, token bucket depth increments A, token bucket brush token rate increment B, the step value utility of the minimum threshold low_rate of cpu busy percentage and limit value hig_rate of wealthy family and cpu busy percentage;
Step S002: the current utilance rate that obtains CPU;
Step S003: whether the current utilance rate that judges CPU less than the minimum threshold low_rate of cpu busy percentage, if, execution in step S004 then; Otherwise, execution in step S005;
Step S004: the current depth d epth of token bucket equals the maximum max_depth of the token bucket degree of depth, and the current brush token rate speed of token bucket equals the maximum max_speed of token bucket brush token rate, execution in step S009;
That is:
depth=max_depth
speed=max_speed
Step S005: whether the current utilance rate that judges CPU greater than the limit value hig_rate of wealthy family of cpu busy percentage, if, execution in step S006 then; Otherwise, execution in step S007;
Step S006: the current depth d epth of token bucket equals the minimum value min_depth of the token bucket degree of depth, and the current brush token rate speed of token bucket equals the minimum value min_speeed of token bucket brush token rate, execution in step S009;
Promptly
depth=min_depth
speed=min_speed
Step S007:, calculate the current number of steps step_number of CPU according to the current utilance rate of CPU;
Above-mentioned number of steps implication is that what step values the current utilance rate of CPU has changed for the minimum threshold low_rate of its utilance.
This step is calculated by following formula:
step_number=(rate-low_rate)/utility
Wherein, step_number represents the current number of steps of CPU, and rate represents the current utilance of CPU, and low_rate represents the minimum threshold of cpu busy percentage, and utility represents the step value of cpu busy percentage.
Step S008: according to the current number of steps step_number of CPU, the current depth d epth of computational token bucket and current brush token rate speed;
This step is calculated by following formula:
depth=min_depth+A*step_number
speed=min_speed+B*step_number
Wherein, depth represents the current degree of depth of token bucket, and min_depth represents the minimum value of the token bucket degree of depth, and A represents the token bucket depth increments, and step_number represents the current number of steps of CPU; Speed represents the current brush token rate of token bucket, and min_speed represents the minimum value of token bucket brush token rate, and B represents token bucket brush token rate increment, and step_number represents the current number of steps of CPU.
Step S009: obtain the current time, as this refresh time now_time and the preservation of token bucket;
Step S010: calculate this refresh time now_time and last time refresh time last_time time difference time_difference;
Step S011: calculate this according to the current brush token rate speed of above-mentioned time difference time_difference and token bucket and refresh and increase token number new_number in advance;
This step is calculated by following formula:
new_number=time_difference*speed
Wherein, new_number represents to increase in advance token number, time_difference represent this refresh time of token bucket and last time refresh time time difference, speed represents the current brush token rate of token bucket.
Step S012: obtain existing token number number in the token bucket;
Promptly obtain the quantity of existing token in the token bucket.
Step S013: judge in the token bucket existing token number number and increase token number new_number's and in advance whether smaller or equal to the current depth d epth of token bucket, if, execution in step S014 then; Otherwise, execution in step S015;
Step S014: put into and increase a token number new_number token in advance to token bucket, execution in step S017;
Step S015: the difference N of existing token number number in the current depth d epth of computational token bucket and the token bucket;
That is:
N=depth-number
Step S016: put into an above-mentioned difference N token to token bucket;
Step S017: the current state of obtaining token bucket;
Step S018: judge the type of the current state of above-mentioned token bucket, if the current state of token bucket is available, execution in step S021 then; If the current state of token bucket is unavailable, then, execution in step S019;
Step S019: whether judge current token number H in the token bucket greater than minimum threshold threshold, if, execution in step S020 then; Otherwise, execution in step S021;
That is:
When number+new_number≤depth, H=number+new_number;
When number+new_number>depth, H=number+N=depth;
Wherein, number represents in the token bucket existing token number, and new_number represents to increase in advance token number, has the difference of token number number in the current depth d epth that N represents token bucket and the token bucket, and depth represents the current degree of depth of token bucket.
Step S020: be made as the state of token bucket available;
Step S021: this refreshes end.
As shown in Figure 2, be the refreshing apparatus of token bucket of the present invention, comprise initialization module 01, data acquisition module 02, judge module 03, computing module 04, Executive Module 05, wherein,
Initialization module, be used to the user to provide to be provided with the maximum max_depth and the minimum value min_depth of the token bucket degree of depth, the maximum max_speed and the minimum value min_speed of token bucket brush token rate, the minimum threshold threshold of token number in the token bucket, the interface of the step value utility of the minimum threshold low_rate of token bucket depth increments A and brush token rate increment B and cpu busy percentage and the limit value hig_rate of wealthy family, cpu busy percentage, and preserve user's setting;
Data acquisition module 02 is used to obtain the current utilance rate of CPU and sends to computing module 04; Obtain the current state of token bucket and send to judge module 03, perhaps obtain in current time and the token bucket existing token number number and send to computing module 04;
Whether whether judge module 03, the current utilance rate that is used to judge CPU less than the minimum threshold min_rate of cpu busy percentage or greater than the limit value max_rate of wealthy family of cpu busy percentage, and judged result is sent to computing module 04; And judge the current state of token bucket type, whether judge token number H in the token bucket greater than minimum threshold threshold, and judged result is sent to Executive Module 05;
Computing module 04 is used for depth d epth, brush token rate speed and increase token number new_number in advance according to the judged result computational token bucket of judge module 03, and will increase token number new_number in advance and send to Executive Module 05; Perhaps the current time of receiving is also preserved as this refresh time now_time, calculate the current number of steps step_number of CPU, calculate this refresh time now_time and last time refresh time last_time time difference time_difference, and in the current depth d epth of computational token bucket and the token bucket existing token number number difference N and send to Executive Module 05;
Executive Module 05, be used for the data n ew_number/N that sends according to computing module 04, drop into a corresponding number token to token bucket, and be current token number H in unavailable and the token bucket during greater than minimum threshold threshold in the type of the current state of token bucket, be available with the status modifier of token bucket.
Above-mentioned explanation illustrates and has described a preferred embodiment of the present invention, but as previously mentioned, be to be understood that the present invention is not limited to the disclosed form of this paper, should not regard eliminating as to other embodiment, and can be used for various other combinations, modification and environment, and can in invention contemplated scope described herein, change by the technology or the knowledge of above-mentioned instruction or association area.And change that those skilled in the art carried out and variation do not break away from the spirit and scope of the present invention, then all should be in the protection range of claims of the present invention.

Claims (13)

1. the method for refreshing of a token bucket is characterized in that, said method comprising the steps of:
Obtain the current utilance of central processor CPU,
Calculate the current degree of depth and the current brush token rate of described token bucket according to the current utilance of described CPU;
According to described current brush token rate, calculate this and refresh and increase token number in advance;
Put into described several tokens of token that increase in advance to described token bucket.
2. method according to claim 1 is characterized in that, described method is carried out following steps when initialization:
The maximum and the minimum value of the described token bucket degree of depth are set, the maximum and the minimum value of described token bucket brush token rate, the minimum threshold of token number in the described token bucket, described token bucket depth increments and brush token rate increment;
The minimum threshold of cpu busy percentage and the step value of wealthy family's limit value and cpu busy percentage are set.
3. method according to claim 1 is characterized in that, describedly puts into described several tokens of token that increase in advance after the described token bucket step, and is further comprising the steps of:
Obtain the current state of described token bucket;
Judge the type of the current state of described token bucket, if available, then this refreshes end; If it is unavailable,
Judge that then whether current token number in the described token bucket is greater than minimum threshold, if then the state with token bucket is made as available; Otherwise this refreshes end.
4. method according to claim 2 is characterized in that, the current degree of depth and the current brush token rate step of described current utilance computational token bucket according to CPU specifically may further comprise the steps:
Whether the current utilance of judging described CPU is less than the minimum threshold of described cpu busy percentage, if, then the current degree of depth of described token bucket equals the maximum of the described token bucket degree of depth, and the current brush token rate of described token bucket equals the maximum of described token bucket brush token rate; Otherwise,
Whether the current utilance of judging described CPU is greater than the wealthy family limit value of described cpu busy percentage, if, then the current degree of depth of described token bucket equals the minimum value of the described token bucket degree of depth, and the current brush token rate of described token bucket equals the minimum value of described token bucket brush token rate; Otherwise,
According to the current utilance of described CPU, calculate the current number of steps of CPU;
According to the current number of steps of described CPU, calculate the current degree of depth and the current brush token rate of described token bucket.
5. method according to claim 4 is characterized in that, the current number of steps of described CPU is calculated by following formula:
step_number=(rate-low_rate)/utility
Wherein, step_number represents the current number of steps of CPU, and rate represents the current utilance of CPU, and low_rate represents the minimum threshold of cpu busy percentage, and utility represents the step value of cpu busy percentage.
6. according to claim 4 or 5 described methods, it is characterized in that the current degree of depth of described token bucket is calculated by following formula:
depth=min_depth+A*step_number
Wherein, depth represents the current degree of depth of token bucket, and min_depth represents the minimum value of the token bucket degree of depth, and A represents the token bucket depth increments, and step_number represents the current number of steps of CPU.
7. according to claim 4 or 5 described methods, it is characterized in that the current brush token rate of described token bucket is calculated by following formula:
speed=min_speed+B*step_number
Wherein, speed represents the current brush token rate of token bucket, and min_speed represents the minimum value of token bucket brush token rate, and B represents token bucket brush token rate increment, and step_number represents the current number of steps of CPU.
8. according to each described method of claim 1-4, it is characterized in that, described according to current brush token rate, calculate this and refresh and increase the token number step in advance and specifically may further comprise the steps:
Obtain the current time, as this refresh time and the preservation of described token bucket;
Calculate this refresh time and last time refresh time time difference;
Calculating this according to the current brush token rate of described time difference and described token bucket refreshes and increases token number in advance.
9. method according to claim 8 is characterized in that, the described token number that increases in advance calculates by following formula:
new_number=time_difference*speed
Wherein, new_number represents to increase in advance token number, time_difference represent this refresh time of token bucket and last time refresh time time difference, speed represents the current brush token rate of token bucket.
10. according to each described method of claim 1-4, it is characterized in that described putting into increases several tokens of token in advance and specifically may further comprise the steps to described token bucket step:
Obtain existing token number in the described token bucket;
Judge in the described token bucket existing token number with described increase in advance token number and whether smaller or equal to the current degree of depth of described token bucket, if then put into described several tokens of token that increase in advance and arrive described token bucket; Otherwise,
Calculate the difference of existing token number in the current degree of depth of described token bucket and the described token bucket;
Put into a described difference token to described token bucket.
11. the refreshing apparatus of a token bucket is characterized in that, comprises data acquisition module, computing module, Executive Module,
Described data acquisition module is used to obtain the current utilance of CPU and sends to described computing module;
Described computing module is used to calculate the degree of depth, the brush token rate of described token bucket and increases token number in advance, and the described token number that increases is in advance sent to described Executive Module;
Described Executive Module is used for the data according to described computing module transmission, drops into a corresponding number token to described token bucket.
12. device according to claim 11 is characterized in that, described device also comprises initialization module and judge module,
Described initialization module, the interface of the step value of the minimum threshold of the minimum threshold of token number in the maximum that is used to the user to provide to be provided with the maximum of the described token bucket degree of depth and minimum value, described token bucket brush token rate and minimum value, the described token bucket, described token bucket depth increments and brush token rate increment, cpu busy percentage and wealthy family's limit value and cpu busy percentage, and preserve described user's setting;
Whether whether described judge module, the current utilance that is used to judge described CPU less than the minimum threshold of described cpu busy percentage or greater than the wealthy family limit value of described cpu busy percentage, and judged result is sent to described computing module; And judge the current state of described token bucket type, whether judge current token number in the described token bucket greater than minimum threshold, and judged result is sent to described Executive Module.
13. according to claim 11 or 12 described devices, it is characterized in that,
Described data acquisition module also is used to obtain the current state of described token bucket and sends to described judge module, and obtains in current time or the token bucket existing token number and send to described computing module;
Described computing module, the current time that also is used for receiving is as this refresh time and preservation; Perhaps calculate the current number of steps of CPU, calculate this refresh time and last time refresh time time difference, and calculate the difference of existing token number in the current degree of depth of described token bucket and the described token bucket and send to described Executive Module;
Described Executive Module, the current token number that also is used for type in the current state of token bucket and is unavailable and token bucket be during greater than minimum threshold, is available with the status modifier of token bucket.
CN201110096479.XA 2011-04-18 2011-04-18 The method for refreshing of token bucket and device Expired - Fee Related CN102164083B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201110096479.XA CN102164083B (en) 2011-04-18 2011-04-18 The method for refreshing of token bucket and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201110096479.XA CN102164083B (en) 2011-04-18 2011-04-18 The method for refreshing of token bucket and device

Publications (2)

Publication Number Publication Date
CN102164083A true CN102164083A (en) 2011-08-24
CN102164083B CN102164083B (en) 2016-02-10

Family

ID=44465064

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201110096479.XA Expired - Fee Related CN102164083B (en) 2011-04-18 2011-04-18 The method for refreshing of token bucket and device

Country Status (1)

Country Link
CN (1) CN102164083B (en)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103560974A (en) * 2013-10-25 2014-02-05 华为技术有限公司 Method and device for maintaining tokens
CN104980779A (en) * 2015-04-10 2015-10-14 腾讯科技(成都)有限公司 Transmission control method and device of video data
CN105939286A (en) * 2016-03-28 2016-09-14 杭州迪普科技有限公司 Token bucket management method and device
CN106789720A (en) * 2016-12-16 2017-05-31 无锡路通视信网络股份有限公司 A kind of dynamic token bucket generation method based on system hardware utilization rate
CN106843170A (en) * 2016-11-30 2017-06-13 浙江中控软件技术有限公司 Method for scheduling task based on token
CN111343102A (en) * 2020-02-03 2020-06-26 中国银联股份有限公司 Flow rate control method, server-side server, client-side server and system
CN113381944A (en) * 2021-06-09 2021-09-10 中国工商银行股份有限公司 System current limiting method, apparatus, electronic device, medium, and program product

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1968137A (en) * 2006-04-30 2007-05-23 华为技术有限公司 Media stream checking system and code stream generation node checking device
US7369489B1 (en) * 2002-03-12 2008-05-06 Cisco Technology, Inc. Unbiased token bucket
CN101355585A (en) * 2008-09-02 2009-01-28 中兴通讯股份有限公司 System and method for protecting information of distributed architecture data communication equipment

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7369489B1 (en) * 2002-03-12 2008-05-06 Cisco Technology, Inc. Unbiased token bucket
CN1968137A (en) * 2006-04-30 2007-05-23 华为技术有限公司 Media stream checking system and code stream generation node checking device
CN101355585A (en) * 2008-09-02 2009-01-28 中兴通讯股份有限公司 System and method for protecting information of distributed architecture data communication equipment

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
黎晓亮: "《多重令牌重分配流量整形研究》", 30 November 2010, article "多重令牌重分配流量整形研究" *

Cited By (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103560974B (en) * 2013-10-25 2017-01-25 华为技术有限公司 Method and device for maintaining tokens
US9641440B2 (en) 2013-10-25 2017-05-02 Huawei Technologies Co., Ltd. Method and apparatus for maintaining token
CN103560974A (en) * 2013-10-25 2014-02-05 华为技术有限公司 Method and device for maintaining tokens
CN104980779B (en) * 2015-04-10 2018-04-20 腾讯科技(成都)有限公司 The transfer control method and device of video data
CN104980779A (en) * 2015-04-10 2015-10-14 腾讯科技(成都)有限公司 Transmission control method and device of video data
CN105939286A (en) * 2016-03-28 2016-09-14 杭州迪普科技有限公司 Token bucket management method and device
CN105939286B (en) * 2016-03-28 2019-05-07 杭州迪普科技股份有限公司 Token bucket management method and device
CN106843170A (en) * 2016-11-30 2017-06-13 浙江中控软件技术有限公司 Method for scheduling task based on token
CN106843170B (en) * 2016-11-30 2019-06-14 浙江中控软件技术有限公司 Method for scheduling task based on token
CN106789720A (en) * 2016-12-16 2017-05-31 无锡路通视信网络股份有限公司 A kind of dynamic token bucket generation method based on system hardware utilization rate
CN106789720B (en) * 2016-12-16 2020-06-16 无锡路通视信网络股份有限公司 Dynamic token bucket generation method based on system hardware utilization rate
CN111343102A (en) * 2020-02-03 2020-06-26 中国银联股份有限公司 Flow rate control method, server-side server, client-side server and system
CN111343102B (en) * 2020-02-03 2023-09-26 中国银联股份有限公司 Flow rate control method, server, client server and system
CN113381944A (en) * 2021-06-09 2021-09-10 中国工商银行股份有限公司 System current limiting method, apparatus, electronic device, medium, and program product

Also Published As

Publication number Publication date
CN102164083B (en) 2016-02-10

Similar Documents

Publication Publication Date Title
CN102164083A (en) Method and device for refreshing token bucket
US9571382B2 (en) Method, controller, and system for processing data packet
WO2017184554A3 (en) Requesting and delivering content over an ipv6 network
US10356037B2 (en) Address resolution rewriting
CN105556916B (en) The information statistical method and device of network flow
WO2014115157A8 (en) Address resolution in software-defined networks
JP6633775B2 (en) Packet transmission
US20170078210A1 (en) Controlling Packet Transmission In Software Defined Network
CN102685006A (en) Method and device for forwarding data messages
CN106330742B (en) Flow control method and network controller
WO2015172668A1 (en) Method and device for determining congestion window in network
WO2016115853A1 (en) User equipment (ue) processing method and apparatus
CN104852855B (en) Jamming control method, device and equipment
US20170141995A1 (en) Data delivery method based on software defined networking and software defined networking controller using the method
CN110519009B (en) Data packet transmission method and device
CN104980368A (en) Bandwidth guarantee method and apparatus in software defined network (SDN)
CN104038425A (en) Method and device for forwarding Ethernet packet
CN107566293B (en) Method and device for limiting message speed
CN104601467A (en) Method and device for sending messages
US20230084470A1 (en) Method and apparatus for controlling network traffic path
EP2608460B1 (en) Method and device for sending messages
CN104160735B (en) Send out message processing method, transponder, message processor, message handling system
WO2015123853A1 (en) Data flow processing method and apparatus
CN102223311A (en) Queue scheduling method and device
CN105939404B (en) The acquisition methods and device of NAT resource

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20160210

Termination date: 20200418