CN101841461B - Method and device for controlling update of token bucket - Google Patents
Method and device for controlling update of token bucket Download PDFInfo
- Publication number
- CN101841461B CN101841461B CN2010101111107A CN201010111110A CN101841461B CN 101841461 B CN101841461 B CN 101841461B CN 2010101111107 A CN2010101111107 A CN 2010101111107A CN 201010111110 A CN201010111110 A CN 201010111110A CN 101841461 B CN101841461 B CN 101841461B
- 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.)
- Active
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 through 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 traditional message forwarding, flow control is distinguished message and is treated, and can accomplish preferentially to transmit some message, thereby satisfy the various demands in the actual environment, as guarantee basic the application and key application, guarantees emphasis user bandwidth or the like.
The tradition flow control is as shown in Figure 1, and scheduler is distinguished message and buffer memory through 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 is as shown in Figure 2, is the flow control model of stratification, 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 following:
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 equates of data length in deletion and 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, from 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 following:
Bucket is dark: 1000 tokens;
The initial token number of token bucket: 1000 tokens, the data that promptly can send 1000 byte lengths;
Token renewal rate: 1000 tokens/1000ms=1 token/ms;
From 0 beginning constantly, 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 following:
When sending the message of length 256 bytes, the more new situation of said 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 said 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 following:
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 ", accomplish 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 following:
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 present invention provides a kind of method and apparatus of controlling update of token bucket, and 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 said aggregate-value;
Aggregate-value after upgrading is upgraded threshold value with preset byte number compare,, then upgrade the token bucket of said leaf passage if said aggregate-value upgrades threshold value greater than byte number, and with said aggregate-value zero clearing; Otherwise whether the time interval of confirming current time and last update of token bucket greater than the preset interval time threshold value, if, then upgrade the token bucket of said leaf passage, and with said aggregate-value zero clearing.
The token bucket that upgrades said leaf passage comprises: add newly-increased token number after in total token number, deducting said aggregate-value, 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 when the leaf passage sends message, obtaining the data length value of message to be sent, and the algebraical sum of using the aggregate-value of this data length value and preservation is upgraded said aggregate-value;
Elementary update of token bucket module is used for that the aggregate-value after upgrading is upgraded threshold value with preset byte number and compares, if said aggregate-value upgrades threshold value greater than byte number, then upgrades the token bucket of said leaf passage, and with said aggregate-value zero clearing;
Secondary update of token bucket module, whether the time interval that is used for confirming current time and last update of token bucket greater than the preset interval time threshold value, if, then upgrade the token bucket of said leaf passage, and with said aggregate-value zero clearing.
The token bucket that upgrades said leaf passage in elementary update of token bucket module and the secondary update of token bucket module specifically comprises: add newly-increased token number after in total token number, deducting said aggregate-value, 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 sketch map in the prior art;
Fig. 2 is the middle-level flow control sketch map of prior art;
Fig. 3 is 4K for certain company's network egress bandwidth in the prior art, and department one distributes the sketch map of bandwidth 1K allocated bandwidth;
Fig. 4 is the allocated bandwidth sketch map 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 said aggregate-value; Aggregate-value after upgrading is upgraded threshold value with preset byte length to be compared; If said aggregate-value upgrades threshold value greater than byte number; Then upgrade the token bucket of said leaf passage, and with said 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 reduced, improved the data forwarding performance of data forwarding passage the taking of network equipment processor.
Be elaborated below in conjunction with the Figure of description specific embodiments of the invention.
As shown in Figure 5, a kind of method of controlling update of token bucket of the embodiment of the invention, concrete performing 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 value among byte number that gets access to and the buff_pkt_len is added up.
Step 502 is upgraded threshold value with the aggregate-value after upgrading with preset byte number and is compared, if said aggregate-value upgrades threshold value greater than byte number, then upgrades the token bucket of said leaf passage, and with said aggregate-value zero clearing, otherwise change step 503 over to.
In embodiments of the present invention, the concrete condition according to network is provided with the tolerable maximum data length value of data forwarding passage, i.e. byte number renewal threshold value in advance.
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 through said 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 said leaf passage, is upgraded the token bucket of the corresponding parent channel of this leaf passage.
All need upgrade token bucket after having sent 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 said 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 said leaf passage comprises: in total token number, deduct said aggregate-value, 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 0 beginning constantly, then the data recorded length value is 0, and the concrete implementation of message that the message that in the time of time point 10ms, to have sent a length be 256 bytes and length are 512 bytes is:
The threshold value of upgrading token bucket is set in advance, 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 when the leaf passage sends message, obtaining the data length value of message to be sent, and the algebraical sum of using the aggregate-value of this data length value and preservation is upgraded said aggregate-value;
Elementary update of token bucket module 602 is used for that the aggregate-value after upgrading is upgraded threshold value with preset byte number and compares, if said aggregate-value upgrades threshold value greater than byte number, then upgrades the token bucket of said leaf passage, and with said 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 said aggregate-value; Whether the time interval of then confirming current time and last update of token bucket is greater than the preset interval time threshold value; If, then upgrade the token bucket of said leaf passage, and with said 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 said leaf passage of middle renewal specifically comprises: in total token number, deduct said aggregate-value, 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; Said elementary update of token bucket module 602 also is used for upgrading the token bucket of the parent channel of this leaf passage afterwards at the token bucket that upgrades said leaf passage with secondary update of token bucket module 603.
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, belong within the scope of claim of the present invention and equivalent technologies thereof if of the present invention these are revised with modification, then the present invention also is intended to comprise these changes and modification interior.
Claims (8)
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 use this aggregate-value of algebraical sum renewal of the aggregate-value of this byte number and preservation;
Aggregate-value after upgrading is upgraded threshold value with preset byte number compare,, then upgrade the token bucket of said leaf passage if said aggregate-value upgrades threshold value greater than byte number, and with said aggregate-value zero clearing; Otherwise whether the time interval of confirming current time and last update of token bucket greater than the preset interval time threshold value, if, then upgrade the token bucket of said leaf passage, and with said aggregate-value zero clearing.
2. the method for claim 1 is characterized in that, said aggregate-value is kept in the new field of said leaf passage.
3. the method for claim 1 is characterized in that, the token bucket that upgrades said leaf passage comprises: add newly-increased token number after in total token number, deducting said aggregate-value, and the record current time is the update of token bucket time point.
4. the method for claim 1 is characterized in that, upgrades after the token bucket of said leaf passage, also comprises:
Upgrade the token bucket of the parent channel of this leaf passage.
5. a device of controlling update of token bucket is characterized in that, comprising:
Data length value acquisition module is used for when the leaf passage sends message, obtaining 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 said aggregate-value;
Elementary update of token bucket module is used for that the aggregate-value after upgrading is upgraded threshold value with preset byte number and compares, if said aggregate-value upgrades threshold value greater than byte number, then upgrades the token bucket of said leaf passage, and with said aggregate-value zero clearing;
Secondary token update module; Aggregate-value after being used for upgrading upgrades threshold value with preset byte number and compares; If said aggregate-value upgrades threshold value smaller or equal to byte number, whether the time interval of then confirming current time and last update of token bucket greater than the preset interval time threshold value, if; Then upgrade the token bucket of said leaf passage, and with said aggregate-value zero clearing.
6. device as claimed in claim 5; It is characterized in that; The token bucket that upgrades said leaf passage in elementary update of token bucket module and the secondary update of token bucket module specifically comprises: add newly-increased token number after in total token number, deducting said aggregate-value, and the record current time is the update of token bucket time point.
7. device as claimed in claim 5 is characterized in that, said 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 said leaf passage.
8. a network equipment is characterized in that, comprises the described device of claim 5 to 7.
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 CN101841461A (en) | 2010-09-22 |
| CN101841461B true 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) |
Families Citing this family (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103026671B (en) * | 2011-08-01 | 2016-01-20 | 华为技术有限公司 | A kind of method and apparatus of traffic shaping |
| CN103152277A (en) * | 2011-12-07 | 2013-06-12 | 北京网康科技有限公司 | Method for improving network flow control performance and device thereof |
| 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 |
| 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 |
| CN113067778B (en) * | 2021-06-04 | 2021-09-17 | 新华三半导体技术有限公司 | Flow management method and flow management chip |
Citations (3)
| 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 |
| US20070147422A1 (en) * | 2005-12-28 | 2007-06-28 | Fujitsu Limited | Bandwidth management apparatus |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7843940B2 (en) * | 2005-06-01 | 2010-11-30 | Cisco Technology, Inc. | Filling token buckets of schedule entries |
-
2010
- 2010-02-11 CN CN2010101111107A patent/CN101841461B/en active Active
Patent Citations (3)
| 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 |
| US20070147422A1 (en) * | 2005-12-28 | 2007-06-28 | Fujitsu Limited | Bandwidth management apparatus |
Non-Patent Citations (2)
| Title |
|---|
| 李建宝等.令牌桶算法在IP QoS中的应用.《华南金融电脑》.2006,(第4期),第98-99页. * |
| 陈乐然等.一种整合BGP路由更新报文的设计方法.《通信技术》.2008,第41卷(第193期),第74-76页. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101841461A (en) | 2010-09-22 |
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 | |
| EP2357764B1 (en) | Traffic shaping scheduling method, traffic shaping scheduling apparatus, and routing device | |
| CN113419857A (en) | Federal learning method and system based on edge digital twin association | |
| CN101217484B (en) | Resource distributing method and system | |
| CN101505244A (en) | Bandwidth measurement method and apparatus | |
| CN104580018A (en) | Bandwidth adjustment method and device in software-defined network | |
| Tang et al. | ARMA-prediction-based online adaptive dynamic resource allocation in wireless virtualized network | |
| CN102170706A (en) | Spectrum access method for distributed cognitive radio system | |
| CN108513318B (en) | User service queuing optimization method based on edge calculation | |
| ATE365435T1 (en) | RADIO EQUIPMENT MANAGEMENT OF PACKET DATA ON A PORT NUMBER BASIS | |
| KR20150080183A (en) | Method and Apparatus for dynamic traffic engineering in Data Center Network | |
| CN102111888B (en) | Channel allocation method and device and system | |
| CN105530203A (en) | Access control method and system for D2D communication link | |
| CN102186203A (en) | Method, device and system for determining data service channel number | |
| GB0215013D0 (en) | Communications system and method | |
| CN103517317B (en) | A kind of system and method matched between phone number and operator passage | |
| CN101909304A (en) | Method for planning data service capacity in wireless network | |
| Cheng et al. | A cross-layer fair resource allocation algorithm for OFDMA systems | |
| CN103929378A (en) | Method and system for allocating communication link for transmitting cross-domain data and method and system for transmitting cross-domain data | |
| 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 | |
| CN104349336A (en) | Wireless network voice service capacity allocation method and device | |
| CN110475286A (en) | A kind of data packet discarding management method, equipment and device, medium | |
| ATE498987T1 (en) | METHOD FOR CONTROLLING RADIO RESOURCES ASSIGNED TO A MOBILE TERMINAL IN A CELLULAR SYSTEM |
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 |