CN101841461A - Method and device for controlling update of token bucket - Google Patents
Method and device for controlling update of token bucket Download PDFInfo
- Publication number
- CN101841461A CN101841461A CN201010111110A CN201010111110A CN101841461A CN 101841461 A CN101841461 A CN 101841461A CN 201010111110 A CN201010111110 A CN 201010111110A CN 201010111110 A CN201010111110 A CN 201010111110A CN 101841461 A CN101841461 A CN 101841461A
- Authority
- CN
- China
- Prior art keywords
- token bucket
- value
- aggregate
- token
- update
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Abstract
The invention discloses a method and a device for controlling the update of a token bucket, which are applied to the technical field of networks. The method comprises the following steps of: acquiring a byte count in a message to be transmitted and updating an aggregate value by utilizing an algebraic sum of the byte count and the saved aggregate value; and comparing the updated aggregate value with a preset byte count update threshold value, and if the aggregate value is greater than the byte count update threshold value, updating the token bucket of a channel and clearing the aggregate value. The method and the device provided by the embodiment of the invention can effectively reduce token updating frequency to further reduce the occupation of a network equipment processor on the premise of not influencing conventional bandwidth control accuracy.
Description
Technical field
The present invention relates to networking technology area, be specifically related to be applied to the method and apparatus of the control update of token bucket of network equipment flow control.
Background technology
Flow control divides different formations to give buffer memory by the different message of identification, and then with certain strategy, as according to priority, the process of transmission is dispatched in bandwidth control etc. between formation.Different with doing one's best of transmitting of traditional message, flow control is distinguished message and is treated, and can accomplish preferentially to transmit some message, thereby satisfy various demands in the actual environment, as guarantee basic the application and crucial the application, guarantees emphasis user bandwidth or the like.
The tradition flow control as shown in Figure 1, scheduler is distinguished message and buffer memory by the precedence field in the identification IP message; Adopt absolute priority scheduling or weight robin scheduling then, guarantee that the high message of priority preferentially sends.The notable attribute of tradition flow control is exactly that the formation number of buffer memory message is fixed, and is 4 or 8 etc.
Flow control after the improvement as shown in Figure 2, flow control model for stratification, the all corresponding flow control token bucket of each business of user, corresponding token bucket of each user in second layer management, realization is provided with the flow control token bucket to the flow control of a plurality of business the 3rd layer of user's group of more a plurality of users being formed, and the 4th layer is provided with physical port corresponding token bucket, thereby realize token bucket binding hierarchy flow control model, i.e. the level token bucket.The level token bucket has been realized the stratification control to user bandwidth, and as " stratification " management to water of water supply line in the reality, its outstanding feature is that packet buffer formation number is indefinite, is configured according to user's needs fully.
Token bucket is widely used in the flow control as a kind of rate calculations and control device, and its operation principle is as follows:
Token is put into bucket with certain speed, and a token can send the packet of certain-length, and bucket has specific capacity, if bucket is full, initiate token will be dropped;
Send a packet, just the token number that deletion equates with data length in the packet from token bucket;
If there are not enough tokens to send packet, this packet will be waited for up to enough tokens are arranged, perhaps be dropped;
According to above-mentioned control principle, make when sending packet, can only E-Packet with particular rate, thereby reach the purpose of rate controlled.
Need to prove that in actual the realization, for the consideration of performance, following scheme is often adopted in the renewal of token bucket:
Record upgraded the time point of token in the token bucket last time;
Obtain the time interval of upgrading the time point of token last time of current time and record;
The time interval multiply by token and adds speed, promptly obtains adding to the token number of token bucket;
With speed limit 1K (1000 byte) is example, and hypothetical network equipment minimum time unit is 1ms (millisecond), and a token can send the data of 1 byte, and this token bucket relevant parameter is as follows:
Bucket is dark: 1000 tokens;
The initial token number of token bucket: 1000 tokens promptly can send the data of 1000 byte lengths;
Token renewal rate: 1000 tokens/1000ms=1 token/ms;
From the moment 0, sent a message and the message that length is 512 bytes that length is 256 bytes when supposing time point 10ms, the more new situation of token bucket is as follows:
When sending the message of length 256 bytes, the more new situation of described each parameter of token bucket is as shown in table 1:
| Existing token number | 1000 tokens |
| Send message and consume token | 256 tokens |
| Upgrade the token time difference | ??10ms |
| Newly-increased token | 10ms * 1 token/ms=10 token, and note and upgrade token and be 10ms constantly |
| Final token number | The 1000-256+10=754 token |
Table 1
When sending the message of length 512 bytes, the more new situation of described each parameter of token bucket is as shown in table 1:
| Existing token number | 754 tokens |
| Send message and consume token | 512 tokens |
| Upgrade the token time difference | ??10ms-10ms＝0ms |
| Newly-increased token | 0ms * 1 token/ms=0 token, and note and upgrade token and be 10ms constantly |
| Final token number | The 754-512+0=242 token |
Table 2
In addition, token bucket binding hierarchy flow control model is the level token bucket in the prior art.The level token bucket has been realized the stratification control to user bandwidth, as " stratification " management to water of water supply line in the reality.
With Fig. 3 is example, and update of token bucket mode in the prior art is described, if certain company's network egress bandwidth is 4K, department one distributes bandwidth 1K, and other department respectively distributes bandwidth some:
When department one sent message, the update mode of level token bucket was as follows:
New tunnel more: the token bucket of " department one ", according to sending the consumption of message length computational token, and newly-increased token etc.;
The parent channel of renewal department one: the token bucket of " company's outlet ", finish the calculating that outlet bandwidth consumes;
Darker when the passage tree hierachy, the update calculation amount of token bucket is bigger, becomes more frequent, and level token bucket token shown in Figure 4 when token upgrades, specifically comprises:
Work as passage: " domestic consumer " transmits a message, and its token renewal process is as follows:
New tunnel more: the token bucket of " domestic consumer ";
New tunnel more: the token bucket of " group one ";
New tunnel more: the token bucket of " department one ";
New tunnel more: the token bucket of " company's outlet ";
Can see that along with increasing of level, the token bucket number that message of every transmission need upgrade is also along with increasing.And in the real network environment, hundred Broadcom per seconds can send the message of more than 100 ten thousand 64 bytes, therefore above-mentioned token computation is to be unit with 1,000,000 per seconds, and multiply by the number of plies of token bucket, so the renewal of token bucket can take the ample resources of network equipment processor.
Summary of the invention
The invention provides a kind of method and apparatus of controlling update of token bucket, the renewal that is used for solving the prior art token bucket frequently takies the ample resources problem of network equipment processor.
A kind of method of controlling update of token bucket comprises:
When the leaf passage sends message, obtain the byte number in the message to be sent, and the algebraical sum of using the aggregate-value of this byte number and preservation is upgraded described aggregate-value;
Aggregate-value after upgrading and the byte length of presetting are upgraded threshold value compare,, then upgrade the token bucket of described leaf passage if described aggregate-value upgrades threshold value greater than byte number, and with described aggregate-value zero clearing.
Upgrade threshold value if described aggregate-value is not more than byte number, whether the time interval of determining current time and last update of token bucket greater than the preset interval time threshold value, if, then upgrade the token bucket of described leaf passage, and with described aggregate-value zero clearing.
The token bucket that upgrades described leaf passage comprises: deduct described aggregate-value in total token number, and the record current time is the update of token bucket time point.
A kind of device of controlling update of token bucket comprises:
Data length value acquisition module is used for obtaining the data length value of message to be sent when the leaf passage sends message, and the algebraical sum of using the aggregate-value of this data length value and preservation is upgraded described aggregate-value;
Elementary update of token bucket module is used for that aggregate-value after upgrading and the byte number of presetting are upgraded threshold value and compares, if described aggregate-value upgrades threshold value greater than byte number, then upgrades the token bucket of described leaf passage, and with described aggregate-value zero clearing.
Secondary update of token bucket module, upgrade threshold value if be used for described aggregate-value greater than byte number, whether the time interval of determining current time and last update of token bucket greater than the preset interval time threshold value, if, then upgrade the token bucket of described leaf passage, and with described aggregate-value zero clearing.
The token bucket that upgrades described leaf passage in elementary update of token bucket module and the secondary update of token bucket module specifically comprises: deduct described aggregate-value in total token number, and the record current time is the update of token bucket time point.
The method and apparatus that the embodiment of the invention provides is set byte length and is upgraded threshold value, when the byte length that sends message surpasses this threshold value, upgrades token bucket.The method and apparatus of using the embodiment of the invention has reduced the number of times that upgrades token, thereby reduces the taking of network equipment processor, and has improved the data forwarding performance of data forwarding passage.
Description of drawings
Fig. 1 is a flow control schematic diagram in the prior art;
Fig. 2 is the middle-level flow control schematic diagram of prior art;
Fig. 3 is 4K for certain company's network egress bandwidth in the prior art, and department one distributes the schematic diagram of bandwidth 1K allocated bandwidth;
Fig. 4 is the allocated bandwidth schematic diagram of the multi-level passage tree of certain company in the prior art;
Fig. 5 is a kind of flow chart of controlling the method for update of token bucket of the embodiment of the invention;
Fig. 6 also provides a kind of structural representation of controlling the device of update of token bucket for the embodiment of the invention.
Embodiment
The embodiment of the invention provides a kind of method of controlling update of token bucket, when the leaf passage sends message, comprising: obtain the byte number in the message to be sent, and the algebraical sum of using the aggregate-value of this byte number and preservation is upgraded described aggregate-value; Aggregate-value after upgrading and the byte length of presetting are upgraded threshold value to be compared, if described aggregate-value upgrades threshold value greater than byte number, then upgrade the token bucket of described leaf passage, and with described aggregate-value zero clearing, under the prerequisite that does not influence the existing bandwidth control precision of level token bucket, do not need to send behind the message all refreshing token buckets at every turn, effectively reduced the number of times that upgrades token, thereby reduction takies network equipment processor, has improved the data forwarding performance of data forwarding passage.
Below in conjunction with Figure of description the specific embodiment of the present invention is elaborated.
As shown in Figure 5, a kind of method of controlling update of token bucket of the embodiment of the invention, the specific implementation step comprises:
In embodiments of the present invention, the implementation that step 501 is concrete can be selected following mode, but is not limited to this a kind of mode:
At the newly-increased field buff_pkt_len of leaf passage, when being used to write down current time, having sent but do not had the accumulation byte number of all data that computational token consumes to last update of token bucket;
When needs send message, then obtain the byte number of this message to be sent, and the byte number that gets access to and the value among the buff_pkt_len are added up.
Step 502 is upgraded threshold value with aggregate-value after upgrading and the byte number of presetting and is compared, if described aggregate-value upgrades threshold value greater than byte number, then upgrades the token bucket of described leaf passage, and with described aggregate-value zero clearing, otherwise change step 503 over to.
In embodiments of the present invention, the concrete condition according to network sets in advance the tolerable maximum data length value of data forwarding passage, i.e. byte number renewal threshold value.
In order to prevent that the long-time data length that sends from all can not reach byte number and upgrading threshold value, cause Data Update the problem that postpones to occur, then can be by described preset interval time threshold value to the controlling with the new time of token bucket, and then strengthen the accuracy of Data Update.
Step 504 after the token bucket that upgrades described leaf passage, is upgraded the token bucket of the parent channel of this leaf passage correspondence.
All need to upgrade token bucket after sending message in the prior art at every turn, use embodiment of the invention disclosed method and can send message repeatedly, after byte total length in a plurality of messages reaches threshold value, carry out update of token bucket again, can significantly reduce the update times of token bucket, reduce taking network equipment processor.
In embodiments of the present invention, upgrade the token bucket of described leaf passage and can realize in the following manner, but be not limited to following this a kind of mode:
The token bucket that upgrades described leaf passage comprises: deduct described aggregate-value in total token number, and the record current time is the update of token bucket time point.
Use the method that the embodiment of the invention provides, if passage speed limit 1K (1000 bytes, it is 1000 that byte number upgrades threshold value), network equipment minimum time unit is 1ms (millisecond), 1 token can send the data of 1 byte, from constantly 0, then Ji Lu data length value is 0, and the concrete implementation of message that the message that to have sent a length in the time of time point 10ms be 256 bytes and length are 512 bytes is:
Set in advance the threshold value of upgrading token bucket, can be set in this embodiment:
A) field buff_pkt_len was more than or equal to 1000 o'clock;
When B) token update time is at interval more than or equal to 1ms;
For the first time sending message is 256 bytes, because of sending data at 10ms, satisfies update condition B, and token bucket is upgraded, and concrete updated parameters is as shown in table 3:
| Existing token number | 1000 tokens |
| Rule of judgment | The buff_pkt_len:256 byte; The time interval: 10ms; The b that satisfies condition upgrades token bucket |
| Newly-increased token | 10ms * 1 token/ms=10 token, and note and upgrade token and be 10ms constantly, buff_pkt_len is updated to 0 |
| Final token number | The 1000-256+10=754 token |
Table 3
When sending the packet of 512 bytes, add that with 512 it is 512 that 0 byte among the buff_pkt_len obtains aggregate-value, with the time interval of upgrading for the first time be 10-10=0ms, when then sending the packet of 512 bytes, concrete updated parameters is as shown in table 4:
| The current record token number | 754 tokens |
| Rule of judgment | Buff_pkt_len:512 byte time interval: 10-10=0ms does not satisfy condition, and does not upgrade token bucket |
| Final token number | 754 tokens |
Table 4
As shown in Figure 6, according to the described method of Fig. 5, the embodiment of the invention also provides a kind of device of controlling update of token bucket, comprises data length value acquisition module 601 and elementary update of token bucket module 602:
Data length value acquisition module 601 is used for obtaining the data length value of message to be sent when the leaf passage sends message, and the algebraical sum of using the aggregate-value of this data length value and preservation is upgraded described aggregate-value;
Elementary update of token bucket module 602 is used for that aggregate-value after upgrading and the byte number of presetting are upgraded threshold value and compares, if described aggregate-value upgrades threshold value greater than byte number, then upgrades the token bucket of described leaf passage, and with described aggregate-value zero clearing.
In order to prevent that the long-time data length that sends from all can not reach first and upgrading judgment value, cause Data Update the problem that postpones to occur, this device also comprises:
Secondary update of token bucket module 603, be not more than byte number renewal threshold value if be used for described aggregate-value, determine that then whether the time interval of current time and last update of token bucket is greater than the preset interval time threshold value, if, then upgrade the token bucket of described leaf passage, and with described aggregate-value zero clearing.
In embodiments of the present invention, elementary update of token bucket module and secondary update of token bucket module, the token bucket of the described leaf passage of middle renewal specifically comprises: deduct described aggregate-value in total token number, and the record current time is the update of token bucket time point.
In addition, in order to upgrade the token bucket of the parent channel of leaf passage and leaf passage synchronously, described elementary update of token bucket module 602 and secondary update of token bucket module 603 also are used for upgrading the token bucket of the parent channel of this leaf passage afterwards at the token bucket that upgrades described leaf passage.
In addition, the embodiment of the invention also provides a kind of network equipment, and this network equipment comprises device shown in Figure 6, and wherein, this network equipment can be fluidic device, router, wireless controller etc.
The method and apparatus that the embodiment of the invention provides, under the prerequisite that does not influence the existing bandwidth control precision of level token bucket, effectively reduced the number of times that upgrades token, thereby reduced, improved the data forwarding performance of data forwarding passage the taking of network equipment processor.
Device of the present invention is not limited to the embodiment described in the embodiment, and those skilled in the art's technical scheme according to the present invention draws other execution mode, belongs to technological innovation scope of the present invention equally.Obviously, those skilled in the art can carry out various changes and modification to the present invention and not break away from the spirit and scope of the present invention.Like this, if of the present invention these are revised and modification belongs within the scope of claim of the present invention and equivalent technologies thereof, then the present invention also is intended to comprise these changes and modification interior.
Claims (10)
1. a method of controlling update of token bucket is characterized in that, comprising:
When the leaf passage sends message, obtain the byte number of message to be sent, and the algebraical sum of using the aggregate-value of this byte number and preservation is upgraded this aggregate-value;
Aggregate-value after upgrading and the byte number of presetting are upgraded threshold value compare,, then upgrade the token bucket of described leaf passage if described aggregate-value upgrades threshold value greater than byte number, and with described aggregate-value zero clearing.
2. the method for claim 1 is characterized in that, also comprises:
Upgrade threshold value if described aggregate-value is not more than byte number, whether the time interval of then determining current time and last update of token bucket is greater than default threshold value blanking time;
If, then upgrade the token bucket of described leaf passage, and with described aggregate-value zero clearing.
3. as claim 1 or the described method of 2 arbitrary claims, it is characterized in that described aggregate-value is kept in the new field of described leaf passage.
4. as claim 1 or the described method of 2 arbitrary claims, it is characterized in that the token bucket that upgrades described leaf passage comprises: in total token number, deduct described aggregate-value, and the record current time is the update of token bucket time point.
5. as claim 1 or the described method of 2 arbitrary claims, it is characterized in that, upgrade after the token bucket of described leaf passage, also comprise:
Upgrade the token bucket of the parent channel of this leaf passage.
6. a device of controlling update of token bucket is characterized in that, comprising:
Data length value acquisition module is used for obtaining the byte number of message to be sent when the leaf passage sends message, and the algebraical sum of using the aggregate-value of this byte number and preservation is upgraded described aggregate-value;
Elementary update of token bucket module is used for that aggregate-value after upgrading and the byte number of presetting are upgraded threshold value and compares, if described aggregate-value upgrades threshold value greater than byte number, then upgrades the token bucket of described leaf passage, and with described aggregate-value zero clearing.
7. device as claimed in claim 6 is characterized in that, this device also comprises:
Secondary update of token bucket module, be not more than byte number renewal threshold value if be used for described aggregate-value, determine that then whether the time interval of current time and last update of token bucket is greater than the preset interval time threshold value, if, then upgrade the token bucket of described leaf passage, and with described aggregate-value zero clearing.
8. as claim 6 or 7 described devices, it is characterized in that, the token bucket that upgrades described leaf passage in elementary update of token bucket module and the secondary update of token bucket module specifically comprises: deduct described aggregate-value in total token number, and the record current time is the update of token bucket time point.
9. as claim 6 or 7 described devices, it is characterized in that described elementary update of token bucket module and secondary update of token bucket module also are used for upgrading the token bucket of the parent channel of this leaf passage afterwards at the token bucket that upgrades described leaf passage.
10. a network equipment is characterized in that, comprises the described device of claim 6 to 9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010101111107A CN101841461B (en) | 2010-02-11 | 2010-02-11 | Method and device for controlling update of token bucket |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010101111107A CN101841461B (en) | 2010-02-11 | 2010-02-11 | Method and device for controlling update of token bucket |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101841461A true CN101841461A (en) | 2010-09-22 |
| CN101841461B CN101841461B (en) | 2012-05-30 |
Family
ID=42744595
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010101111107A Active CN101841461B (en) | 2010-02-11 | 2010-02-11 | Method and device for controlling update of token bucket |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101841461B (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102611924A (en) * | 2012-03-02 | 2012-07-25 | 何震宇 | Flow control method and system of video cloud platform |
| WO2012159362A1 (en) * | 2011-08-01 | 2012-11-29 | 华为技术有限公司 | Traffic shaping method and device |
| CN103152277A (en) * | 2011-12-07 | 2013-06-12 | 北京网康科技有限公司 | Method for improving network flow control performance and device thereof |
| CN105656800A (en) * | 2014-12-05 | 2016-06-08 | 中兴通讯股份有限公司 | Method and device for transmitting message |
| CN107231266A (en) * | 2016-03-24 | 2017-10-03 | 中兴通讯股份有限公司 | The detection method and device of message passage |
| CN107896197A (en) * | 2017-10-23 | 2018-04-10 | 深圳市楠菲微电子有限公司 | Method and apparatus, the storage medium of forwarding rate are measured in communication equipment |
| CN112711235A (en) * | 2020-12-29 | 2021-04-27 | 浙江中控技术股份有限公司 | Method for self-adapting token scheduling time of industrial control system |
| CN112751777A (en) * | 2021-01-06 | 2021-05-04 | 烽火通信科技股份有限公司 | High-rate flow control method and device |
| CN113067778A (en) * | 2021-06-04 | 2021-07-02 | 新华三半导体技术有限公司 | Flow management method and flow management chip |
| CN114650258A (en) * | 2020-12-15 | 2022-06-21 | 深圳市海思半导体有限公司 | Message processing method and device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1787483A (en) * | 2004-12-10 | 2006-06-14 | 华为技术有限公司 | Flow controlling method |
| CN1852227A (en) * | 2005-08-25 | 2006-10-25 | 华为技术有限公司 | Method for effectively preventing attack of network apparatus |
| US20060274779A1 (en) * | 2005-06-01 | 2006-12-07 | Cisco Technology, Inc. A California Corporation | Filling token buckets of schedule entries |
| US20070147422A1 (en) * | 2005-12-28 | 2007-06-28 | Fujitsu Limited | Bandwidth management apparatus |
-
2010
- 2010-02-11 CN CN2010101111107A patent/CN101841461B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1787483A (en) * | 2004-12-10 | 2006-06-14 | 华为技术有限公司 | Flow controlling method |
| US20060274779A1 (en) * | 2005-06-01 | 2006-12-07 | Cisco Technology, Inc. A California Corporation | Filling token buckets of schedule entries |
| CN1852227A (en) * | 2005-08-25 | 2006-10-25 | 华为技术有限公司 | Method for effectively preventing attack of network apparatus |
| US20070147422A1 (en) * | 2005-12-28 | 2007-06-28 | Fujitsu Limited | Bandwidth management apparatus |
Non-Patent Citations (2)
| Title |
|---|
| 《华南金融电脑》 20060410 李建宝等 令牌桶算法在IP QoS中的应用 第98-99页 1-10 , 第4期 2 * |
| 《通信技术》 20080131 陈乐然等 一种整合BGP路由更新报文的设计方法 第74-76页 1-10 第41卷, 第193期 2 * |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2012159362A1 (en) * | 2011-08-01 | 2012-11-29 | 华为技术有限公司 | Traffic shaping method and device |
| CN103152277A (en) * | 2011-12-07 | 2013-06-12 | 北京网康科技有限公司 | Method for improving network flow control performance and device thereof |
| CN102611924A (en) * | 2012-03-02 | 2012-07-25 | 何震宇 | Flow control method and system of video cloud platform |
| CN102611924B (en) * | 2012-03-02 | 2014-09-03 | 何震宇 | Flow control method and system of video cloud platform |
| CN105656800A (en) * | 2014-12-05 | 2016-06-08 | 中兴通讯股份有限公司 | Method and device for transmitting message |
| CN107231266A (en) * | 2016-03-24 | 2017-10-03 | 中兴通讯股份有限公司 | The detection method and device of message passage |
| CN107896197A (en) * | 2017-10-23 | 2018-04-10 | 深圳市楠菲微电子有限公司 | Method and apparatus, the storage medium of forwarding rate are measured in communication equipment |
| CN114650258A (en) * | 2020-12-15 | 2022-06-21 | 深圳市海思半导体有限公司 | Message processing method and device |
| CN112711235A (en) * | 2020-12-29 | 2021-04-27 | 浙江中控技术股份有限公司 | Method for self-adapting token scheduling time of industrial control system |
| CN112711235B (en) * | 2020-12-29 | 2022-05-10 | 浙江中控技术股份有限公司 | Method for self-adapting token scheduling time of industrial control system |
| CN112751777A (en) * | 2021-01-06 | 2021-05-04 | 烽火通信科技股份有限公司 | High-rate flow control method and device |
| CN113067778A (en) * | 2021-06-04 | 2021-07-02 | 新华三半导体技术有限公司 | Flow management method and flow management chip |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101841461B (en) | 2012-05-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101841461B (en) | Method and device for controlling update of token bucket | |
| Cui et al. | Performance-aware energy optimization on mobile devices in cellular network | |
| CN101505244B (en) | Bandwidth measurement method and apparatus | |
| CN113419857A (en) | Federal learning method and system based on edge digital twin association | |
| US11509566B2 (en) | Shaping outgoing traffic of network packets in a network management system | |
| CN104580018A (en) | Bandwidth adjustment method and device in software-defined network | |
| CN101282305A (en) | Bandwidth control method for distributed system as well as service plate | |
| Liu et al. | Utility-based bandwidth allocation for triple-play services | |
| CN103797841A (en) | Admission control method and device | |
| CN101217484A (en) | Resource distributing method and system | |
| CN102170706B (en) | Spectrum access method for distributed cognitive radio system | |
| CN102111888B (en) | Channel allocation method and device and system | |
| CN102256313B (en) | Method for controlling data domain service speed | |
| CN105530203A (en) | Access control method and system for D2D communication link | |
| CN103517317B (en) | A kind of system and method matched between phone number and operator passage | |
| Zheng et al. | Achieving energy efficiency via drowsy transmission in cognitive radio | |
| Cheng et al. | A cross-layer fair resource allocation algorithm for OFDMA systems | |
| Varan et al. | Energy harvesting communications with energy and data storage limitations | |
| CN104683235A (en) | Method for optimizing QOS (Quality of Service) router based on ant colony algorithm | |
| CN100376100C (en) | Method for adjusting service access time and decreasing service to achieve burst | |
| CN104349336A (en) | Wireless network voice service capacity allocation method and device | |
| CN102123519B (en) | Improved method of GTS (Guarantee Time Slot) release mechanism in IEEE (Institute of Electrical and Electronic Engineers) 802.15.4 protocol | |
| CN105306290B (en) | A kind of prediction technique and device of flow entry scale | |
| Maksić et al. | M/M/1 model of Energy-Efficient Ethernet with byte-based coalescing | |
| CN105827479A (en) | Flow management platform and method |
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 |