CN101932018B - RLC data transmission method of HSDPA system - Google Patents
RLC data transmission method of HSDPA system Download PDFInfo
- Publication number
- CN101932018B CN101932018B CN 200910087082 CN200910087082A CN101932018B CN 101932018 B CN101932018 B CN 101932018B CN 200910087082 CN200910087082 CN 200910087082 CN 200910087082 A CN200910087082 A CN 200910087082A CN 101932018 B CN101932018 B CN 101932018B
- Authority
- CN
- China
- Prior art keywords
- credits
- rlc
- transmission
- rlc buffer
- buffer
- 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 an RLC data transmission method of an HSDPA system, which comprises the following steps: calculating the difference between credits which are distributed to current RLC transmission and the actually sent credits after finishing each RLC buffer transmission, and carrying out accumulation on the difference obtained by calculation at each time within a preset time interval; and judging whether the data size in an RLC buffer is larger than the credits distributed at this time or not during each RLC buffer transmission, if so, indicating that the data size to be sent at this time is larger but the distributed credits are limited and considering the application of the accumulated credits before for carrying out the current data transmission; otherwise, indicating that the data size to be sent is still small, and sending out all data in the RLC buffer. Furthermore, the value of the accumulated credits is adjusted according to the credits distributed to the next RLC buffer transmission after each RLC buffer transmission. The application of the RLC data transmission method can avoid emptying a PQ due to business source limitation.
Description
Technical field
The present invention relates to flow control technique, particularly the RLC data transmission method of a kind of HSDPA system.
Background technology
Multiple users share HS-DSCH transmission channel in the HSDPA system, therefore, radio interface rate is affected by channel condition, dispatching algorithm, service source characteristic and community user number etc., show time-varying characteristics, NodeB end cause the iub port transmission rate constantly not to be consistent with radio interface rate, so need to carry out buffer memory with data in MAC-hs buffer (below title PQ).The situation of overflowing for fear of PQ and PQ get sky and the RLC buffering area still has the situation (be called stalling or get sky) of data to occur, and introduces flow control algorithm the speed of iub mouth is controlled.
For the situation that PQ overflows, as long as arranging, the thresholding of PQ size, triggering iub rate reduction rationally just can avoid.For getting empty situation, the avoiding method relative complex need to adopt different Flow Control strategies for causing getting empty different reasons.At present, roughly have following three kinds of situations can cause getting empty generation:
The first situation is the Iub rate-constrained.So-called Iub rate-constrained refers to because the Iub limit on transmission bandwidth adopts flow control algorithm to the restriction that the credits that distributes carries out, and can cause data to be subject to the Iub bandwidth, thereby can not in time be dealt among the PQ, and then cause getting sky.
The second situation is that PQ is limited.So-called PQ is limited to be referred in order to prevent that PQ from overflowing, thereby adopts flow control algorithm that the credits that distributes is limited the sky of getting that causes.
The third situation is that service source is limited.The service source type comprises two kinds of bursts of traffic and sudden stronger business.For bursts of traffic, business enters RLC buffer at the interval of twice transmission of RLC buffer, if because RLC buffer traffic carrying capacity is not enough, do not utilize fully the credits that distributes when last time transmitting, the data that then arrive PQ are less, if at this moment UE is scheduled, service source has had data to enter RLCbuffer, namely professionally enters RLC buffer after the Iub transmission, and before scheduling occurs in next time Iub transmission, will get sky, concrete schematic diagram as shown in Figure 1.
And for sudden stronger business, each iub transmission time, the data volume difference of professional arrival RLC buffer is very large, at this moment, also may cause and get sky; When transmitting for the first time as shown in Figure 2, RLC buffer is empty or seldom, do not take full advantage of the credits of distribution, and have a large amount of data to arrive RLC buffer when transmitting for the second time, but be subject to limited credits data and can not fully send to PQ again, if scheduling radio interface rate then is large, also can get sky.
Get sky, show that interface-free resources utilizes insufficiently, be different from the network load low situation of occupancy of eating dishes without rice or wine when low, getting sky is in the situation that has service needed to send, because it is low in time business not to be sent to the PQ utilance that causes eating dishes without rice or wine.Effectively reduce and get sky, can improve the utilance to the interface-free resources of preciousness, and can improve simultaneously QoS of survice.
For Iub Bandwidth-Constrained and the limited situation of PQ, improved flow control algorithm or corresponding optimization method have been arranged at present.And the limited situation of service source can not be improved by the configuration optimization of flow control algorithm and NodeB end, does not also have suitable mode can avoid service source limited and PQ that cause gets sky at present.
Summary of the invention
In view of this, provide the RLC data transmission method of a kind of HSDPA system among the present invention, can avoid service source limited and cause get sky.
For achieving the above object, the present invention adopts following technical scheme:
The RLC data transmission method of a kind of HSDPA system comprises:
After the end of transmission of each RLC buffer, be calculated as the difference of credits with the actual credits that sends of this RLC transmission distribution, and the described difference that at every turn calculates in the Preset Time interval is accumulated, obtain accumulating credits;
When each RLC buffer transmits, judge that whether the data volume of current RLC buffer is greater than the credits that distributes for this RLC transmission, if and current accumulation credits is greater than 0, credits corresponding to data volume that then determines this RLC transmission is: the minimum value among the corresponding credits of the data volume of the credits that Iub_max is corresponding, RLC buffer, the credits+ accumulation crdits/N that distributes for this RLC transmission, and carry out transfer of data among the RLC buffer according to definite credits; Otherwise, the data among the RLC buffer are all sent; Described N is default positive integer;
For arbitrary RLC buffer transmission, if the data volume of current RLC buffer greater than credits corresponding to data volume that credits and this definite RLC for this RLC transmission distribution transmit is, the credits+ that distributes for this RLC transmission accumulates crdits/N, when credits that system distributes crdedits or distribution for the transmission of RLC buffer next time credits is assigned with in greater than described arbitrary RLC buffer transmission, then reduce the value of N; When credits that credits that system distributes for the transmission of RLC buffer next time is assigned with in less than described arbitrary RLC buffer transmission, then will accumulate the credits zero clearing.
Preferably, the RLC transmission intercal being set is FP_interval;
Described Preset Time is spaced apart all RLC transmission intercals.
Preferably, the RLC transmission intercal is set less than FP_interval;
Described Preset Time is spaced apart the RLC transmission intercal that consists of FP_interval.
Preferably, the RLC transmission intercal being set is FP_interval/M; Described M is the positive integer greater than 1;
Described Preset Time is spaced apart all RLC transmission intercals;
After each RLC buffer transmission, be calculated as the difference of credits/M with the actual credits that sends of this RLC transmission distribution, and utilize this difference to carry out the credits accumulation.
Preferably, when the data among the RLC buffer exceed default threshold value, carry out a RLC buffer transmission.
By the technical scheme of the invention described above as seen, among the present invention, after the end of transmission of each RLC buffer, dispensed is given the difference of credits with the actual credits that sends of this RLC transmission, and the difference that at every turn calculates in the Preset Time interval accumulated, obtain accumulating credits, thereby determine the not timely credits that uses in the RLCbuffer transmission course.Based on accumulation credits, when carrying out RLC buffer transmission at every turn, judge that data volume among the RLC buffer is whether greater than the credits of this sub-distribution, if show that then this data to be transferred is more, but the credits that distributes is limited, the credits of accumulation carries out this data transfer before considering to use, otherwise, show that this data to be transferred is still less, then the data among the RLC buffer are all sent.And, after each RLC buffer transmission, according to being the credits that next time RLC buffer transmission distributes, adjust the value of accumulation credits.By the way, the credits that does not use fully in the transmission before namely can in time utilizing avoids getting sky by the limited PQ that causes of service source.
Description of drawings
Fig. 1 is that PQ gets empty schematic diagram one in the limited situation of service source.
Fig. 2 is that PQ gets empty schematic diagram two in the limited situation of service source.
Embodiment
For making purpose of the present invention, technological means and advantage clearer, below in conjunction with accompanying drawing, the present invention is described in further details.
Basic thought of the present invention is: the credits that accumulation NodeB distributes, and in time use the credits that does not use in the before RLCbuffer transmission, strengthen the transmitted data amount of RLC buffer.
Avoid limited and cause PQ to get empty RLC data transmission method comprising by service source among concrete the present invention:
After the end of transmission of each RLC buffer, dispensed is given the difference of credits with the actual credits that sends of this RLC transmission, and the described difference that at every turn calculates in the Preset Time interval is accumulated, and obtains accumulating credits;
When each RLC buffer transmits, judge that whether the data volume of current RLC buffer is greater than the credits that distributes for this transmission, if, to determine that then this time the credits corresponding to data volume of transmission is: the min (credits that Iub_max is corresponding, the credits that RLC buffer data volume is corresponding, current credits+ accumulation credits/N), and according to the credits that determines carry out transfer of data among the RLC buffer; Otherwise, the data among the RLC buffer are all sent; Wherein, N is default positive integer;
In arbitrary RLC buffer transmission, if the data volume of current RLC buffer is greater than credits corresponding to the data volume of the credits that distributes for this transmission and this time transmission the determined credits+ accumulation crdits/N of sub-distribution for this reason, when credits that system distributes crdedits or distribution for the transmission of RLC buffer next time credits is assigned with in greater than described arbitrary RLC buffer transmission, then N is reduced; When credits that credits that system distributes for the transmission of RLC buffer next time is assigned with in less than described arbitrary RLCbuffer transmission, then will accumulate the credits zero clearing.
In specific implementation process of the present invention, the application for accumulation credits can have various ways, below describes by three embodiment.
Embodiment one:
In the present embodiment, keep RLC to send the interval, carry out the mode of omnidistance credits accumulation.This mode also can be improved the bursts of traffic situation mainly for the limited sudden stronger service conditions of the service source of describing in the background technology.
For sudden stronger business, normally owing to the professional data volume difference that arrives RLC buffer of Iub transmission time causes PQ to get sky greatly, therefore there is no need to adjust the transmission intercal of RLC buffer.Thereby concrete RLC transfer of data comprises:
Adopting the FP_interval that provides among the NodeB capacity_allocation is that the RLCbuffer transmission is carried out at the interval, namely keeps the time interval identical with existing mode to carry out RLC buffer transmission.
In all RLC buffer transmission courses, carry out the accumulation of credits.Particularly, carry out at every turn RLC buffer send after credits and the actual credits that sends out poor of dispensed, and accumulate.Carrying out RLC buffer when transmission, at first judging RLC buffer data volume whether greater than the credits of current distribution, if not, then data all send, the difference that calculates on the occasion of, carry out credits accumulation after, show the credits that existence is not employed; If so, and accumulation credits＞0 o'clock, then consider the utilization to accumulation credits, the actual credits value that sends is:
Min (credits that Iub_max is corresponding, the credits that RLC buffer data volume is corresponding, current credits+ accumulation credits/N)
Get the minimum value in above-mentioned three numerical value, the maximum that burst rate that just can bonding user Iub mouth is lower than configuration allows Iub speed, with the NodeB Flow Control adopt consistent, and guarantee that the data volume that needs transmit can be greater than RLC buffer data volume.
Wherein, N can adjust according to accumulation credits and current credits size, can determine in advance or obtain experience by emulation to hint obliquely at.The credits of same dispensed and the actual credits's that sends out is poor after sending, if this time difference value is negative value, the credits of accumulation cuts multiple Mac-d PDU number.
Continue top-operation, if do not receive new credits after having utilized accumulation credits, or be to transmit the credits of distribution greater than the credits that is assigned with in the RLC buffer transmission that has just finished, then further reduce the N value, strengthen accumulating the utilization of credits; next time For example, the N value can be reduced by half.If be to transmit the credits of distribution less than the credits that is assigned with in the RLC buffer transmission that has just finished next time, then will accumulate the credits zero clearing, restart accumulation.
By the way, in all RLC buffer transmission, carry out omnidistance credits accumulation, the credits that timely record is not employed, thus when data volume is more in RLC buffer, can multiplely gives some data in PQ, thereby avoid PQ to get sky.Especially for the larger sudden stronger business of data volume difference, obvious restriction is arranged.
Embodiment two:
In the present embodiment, shorten RLC buffer transmission intercal, carry out the mode of omnidistance credits accumulation or interval credits accumulation.This mode also can be improved sudden stronger service conditions mainly for the limited paroxysmal service conditions of the service source of describing in the background technology.
For bursts of traffic, normally because business enters RLC buffer at the interval of twice transmission of RLC buffer, thereby cause PQ to get sky, therefore can be by shortening the transmission intercal of RLC buffer, the assurance business enters RLC buffer as early as possible, and in time carries out transfer of data.Thereby concrete RLC transfer of data comprises:
The fixed intervals that adopt to shorten are carried out RLC buffer transmission, and the simplest mode is that the RLCbuffer transmission intercal is adjusted into FP_interval/M, and wherein M is the integer greater than 1, M=2 for example, and namely RLC buffer transmission intercal is 5ms.
When carrying out the credits accumulation, dual mode can be arranged:
One, only accumulation utilization in the transmission intercal of the several formation FP_interval that link to each other of credit when next FP_interval begins, will be accumulated the credits zero clearing.Identical among the adjustment mode of the accumulation credits value of carrying out after concrete credits accumulation mode and the each RLC buffer transmission and the embodiment one, just repeat no more here.
Two, in all RLC buffer transmission courses, carry out the accumulation of credits, namely identical with accumulation scope among the embodiment one.Be that with the difference of credits among the embodiment one accumulation the credits/M (if FP_interval is 10ms, sends and be spaced apart 5ms, then M=10/5) that answers dispensed after each RLCbuffer transmission is poor with the actual credits's that sends out.Identical among other credits accumulated process and the embodiment one, just repeat no more here.
By the mode of present embodiment, reduce RLC buffer transmission intercal, thereby can make RLC buffer as early as possible the data that receive be sent to PQ, and in conjunction with credits accumulation mode, avoid PQ to get sky.
Embodiment three:
In the present embodiment, adjusting RLC buffer transmission intercal can adaptively changing, and the mode of carrying out omnidistance credits accumulation.Concrete RLC transfer of data comprises:
RLC buffer transmission does not have fixing transmission interval, but self adaptation is dynamically adjusted transmitting time.Particularly, set in advance a sending threshold value, when the data volume of RLC buffer reaches sending threshold value, just carry out RLC buffer transmission, and the interior credit of one or more FP_interval accumulates situation before considering current time.
Identical among the mode of specifically carrying out credits accumulation and the embodiment one, just repeat no more here.
Use the mode of present embodiment because the same accumulation credits that adopts, thereby can data volume is more in RLC buffer the time, multiple some data of giving in PQ, thereby avoid PQ to get sky.And because the transmission intercal of RLC buffer can the self adaptation adjustment, so the mode of present embodiment can be carried out transfer of data more in time with respect to embodiment one and two.
Being preferred embodiment of the present invention only below, is not for limiting protection scope of the present invention.Within the spirit and principles in the present invention all, any modification of doing, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (5)
1. the RLC data transmission method of a HSDPA system is characterized in that the method comprises:
After the end of transmission of each RLC buffer, be calculated as the difference of credits with the actual credits that sends of this RLC transmission distribution, and the described difference that at every turn calculates in the Preset Time interval is accumulated, obtain accumulating credits;
When each RLC buffer transmits, judge that whether the data volume of current RLC buffer is greater than the credits that distributes for this RLC transmission, if and current accumulation credits is greater than 0, credits corresponding to data volume that then determines this RLC transmission is: the minimum value among the corresponding credits of the data volume of the credits that Iub_max is corresponding, RLC buffer, the credits+ accumulation credits/N that distributes for this RLC transmission, and carry out transfer of data among the RLC buffer according to definite credits; Otherwise, the data among the RLC buffer are all sent; Described N is default positive integer;
For arbitrary RLC buffer transmission, if the data volume of current RLC buffer greater than credits corresponding to data volume that credits and this definite RLC for this RLC transmission distribution transmit is, the credits+ that distributes for this RLC transmission accumulates credits/N, when credits that system distributes credits or distribution for the transmission of RLC buffer next time credits is assigned with in greater than described arbitrary RLC buffer transmission, then reduce the value of N; When credits that credits that system distributes for the transmission of RLC buffer next time is assigned with in less than described arbitrary RLC buffer transmission, then will accumulate the credits zero clearing.
2. method according to claim 1 is characterized in that, it is FP_interval that the RLC transmission intercal is set;
Described Preset Time is spaced apart all RLC transmission intercals.
3. method according to claim 1 is characterized in that, the RLC transmission intercal is set less than FP_interval;
Described Preset Time is spaced apart the RLC transmission intercal that consists of FP_interval.
4. method according to claim 1 is characterized in that, it is FP_interval/M that the RLC transmission intercal is set; Described M is the positive integer greater than 1;
Described Preset Time is spaced apart all RLC transmission intercals;
After each RLC buffer transmission, be calculated as the difference of credits/M with the actual credits that sends of this RLC transmission distribution, and utilize this difference to carry out the credits accumulation.
5. method according to claim 1 is characterized in that, when the data among the RLC buffer exceed default threshold value, carries out a RLC buffer transmission.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200910087082 CN101932018B (en) | 2009-06-18 | 2009-06-18 | RLC data transmission method of HSDPA system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200910087082 CN101932018B (en) | 2009-06-18 | 2009-06-18 | RLC data transmission method of HSDPA system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101932018A CN101932018A (en) | 2010-12-29 |
| CN101932018B true CN101932018B (en) | 2013-03-13 |
Family
ID=43370859
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 200910087082 Active CN101932018B (en) | 2009-06-18 | 2009-06-18 | RLC data transmission method of HSDPA system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101932018B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104202124B (en) * | 2014-09-12 | 2017-10-10 | 成都博智维讯信息技术有限公司 | A kind of erp packet communications method |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1941954A (en) * | 2005-09-29 | 2007-04-04 | 中兴通讯股份有限公司 | Method for controlling HSDPA flow based on feedback mode |
| CN1972171A (en) * | 2006-11-29 | 2007-05-30 | 上海华为技术有限公司 | A method and apparatus for control of high speed downlink packet data flow |
| CN1984068A (en) * | 2006-06-15 | 2007-06-20 | 华为技术有限公司 | Method and device for controlling data flow |
| CN101009657A (en) * | 2007-02-02 | 2007-08-01 | 华为技术有限公司 | Measurement of the output speed of the buffer queue, allocation method and device of Iub bandwidth |
-
2009
- 2009-06-18 CN CN 200910087082 patent/CN101932018B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1941954A (en) * | 2005-09-29 | 2007-04-04 | 中兴通讯股份有限公司 | Method for controlling HSDPA flow based on feedback mode |
| CN1984068A (en) * | 2006-06-15 | 2007-06-20 | 华为技术有限公司 | Method and device for controlling data flow |
| CN1972171A (en) * | 2006-11-29 | 2007-05-30 | 上海华为技术有限公司 | A method and apparatus for control of high speed downlink packet data flow |
| CN101009657A (en) * | 2007-02-02 | 2007-08-01 | 华为技术有限公司 | Measurement of the output speed of the buffer queue, allocation method and device of Iub bandwidth |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101932018A (en) | 2010-12-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR100771735B1 (en) | Radio base station apparatus and rate control method thereof | |
| JP5396641B2 (en) | System and method for relay node flow control in a wireless communication system | |
| US8780929B2 (en) | Method of and apparatus for adaptive control of data buffering in a data transmitter | |
| CN101340358B (en) | Flow control method, system and flow control entity | |
| JP4481990B2 (en) | Harmonized data flow control and buffer sharing in UMTS | |
| EP2204018B1 (en) | Limiting the rlc window size in a hsdpa flow control | |
| CN100579107C (en) | Iub port flow control method | |
| CN100426737C (en) | Iub interface flow control plan | |
| US20110075562A1 (en) | Rate Shaping For Wireless Communication Using Token Bucket That Allows Token Debt | |
| JPH1093624A (en) | Packet transmission network | |
| CN102014431B (en) | Anti-jittering data transmission method, equipment and system | |
| CN101582842A (en) | Congestion control method and congestion control device | |
| CN101567851B (en) | Method and equipment for shaping transmission speed of data traffic flow | |
| EP1952586B1 (en) | A method and base station for schedulin hsdpa | |
| US20140281034A1 (en) | System and Method for Compressing Data Associated with a Buffer | |
| US20090238110A1 (en) | Base Station Apparatus and Method for Controlling Base Station Apparatus | |
| CN101207570A (en) | Data transmission method, data sending rate control method and base station | |
| WO2008066429A1 (en) | A method for improved handling of traffic congestion in a wireless telecommunications system | |
| EP1478133A3 (en) | Preemptive precedence scheduler for communications link bandwidth | |
| CN101932018B (en) | RLC data transmission method of HSDPA system | |
| JP2009278532A (en) | Transmission apparatus and congestion control method | |
| CN102457909B (en) | Iub port flow control method based on target buffer | |
| CN101521562B (en) | Radio communication system, radio communication method and base station | |
| CN101854660B (en) | Congestion control method and device | |
| EP2547053B1 (en) | Distribution of data units among interfaces of a node of a packet-switched communication network |
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 |