CN102164083B - The method for refreshing of token bucket and device - Google Patents

The method for refreshing of token bucket and device Download PDF

Info

Publication number
CN102164083B
CN102164083B CN201110096479.XA CN201110096479A CN102164083B CN 102164083 B CN102164083 B CN 102164083B CN 201110096479 A CN201110096479 A CN 201110096479A CN 102164083 B CN102164083 B CN 102164083B
Authority
CN
China
Prior art keywords
token
current
token bucket
cpu
depth
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.)
Expired - Fee Related
Application number
CN201110096479.XA
Other languages
Chinese (zh)
Other versions
CN102164083A (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

Abstract

The present invention relates to a kind of method for refreshing and device of token bucket, said method comprises the current utilization obtaining CPU, the current depth of above-mentioned token bucket and current brush token rate is calculated according to the current utilization of above-mentioned CPU, according to above-mentioned current brush token rate, calculate this refreshing and increase token number in advance, put into the several token of above-mentioned pre-increasing token to above-mentioned token bucket; Said apparatus comprises data acquisition module, computing module and Executive Module.The present invention realizes simply, improves treatment effeciency and the disposal ability of CPU.

Description

The method for refreshing of token bucket and device
Technical field
The present invention relates to communication data field, particularly relate to a kind of method for refreshing and device of token bucket.
Background technology
Under normal circumstances, the core component of three-tier switch and router is made up of devices such as exchange chip, network processing unit and CPU (CentralProcessingUnit, central processing unit).The forwarding of data message is responsible for by exchange chip and network processing unit, by data message forwarding is completed repeating process to other ports on switch.For IP (InternetProtocol, procotol) protocol massages in network is as ARP (AddressResolutionProtocol, address resolution protocol) bag, OSPF (OpenShortestPathFirst, ospf) protocol package and IGMP (InternetGroupMulticastProtocol, IGMP) bag etc. be forwarded to CPU by exchange chip and network processing unit, carried out the process to protocol package by CPU.
Increasing protocol massages needs, by exchange chip or network processing unit deliver to CPU, to make the burden of CPU more and more heavier.Common protocol massages send frequency also little, if but the multiple devices in system send protocol package simultaneously, and to the words that the protocol package number above delivering to CPU does not limit, CPU is easy to can be dead by the large discharge protocol package punching happened suddenly, equipment is caused normally not run, so must limit engraving time a certain the protocol package quantity of giving CPU, the most frequently used method is realized by token bucket exactly.
Conventional token bucket method for refreshing is by arranging the token bucket degree of depth and brush token rate, and according to this refresh time and last time brush token time time difference and brush token rate produce new token and be put in token bucket.When protocols having wrap send time, check token bucket state, if token bucket state is available, then from token bucket, obtain a token, protocol package is sent, if 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 fixing, no matter cpu busy or free time, its each second, the token number of brush was the same, this makes CPU when busy, is easy to by the punching of large discharge protocol package dead, causes equipment normally not run.
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 improves the disposal ability of existing CPU, easily realizes.
The invention provides a kind of method for refreshing of token bucket, said method comprises the following steps:
Obtain the current utilization of CPU,
The current depth of above-mentioned token bucket and current brush token rate is calculated according to the current utilization of above-mentioned CPU;
According to above-mentioned current brush token rate, calculate this refreshing and increase token number in advance;
Put into the several token of above-mentioned pre-increasing token to above-mentioned token bucket.
Preferably, said method, when initialization, performs following steps:
The maxima and minima of the above-mentioned token bucket degree of depth is set, the maxima and minima of above-mentioned token bucket brush token rate, the minimum threshold of token number in 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 most high threshold and cpu busy percentage are set.
Preferably, above-mentioned put into the several token of above-mentioned pre-increasing token to above-mentioned token bucket step after, 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 unavailable,
Then judge whether the current token number in above-mentioned token bucket is greater than minimum threshold, and if so, then the state of token bucket is set to available; Otherwise this refreshes end.
Preferably, the current depth of the above-mentioned current utilization computational token bucket according to CPU and current brush token rate step specifically comprise the following steps:
Judge whether the current utilization of above-mentioned CPU is less than the minimum threshold of above-mentioned cpu busy percentage, if, then the current 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,
Judge whether the current utilization of above-mentioned CPU is greater than the most high threshold of above-mentioned cpu busy percentage, if, then the current 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 utilization 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 depth of above-mentioned token bucket and current brush token rate.
Preferably, the current number of steps of above-mentioned CPU is by following formulae discovery:
step_number=(rate-low_ate)/utility
Wherein, step_number represents the current number of steps of CPU, and rate represents CPU current utilization, and low_rate represents the minimum threshold of cpu busy percentage, and utility represents the step value of cpu busy percentage.
Preferably, the current depth of above-mentioned token bucket is by following formulae discovery:
depth=min_depth+A*step_number
Wherein, depth represents the current depth of token bucket, and min_depth represents the minimum value of the token bucket degree of depth, and A represents 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 by following formulae discovery:
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 the pre-token number step that increases of this refreshing and specifically comprise the following steps:
Obtain current time, as above-mentioned token bucket this refresh time and preserve;
Calculate this refresh time and last time refresh time time difference;
Calculate this refreshing according to the current brush token rate of above-mentioned time difference and above-mentioned token bucket and increase token number in advance.
Preferably, above-mentioned pre-increasing token number is by following formulae discovery:
new_number=time_difference*speed
Wherein, new_number represents and increases token number in advance, 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, the above-mentioned several token of pre-increasing token of putting into specifically comprises the following steps to above-mentioned token bucket step:
Obtain existing token number in above-mentioned token bucket;
To judge in above-mentioned token bucket existing token number and above-mentioned pre-increasing token number with the current depth whether being less than or equal to above-mentioned token bucket, if so, then put into the several token of above-mentioned pre-increasing token to above-mentioned token bucket; Otherwise,
Calculate the difference of existing token number in the current depth of above-mentioned token bucket and above-mentioned token bucket;
Put into an above-mentioned difference token to above-mentioned token bucket.
Present invention also offers a kind of refreshing apparatus of token bucket, comprise data acquisition module, computing module, Executive Module,
Above-mentioned data acquisition module, for obtaining the current utilization of CPU and sending to above-mentioned computing module;
Above-mentioned computing module, for calculating the degree of depth, the brush token rate of above-mentioned token bucket and increasing token number in advance, and sends to above-mentioned Executive Module by above-mentioned pre-increasing token number;
Above-mentioned Executive Module, for the data sent according to above-mentioned computing 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, for providing the maxima and minima, the maxima and minima of above-mentioned token bucket brush token rate, the interface of the minimum threshold of the minimum threshold of token number, above-mentioned token bucket depth increments and brush token rate increment, cpu busy percentage and the step value of most high threshold and cpu busy percentage in above-mentioned token bucket that arrange the above-mentioned token bucket degree of depth for user, and preserve above-mentioned user and arrange;
Above-mentioned judge module, for judging whether the current utilization of above-mentioned CPU is less than the minimum threshold of above-mentioned cpu busy percentage or whether is greater than the most high threshold of above-mentioned cpu busy percentage, and sends to above-mentioned computing module by judged result; And judge the type of current state of above-mentioned token bucket, whether the current token number judged in above-mentioned token bucket be greater than minimum threshold, and judged result sent to above-mentioned Executive Module.
Preferably, above-mentioned data acquisition module, also for obtaining the current state of above-mentioned token bucket and sending to above-mentioned judge module, and obtains existing token number in current time or token bucket and sends to above-mentioned computing module;
Above-mentioned computing module, also for the current time received being preserved as this refresh time; Or calculate the current number of steps of CPU, calculate the time difference of this refresh time and refresh time last time, and calculate in the current depth of above-mentioned token bucket and above-mentioned token bucket and have the difference of token number and send to above-mentioned Executive Module;
Above-mentioned Executive Module is also unavailable for the type of the current state at token bucket and current token number in token bucket is greater than minimum threshold time, the status modifier of token bucket is available.
The present invention adjusts the degree of depth, the brush token rate of token bucket real-time dynamicly according to the current utilization of CPU; the degree of depth and the brush token rate of token bucket is increased when CPU current utilization is lower; the degree of depth and the brush token rate of token bucket is reduced when CPU current utilization is higher; make, under the prerequisite of not upgrading CPU, while protecting CPU, to improve treatment effeciency and the disposal ability of CPU.The present invention is applicable to the occasion being realized speed limit in the communication equipment such as switch, router by token bucket.
Accompanying drawing explanation
Accompanying drawing described herein is used to provide a further understanding of the present invention, forms a part of the present invention, and schematic description and description of the present invention, for explaining the present invention, does not form inappropriate limitation 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 clearly, understand, below in conjunction with drawings and Examples, the present invention is further elaborated.Should be appreciated that specific embodiment described herein only in order to explain the present invention, be not intended to limit the present invention.
As shown in Figure 1, be the method for refreshing flow chart of token bucket of the present invention, the present embodiment specifically comprises the following steps:
Step S001: the parameter needed 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 of token bucket brush token rate and minimum value min_speed, the minimum threshold threshold of token number in token bucket, token bucket depth increments A, token bucket brush token rate increment B, the minimum threshold low_rate of cpu busy percentage and the step value utility of most high threshold hig_rate and cpu busy percentage;
Step S002: the current utilization rate obtaining CPU;
Step S003: judge whether the current utilization rate of CPU is less than the minimum threshold low_rate of cpu busy percentage, if so, then performs step S004; Otherwise, perform step S005;
Step S004: the current depth depth 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, performs step S009;
That is:
depth=max_depth
speed=max_speed
Step S005: judge whether the current utilization rate of CPU is greater than the most high threshold hig_rate of cpu busy percentage, if so, then performs step S006; Otherwise, perform step S007;
Step S006: the current depth depth 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, performs step S009;
Namely
depth=min_depth
speed=min_speed
Step S007: according to the current utilization rate of CPU, calculates the current number of steps step_number of CPU;
Above-mentioned number of steps implication is, the current utilization rate of CPU, for the minimum threshold low_rate of its utilance, has changed how many step values.
This step is by following formulae discovery:
step_number=(rate-low_rate)/utility
Wherein, step_number represents the current number of steps of CPU, and rate represents CPU current utilization, 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 depth of computational token bucket and current brush token rate speed;
This step is by following formulae discovery:
depth=min_depth+A*step_number
speed=min_speed+B*step_number
Wherein, depth represents the current depth of token bucket, and min_depth represents the minimum value of the token bucket degree of depth, and A represents 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 current time, as token bucket this refresh time now_time and preserve;
Step S010: calculate this refresh time now_time and last time refresh time last_time time difference time_difference;
Step S011: the current brush token rate speed according to above-mentioned time difference time_difference and token bucket calculates this refreshing pre-increasing token number new_number;
This step is by following formulae discovery:
new_number=time_difference*speed
Wherein, new_number represents and increases token number in advance, 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 token bucket;
Namely the quantity of existing token in token bucket is obtained.
Step S013: to judge in token bucket existing token number number and increase token number new_number's in advance and whether be less than or equal to the current depth depth of token bucket, if so, then execution step S014; Otherwise, perform step S015;
Step S014: put into pre-token number new_number the token that increase to token bucket, perform step S017;
Step S015: the current depth depth of computational token bucket and token bucket in the difference N of existing token number number;
That is:
N=depth-number
Step S016: put into the N number of token of above-mentioned difference to token bucket;
Step S017: the current state obtaining token bucket;
Step S018: the type judging the current state of above-mentioned token bucket, if the current state of token bucket is available, then performs step S021; If the current state of token bucket is unavailable, then, step S019 is performed;
Step S019: judge whether the current token number H in token bucket is greater than minimum threshold threshold, if so, then performs step S020; Otherwise, perform step S021;
That is:
As number+new_number≤depth, H=number+new_number;
As number+new_number > depth, H=number+N=depth;
Wherein, number to represent in token bucket existing token number, and new_number represents and increases token number in advance, and N represents the difference having token number number in the current depth depth of token bucket and token bucket, and depth represents the current depth of token bucket.
Step S020: the state of token bucket is set to 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, for providing the maximum max_depth and minimum value min_depth that arrange the token bucket degree of depth for user, the maximum max_speed of token bucket brush token rate and minimum value min_speed, the minimum threshold threshold of token number in 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 most high threshold hig_rate, cpu busy percentage, and preserve user and arrange;
Data acquisition module 02, for obtaining the current utilization rate of CPU and sending to computing module 04; Obtain the current state of token bucket and send to judge module 03, or obtain existing token number number in current time and token bucket and send to computing module 04;
Judge module 03, for judging whether the current utilization rate of CPU is less than the minimum threshold min_rate of cpu busy percentage or whether is greater than the most high threshold max_rate of cpu busy percentage, and sends to computing module 04 by judged result; And judge the type of current state of token bucket, whether the token number H judged in token bucket be greater than minimum threshold threshold, and judged result sent to Executive Module 05;
Computing module 04, for degree of depth depth, brush token rate speed and the pre-increasing token number new_number of the judged result computational token bucket according to judge module 03, and sends to Executive Module 05 by increasing token number new_number in advance; Or the current time received is 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 depth of computational token bucket and token bucket existing token number number difference N and send to Executive Module 05;
Executive Module 05, for the data new_number/N sent according to computing module 04, drop into a corresponding number token to token bucket, and when the type of the current state of token bucket is unavailable and current token number H in token bucket is greater than minimum threshold threshold, the status modifier of token bucket is available.
Above-mentioned explanation illustrate and describes a preferred embodiment of the present invention, but as previously mentioned, be to be understood that the present invention is not limited to the form disclosed by this paper, should not regard the eliminating to other embodiments as, and can be used for other combinations various, amendment and environment, and can in invention contemplated scope described herein, changed by the technology of above-mentioned instruction or association area or knowledge.And the change that those skilled in the art carry out and change do not depart from the spirit and scope of the present invention, then all should in the protection range of claims of the present invention.

Claims (10)

1. a method for refreshing for token bucket, is characterized in that, said method comprising the steps of:
Obtain the current utilization of central processor CPU,
The current depth of described token bucket and current brush token rate is calculated according to the current utilization of described CPU;
According to described current brush token rate, calculate this refreshing and increase token number in advance;
Put into the several token of described pre-increasing token to described token bucket;
Wherein, described method, when initialization, performs following steps:
The maxima and minima of the token bucket degree of depth is set, the maxima and minima of token bucket brush token rate, the minimum threshold of token number in described token bucket, token bucket depth increments and brush token rate increment;
The minimum threshold of cpu busy percentage and the step value of most high threshold and cpu busy percentage are set;
Wherein, the described current utilization according to described CPU calculates the current depth of described token bucket and current brush token rate step specifically comprises the following steps:
Judge whether the current utilization of described CPU is less than the minimum threshold of described cpu busy percentage, if, then the current 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,
Judge whether the current utilization of described CPU is greater than the most high threshold of described cpu busy percentage, if, then the current 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 utilization of described CPU, calculate the current number of steps of CPU;
According to the current number of steps of described CPU, calculate the current depth of described token bucket and current brush token rate.
2. method according to claim 1, is characterized in that, described in put into the several token of described pre-increasing token to described token bucket step after, 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 unavailable,
Then judge whether the current token number in described token bucket is greater than minimum threshold, and if so, then the state of token bucket is set to available; Otherwise this refreshes end.
3. method according to claim 1, is characterized in that, the current number of steps of described CPU is by following formulae discovery:
step_number=(rate-low_rate)/utility
Wherein, step_number represents the current number of steps of CPU, and rate represents CPU current utilization, and low_rate represents the minimum threshold of cpu busy percentage, and utility represents the step value of cpu busy percentage.
4. the method according to claim 1 or 3, is characterized in that, the current depth of described token bucket is by following formulae discovery:
depth=min_depth+A*step_number
Wherein, depth represents the current depth of token bucket, and min_depth represents the minimum value of the token bucket degree of depth, and A represents token bucket depth increments, and step_number represents the current number of steps of CPU.
5. the method according to claim 1 or 3, is characterized in that, the current brush token rate of described token bucket is by following formulae discovery:
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.
6. the method according to any one of claim 1-2, is characterized in that, described according to current brush token rate, calculates the pre-token number step that increases of this refreshing and specifically comprises the following steps:
Obtain current time, as described token bucket this refresh time and preserve;
Calculate this refresh time and last time refresh time time difference;
Calculate this refreshing according to the current brush token rate of described time difference and described token bucket and increase token number in advance.
7. method according to claim 6, is characterized in that, described pre-increasing token number is by following formulae discovery:
new_number=time_difference*speed
Wherein, new_number represents and increases token number in advance, 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.
8. the method according to any one of claim 1-2, is characterized in that, described in put into the several token of described pre-increasing token and specifically comprise the following steps to described token bucket step:
Obtain existing token number in described token bucket;
To judge in described token bucket existing token number and described pre-increasing token number with the current depth whether being less than or equal to described token bucket, if so, then put into the several token of described pre-increasing token to described token bucket; Otherwise,
Calculate the difference of existing token number in the current depth of described token bucket and described token bucket;
Put into a described difference token to described token bucket.
9. a refreshing apparatus for token bucket, is characterized in that, comprises data acquisition module, computing module, Executive Module,
Described data acquisition module, for obtaining the current utilization of CPU and sending to described computing module;
Described computing module, for calculating the degree of depth, the brush token rate of described token bucket and increasing token number in advance, and sends to described Executive Module by described pre-increasing token number;
Described Executive Module, for the data sent according to described computing module, drops into a corresponding number token to described token bucket;
Wherein, described device also comprises initialization module and judge module,
Described initialization module, for provide for user the token bucket degree of depth is set maxima and minima, the maxima and minima of token bucket brush token rate, the minimum threshold of token number in described token bucket, token bucket depth increments and brush token rate increment, the minimum threshold of cpu busy percentage and the step value of most high threshold and cpu busy percentage interface, and preserve the setting of described user;
Described judge module, for judging whether the current utilization of described CPU is less than the minimum threshold of described cpu busy percentage or whether is greater than the most high threshold of described cpu busy percentage, and sends to described computing module by judged result; And judge the type of current state of described token bucket, whether the current token number judged in described token bucket be greater than minimum threshold, and judged result sent to described Executive Module;
Wherein, described judge module is also for judging whether the current utilization of described CPU is less than the minimum threshold of described cpu busy percentage, if, then the current 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, judge whether the current utilization of described CPU is greater than the most high threshold of described cpu busy percentage, if so, then the current 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; If the current utilization of described CPU is more than or equal to the minimum threshold of described cpu busy percentage and is less than or equal to the most high threshold of described cpu busy percentage, then described computing module is also for the current utilization according to described CPU, calculates the current number of steps of CPU; And according to the current number of steps of described CPU, calculate the current depth of described token bucket and current brush token rate.
10. device according to claim 9, is characterized in that,
Described data acquisition module, also for obtaining the current state of described token bucket and sending to described judge module, and obtains existing token number in current time or token bucket and sends to described computing module;
Described computing module, also for the current time received being preserved as this refresh time; Or calculate the current number of steps of CPU, calculate the time difference of this refresh time and refresh time last time, and calculate in the current depth of described token bucket and described token bucket and have the difference of token number and send to described Executive Module;
Described Executive Module is also unavailable for the type of the current state at token bucket and current token number in token bucket is greater than minimum threshold time, the status modifier of token bucket is available.
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 CN102164083A (en) 2011-08-24
CN102164083B true 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)

Families Citing this family (7)

* 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
CN104980779B (en) * 2015-04-10 2018-04-20 腾讯科技(成都)有限公司 The transfer control method and device of video data
CN105939286B (en) * 2016-03-28 2019-05-07 杭州迪普科技股份有限公司 Token bucket management method and device
CN106843170B (en) * 2016-11-30 2019-06-14 浙江中控软件技术有限公司 Method for scheduling task based on token
CN106789720B (en) * 2016-12-16 2020-06-16 无锡路通视信网络股份有限公司 Dynamic token bucket generation method based on system hardware utilization rate
CN111343102B (en) * 2020-02-03 2023-09-26 中国银联股份有限公司 Flow rate control method, server, client server and system
CN113381944B (en) * 2021-06-09 2022-08-12 中国工商银行股份有限公司 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

Also Published As

Publication number Publication date
CN102164083A (en) 2011-08-24

Similar Documents

Publication Publication Date Title
CN102164083B (en) The method for refreshing of token bucket and device
US9571382B2 (en) Method, controller, and system for processing data packet
US10356037B2 (en) Address resolution rewriting
CN105100142A (en) Transmission control method and device of software defined network (SDN) protocol message
US11337211B2 (en) Operation request generating method, device, and system
WO2014115157A8 (en) Address resolution in software-defined networks
US10050875B2 (en) Network service processing method and apparatus
CN104980368A (en) Bandwidth guarantee method and apparatus in software defined network (SDN)
CN102685006A (en) Method and device for forwarding data messages
EP3313032B1 (en) Cloud platform security realization
CN101286996A (en) Storm attack resisting method and apparatus
US20180375740A1 (en) Network device management method and apparatus
WO2016045368A1 (en) Three-layer-forwarding device route table capacity expansion method and forwarding device
CN104601467A (en) Method and device for sending messages
EP2608460B1 (en) Method and device for sending messages
Ndonda et al. A low-delay SDN-based countermeasure to eavesdropping attacks in industrial control systems
CN105704097A (en) Method and device for defending against attacks
CN106341335A (en) Traffic control method and traffic control system based on SDN
Sumadi et al. Semi-reactive switch based proxy arp in sdn
EP3062461B1 (en) Method, device, and system for configuring maintenance association (ma)
CN103118115B (en) Facing cloud calculates virtual machine management method and the device of user
CN104363172B (en) A kind of data receiving-transmitting method and device
CN112583947B (en) DHCP processing method, device, equipment and machine readable storage medium
KR101491699B1 (en) Control apparatus and method thereof in software defined networking
CN104320339B (en) Method for forming correct forwarding table through CPU periodic broadcast or multicast

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

Granted publication date: 20160210

Termination date: 20200418

CF01 Termination of patent right due to non-payment of annual fee