CN101123622A - A method and device for Iub interface traffic control - Google Patents
A method and device for Iub interface traffic control Download PDFInfo
- Publication number
- CN101123622A CN101123622A CNA2006100892131A CN200610089213A CN101123622A CN 101123622 A CN101123622 A CN 101123622A CN A2006100892131 A CNA2006100892131 A CN A2006100892131A CN 200610089213 A CN200610089213 A CN 200610089213A CN 101123622 A CN101123622 A CN 101123622A
- Authority
- CN
- China
- Prior art keywords
- formation
- capacity
- wine
- rnc
- rice
- 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
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides an Iub port flow capacity control method. The method comprises the steps that RNC transmits capacity request frame to a base station every 100ms and notifies each query the cache occupacation information; the base station measures an average transmission rate of an empty port of each query every 100ms, selects the size and cycle of a next 100ms Iub port transmission data block for each query and transmits flow capacity distribution frame to RNC. Furthermore, the invention also provides a flow capacity control device, which comprises a measure unit, which is used to measure the average transmission rate of the empty port of each query every 100ms; a scheduling unit, which is used to transmit the capacity request frame every 100ms according to RNC, obtain the cache occupacation information of each query, distribute the size and cycle of the next 100ms Iub port transmission data block for each priority query and transmits the capacity distribution frame to RNC. The invention can simplify the Iub port flow capacity control to prevent system processing load due to too frequent capacity distribution.
Description
Technical field
The present invention relates to the communications field, relate in particular to the method and the device of a kind of Iub mouth flow control.
Background technology
High speed downlink packet inserts (HSDPA, High Speed Downlink Package Access) (Node B) side has increased high speed downlink packet access medium access control (MAC-hs to technology in the base station, MediumAccess Control for HSDPA) entity, its major function are to sending that data are dispatched and to the control of data retransmission.As shown in Figure 1, the MAC-hs entity of Node B side and radio network controller (RNC, Radio Network Controller) the MAC entity (MAC-d of the processing dedicated channel of side, MAC entity handling dedicated channels) undertaken alternately by MAC-d flow, the MAC-hs entity receives MAC-d protocol Data Unit (PDU from the MAC-d entity of RNC side, Protocol DataUnit) puts into Node B queue buffer, and send.
MAC-hs based on Node B, directly control re-transmission by Node B, can improve the speed of re-transmission, the time delay when reducing transfer of data, Node B can dispatch the size that sends data apace and send object according to channel condition simultaneously, thus the sub-district throughput that improves.But, in order to limit two layers time delay, reduce loss of data and because high speed descending sharing channel (HS-DSCH, High SpeedDownlink Shared Channel) retransmits being jammed of causing, the MAC-hs entity of Node B side need be realized flow control function.Flow control is independently to carry out according to the priority of each HS-DSCH, increases the metadata cache formation in Node B side simultaneously and preserves the MAC-d PDU that RNC sends.
For this reason, R5 has increased two kinds of FP control frames newly in Frame Protocol (FP, frame protocol): requests for capacity (CAPACITY REQUEST) frame and capacity allocation (CAPACITY ALLOCATION) frame.The CAPACITYALLOCATION frame is used for carrying the Flow Control interactive information between Node B and the RNC, reciprocal process is shown in Fig. 2 A, B: RNC can be by the data buffer zone size of each priority among certain MAC-d flow of CAPACITY REQUEST notice Node B, and each CAPACITYREQUEST frame can only carry the data message of a priority query among the MAC-d flow.Node B controls RNC and sends data by sending CAPACITY ALLOCATION frame, distributes the corresponding business capacity to RNC, and it is effective effectively to solve Node B buffer memory ability, controls service transmission quality simultaneously.
Existing implementation about flow control between the Iub of HSDPA is illustrated in fig. 3 shown below, and basic step is as follows:
Though above-mentioned prior art can fast reaction and the speed of response Node B scheduler, the mutual interval of shortening Flow Control can cause between the Iub mouth Flow Control too frequent, and base station and RNC will increase computational burden; Node B receives that the CQI feedback that UE sends has certain time-delay and error, and in addition, Iub mouth Flow Control is fed back too fast meeting to CQI and caused shake, also is unfavorable for the overall performance of system.
Summary of the invention
The technical problem to be solved in the present invention is to provide the method and the device of a kind of Iub mouth flow control, can simplify the flow control of Iub mouth, thereby prevents the system handles burden that capacity allocation too frequently causes.
The technical scheme that realizes the object of the invention is as follows:
The method of a kind of Iub mouth flow control may further comprise the steps:
RNC sends capacity request frame to the base station every 100ms, notifies the buffer memory occupied information of each formation;
The average transmission rate of eating dishes without rice or wine of each formation is measured every 100ms in the base station, and according to the buffer memory occupied information, for the size and the cycle of the Iub oral instructions transmission of data piece of next 100ms are selected in each formation, and sends the capacity allocation frame to RNC.
Preferably, the concrete parameter of capacity allocation frame is set in described base station according to following steps:
Set repetition period T according to the buffer memory occupied information;
By calculating the MAC-d PDU number that obtains each formation Iub mouth be: (average transmission rate of eating dishes without rice or wine * T)/(MAC-d PDU length maximum).
Preferably, described base station is according to the following steps partition capacity:
The highest formation of formation medium priority of a, the unallocated capacity of selection;
B, transmit the descending order of Mean Speed according to eating dishes without rice or wine and be followed successively by terminal distribution capacity under this formation;
If the c capacity has residue, then go to step a, otherwise finish to distribute.
Preferably, for the identical formation of priority, select to eat dishes without rice or wine to transmit the highest formation priority allocation of Mean Speed.
Preferably, if the capacity allocation stand-by period of formation surpasses predefined capacity allocation maximum wait time or this buffer queue data volume less than formation minimal buffering data volume, then capacity allocation is preferentially carried out to this formation according to the maximum capacity that 100ms can transmit in the base station.
Preferably, described capacity allocation maximum wait time is set at the integral multiple of 100ms, and described buffer queue data volume minimum value is set at the maximum amount of data of four times of Transmission Time Intervals transmission.
In addition, the present invention also provides a kind of volume control device of Iub mouth, comprising:
Measuring unit is used for measuring every 100ms the average transmission rate of eating dishes without rice or wine of each formation;
Scheduling unit, the buffer memory that is used for obtaining according to the capacity request frame that RNC sends every 100ms each formation takies situation, the size and the cycle of distributing the Iub oral instructions transmission of data piece of next 100ms for each priority query, and send the capacity allocation frame to RNC.
Preferably, described scheduling unit is the queue assignment capacity according to priority from high to low in proper order.
Preferably, described scheduling unit transmits the descending order assignment capacity of Mean Speed for the terminal under each formation according to eating dishes without rice or wine.
Preferably, for the identical formation of priority, shown in scheduling unit select to eat dishes without rice or wine to transmit the highest formation priority allocation capacity of Mean Speed.
Preferably, surpass predefined capacity allocation maximum wait time or this buffer queue data volume less than formation minimal buffering data volume for capacity allocation stand-by period of formation, described scheduling unit preferentially carries out capacity allocation to this formation according to the maximum capacity that 100ms can transmit.
Preferably, described capacity allocation maximum wait time is set at the integral multiple of 100ms, and described buffer queue data volume minimum value is set at the maximum amount of data of four times of Transmission Time Intervals transmission.
Preferably, described scheduling unit is set the concrete parameter of capacity allocation frame in the following manner:
Set repetition period T according to the buffer memory occupied information;
By calculating the MAC-d PDU number that obtains each formation Iub mouth be: (average transmission rate of eating dishes without rice or wine * T)/(MAC-d PDU length maximum).
Compared with prior art, technical scheme provided by the invention has following beneficial effect:
The invention provides the simple solution of a kind of Iub mouth flow control, compare with existing fluidics, by the volume controlled cycle of employing 100ms and the mechanism of timed sending, can simplify the mutual of volume controlled frame between RNC and the NodeB, and prevent effectively that capacity allocation is too frequent and cause the problem of system handles burden.In addition, the present invention is by effectively calculating each formation transmittability of on average eating dishes without rice or wine, and the re-transmission that can reduce rlc layer causes the base station redundant data; Because Flow Control is to carry out according to the actual transmission rate of eating dishes without rice or wine, can more effectively utilize the Iub port band width simultaneously, reduce unnecessary waste.In addition, the present invention can also guarantee quality of service when considering the terminal channel quality, and effectively control retransmits the wasting of resources that causes, thereby improves the overall performance of system, reduces the computational burden of equipment.
Below in conjunction with the drawings and specific embodiments the present invention is further described.
Description of drawings
Fig. 1 is the mutual schematic diagram between the MAC-d entity of the MAC-hs entity of Node B side in the HSDPA technology and RNC side;
Fig. 2 is a Flow Control reciprocal process schematic diagram between prior art Node B and the RNC;
Fig. 3 is the flow chart of flow control between the Iub of HSDPA in the prior art;
Fig. 4 is a Flow Control reciprocal process schematic diagram between Node B of the present invention and the RNC;
Fig. 5 is the flow chart of flow control between the Iub of HSDPA of the present invention;
Fig. 6 is the flow chart of Node B capacity allocation of the present invention;
Fig. 7 is the device block diagram of flow control between the Iub of HSDPA of the present invention.
Embodiment
At present, the data service major part occurs in indoor among the 3G, the quick variation of channel quality is not a key factor of considering Iub mouth Flow Control, for this reason, the invention provides the simple solution of a kind of Iub mouth flow control, can simplify the mutual of volume controlled frame between RNC and the Node B, can also when considering the terminal channel quality, guarantee quality of service simultaneously, can also effectively control and retransmit the wasting of resources that causes, thereby improve the overall performance of system, reduce the computational burden of equipment.
After adopting the HSDPA technology, Node B has increased the measurement function of formation bit rate, and this measurement item carries out an important references item of RRM as RNC.Bit rate is measured the bit rate of eating dishes without rice or wine that each formation can provide in the main 100ms of the measurement scope, and each formation of each terminal bit rate of eating dishes without rice or wine; And for different dispatching algorithms, 100ms can reflect that Node B can offer the mean bit rate of eating dishes without rice or wine of each terminal.
For this reason, as shown in Figure 4, Node B and RNC carry out when mutual, and Node B can carry out flow control according to bit rate measurements, is that one-period carries out flow control with 100ms, the timed sending flow control frame; Bit rate according to the base station provides for each formation is the transmittability of Iub in the next 100ms of each queue assignment.In addition, RNC also regularly sends to Node B with the situation that takies of each formation buffer memory by capacity request frame every 100ms, and like this, each formation cache size is as a foundation of Node B partition capacity.
As shown in Figure 5, the idiographic flow of flow control is as follows:
After step 503, RNC receive the volume controlled frame, send data, will send capacity request frame simultaneously, the size of each formation remaining cache of notice Node B to Node B according to the capacity that distributes in the capacity allocation frame;
Wherein, the concrete parameter of capacity allocation frame can be set in the following manner:
The recurrence interval is set at 10ms, and the repetition period is 100ms, and the number of obtaining MAC-d PDU every this formation of 100ms Iub mouth is so:
(AvgBPS * 100ms)/(MAC-d PDU length maximum); AvgBPS is the average transmission rate of eating dishes without rice or wine.
In addition, if the data cached deficiency of RNC then can reduce the repetition period accordingly.
Because base station buffer queue data overstand, the overtime re-transmission of the RLC of RNC can cause the base station buffering area that redundant MAC-d PDU data are arranged, the present invention program is by the flow control interval of 100ms, reach and calculate the available bit rate of eating dishes without rice or wine, can guarantee that data are sent out away in the formation in 100ms, retransmit the redundant influence that brings to power system capacity thereby reduced.
In order to guarantee the correctness of bit rate measurements, Node B when carrying out capacity allocation, also to consider each formation of each terminal keep at least 100ms eat dishes without rice or wine maximum amount of data can be provided; The formation buffer area internal memory of Node B will have this requirement; If because formation does not have data, the measurement of 100ms should be removed does not at interval so have data during this period of time, does not have the influence of data to the formation bit rate measurements thereby reduce formation as far as possible simultaneously.
In order to reduce professional delay, guarantee quality of service, guarantee that Iub mouth data can be sent out away at next 100ms, reduce the time of delay in Node B formation, the detailed process of Node B capacity allocation as shown in Figure 6:
By above-mentioned steps as can be seen, the principle of Node B capacity allocation is at first to consider the formation that dispatching priority is the highest, if this priority query distributes, continues to distribute time priority query, all distributes up to all formations.For the identical formation of priority, can distribute the highest formation of bit rate of eating dishes without rice or wine earlier, to guarantee the throughput of system.If the transmission rate of eating dishes without rice or wine in certain 100ms of priority query is 0, then the base station just is assigned as 0 for it.
When practical application, because the actual physical bandwidth of Iub is limited between RNC and the NodeB, so the not enough phenomenon of bandwidth may appear in the NodeB capacity allocation, and the formation of low priority will can not get the chance of capacity allocation so; If certain priority query does not have data simultaneously, also can cause capacity allocation is 0.For this reason, on the basis of such scheme, can also be by setting capacity allocation maximum wait time CapaAlloc_MaxWaitTime and formation minimal buffering data volume QueBuffer_LowTH.If the capacity allocation of certain formation failure, the stand-by period surpasses CapaAlloc_MaxWaitTime or this buffer queue data volume less than QueBuffer_LowTH, then this formation of NodeB priority allocation, and can transmit the maximum capacity partition capacity according to 100ms.
Wherein, CapaAlloc_MaxWaitTime can be set at the integral multiple of 100ms, and for buffer queue data volume minimum value QueBuffer_LowTH, in order to prevent that Low Priority Queuing from not having data, can not influence the normal allocation process again, this minimum value preferably is set at the maximum amount of data that four Transmission Time Intervals (TTI, Transmission Time Interval) can transmit.
About the Iub mouth Flow Control of HSDPA, agreement regulation NodeB need not come partition capacity according to the RNC requests for capacity.Solution of the present invention focus on the mutual simplification of Flow Control, thereby set RNC and just send capacity request frame to NodeB every 100ms, notify the size of its buffer memory.
As shown in Figure 7, the device block diagram for flow control between the Iub of HSDPA of the present invention comprises:
Measuring unit 701 is measured the average transmission rate of eating dishes without rice or wine of each formation every 100ms, and the average transmission rate of eating dishes without rice or wine of measuring all terminals under each formation;
The concrete parameter that scheduling unit 702 is set the capacity allocation frame is as follows:
Set repetition period T according to the buffer memory occupied information, for example: T=100ms, T can adjust accordingly according to the cache size of RNC.
By calculating (the average transmission rate of eating dishes without rice or wine * T)/(MAC-d PDU length maximum), obtain the MAC-d PDU number of each formation Iub mouth.
In addition, described scheduling unit 702 is when partition capacity, and formation is according to priority selective sequential from high to low, and eats dishes without rice or wine to transmit the descending order of Mean Speed partition capacity successively for each priority query according to terminal under this formation.For the identical formation of priority, select to eat dishes without rice or wine to transmit the highest formation priority allocation capacity of Mean Speed.
Described scheduling unit 702 is when partition capacity, surpass predefined capacity allocation maximum wait time or less than this buffer queue data volume minimum value, the maximum capacity that can transmit according to 100ms preferentially carries out capacity allocation to this formation for the capacity allocation of formation.Capacity allocation maximum wait time is set at the integral multiple of 100ms, such as 300ms or 400ms; And that buffer queue data volume minimum value is set at the maximum amount of data of four times of Transmission Time Intervals transmission is more suitable.
Technical solution of the present invention is the timed sending control frame between NodeB and RNC, insert for single carrier under the full SOT state of termination in sub-district of 16 terminals, suppose that all there are data in 8 priority queries of terminal, under extreme case, to have 16 * 2 * 8=256 Flow Control frame in the 100ms and carry out alternately, also be unidirectional 128 frames; If each frame calculates according to 5Byte, the Flow Control occupied bandwidth is approximately 128 * 5 * 8/0.1=50Kbit/s.Can see that this bandwidth usage is also little.
For the present invention program better is described, for the example detailed description of a HSDPA terminal.
Assumed condition:
(1) in the HSDPA base station, dispatches as terminal A;
(2) terminals can be supported 16 level priority formations, and a formation can be regarded a kind of service bearer as.Here set this terminal and have only two kinds of service bearer HTTP and Email, two priority queries are promptly arranged;
(3) base station HSDPA air-interface scheduling algorithm is dispatched according to priority, and the priority of HTTP is higher, and the interface-free resources of distribution is more.Here just convenient for example, can see that this flow control algorithm is not influenced by concrete dispatching algorithm.
The concrete implementation step of Iub mouth flow control is as follows:
1, RNC sends capacity request frame to the base station every 100ms, the notification queue cache size;
2, the base station (is carried HTTP respectively, the Mean Speed of eating dishes without rice or wine to transmit Email) every two formations of 100ms computing terminal A; Because HTTP priority height, the chance that is scheduled is many, and average transmission rate is higher so it is eated dishes without rice or wine, and supposes 50K bit/s; And Email priority is low, and the chance that is scheduled is few, and the average transmission rate of eating dishes without rice or wine is low, supposes 10K bit/s;
3, the base station is mapped to the Iub mouth, i.e. 50Kbit/s according to the HTTP average transmission rate 50K bit/s that eats dishes without rice or wine.MAC-d PDU size is made as 100bit, calculates every 100ms by formula so, and the Iub mouth obtains MAC-d PDU number and is: (50K bit/s * 0.1s)/(100)=50 (individual); The recurrence interval is set at 10ms in the capacity request frame, and the repetition period is set at 100ms (repetition period is meant that RNC uses the interval of this capacity allocation frame), and RNC can send 50 MAC-d PDU in the 100ms;
Accordingly, the base station is mapped to the Iub mouth, i.e. 10K bit/s according to the Email average transmission rate 10K bit/s that eats dishes without rice or wine.MAC-d PDU size is made as 100bit, calculates every 100ms by formula so, and the Iub mouth obtains MAC-d PDU number and is: (10K bit/s * 0.1s)/(100)=10 (individual); 100msRNC can send 10 MAC-d PDU.
RNC is data cached when not enough, can reduce the repetition period accordingly.Such as, through one or several all after date, if the HTTP formation cache size of RNC does not have 50 MAC-d PDU, have only 10, the capacity allocation frame will be revised accordingly so, if recurrence interval or 10ms, repetition period will become 100ms/5 so, i.e. 20ms.
Above-described embodiment of the present invention does not constitute the qualification to protection range of the present invention.Any any modification of being done within the spirit and principles in the present invention, be equal to and replace and improvement etc., all should be included within the claim protection range of the present invention.
Claims (13)
1. the method for Iub mouth flow control is characterized in that, may further comprise the steps:
Radio network controller (RNC) sends capacity request frame to the base station every 100ms, notifies the buffer memory occupied information of each formation;
The average transmission rate of eating dishes without rice or wine of each formation is measured every 100ms in the base station, and according to the buffer memory occupied information, for the size and the cycle of the Iub oral instructions transmission of data piece of next 100ms are selected in each formation, and sends the capacity allocation frame to RNC.
2. the method for claim 1 is characterized in that, the concrete parameter of capacity allocation frame is set in described base station according to following steps:
Set repetition period T according to the buffer memory occupied information;
By the MAC entity protocol Data Unit MAC-d PDU number of calculating the processing dedicated channel that obtains each formation Iub mouth be: (average transmission rate of eating dishes without rice or wine * T)/(MAC-d PDU length maximum).
3. the method for claim 1 is characterized in that, described base station is according to the following steps partition capacity:
The highest formation of formation medium priority of a, the unallocated capacity of selection;
B, transmit the descending order of Mean Speed according to eating dishes without rice or wine and be followed successively by terminal distribution capacity under this formation;
If the c capacity has residue, then go to step a, otherwise finish to distribute.
4. method as claimed in claim 3 is characterized in that, for the identical formation of priority, selects to eat dishes without rice or wine to transmit the highest formation priority allocation of Mean Speed.
5. method as claimed in claim 3, it is characterized in that, if the capacity allocation stand-by period of formation surpasses predefined capacity allocation maximum wait time or this buffer queue data volume less than formation minimal buffering data volume, then capacity allocation is preferentially carried out to this formation according to the maximum capacity that 100ms can transmit in the base station.
6. method as claimed in claim 5 is characterized in that, described capacity allocation maximum wait time is set at the integral multiple of 100ms, and described buffer queue data volume minimum value is set at the maximum amount of data of four times of Transmission Time Intervals transmission.
7. the volume control device of an Iub mouth is characterized in that, comprising:
Measuring unit is used for measuring every 100ms the average transmission rate of eating dishes without rice or wine of each formation;
Scheduling unit, the buffer memory that is used for obtaining according to the capacity request frame that RNC sends every 100ms each formation takies situation, the size and the cycle of distributing the Iub oral instructions transmission of data piece of next 100ms for each priority query, and send the capacity allocation frame to RNC.
8. device as claimed in claim 7 is characterized in that, described scheduling unit is the queue assignment capacity according to priority from high to low in proper order.
9. device as claimed in claim 8 is characterized in that, described scheduling unit transmits the descending order assignment capacity of Mean Speed for the terminal under each formation according to eating dishes without rice or wine.
10. device as claimed in claim 9 is characterized in that, for the identical formation of priority, shown in scheduling unit select to eat dishes without rice or wine to transmit the highest formation priority allocation capacity of Mean Speed.
11. device as claimed in claim 9, it is characterized in that, surpass predefined capacity allocation maximum wait time or this buffer queue data volume less than this formation minimal buffering data volume for capacity allocation stand-by period of formation, described scheduling unit preferentially carries out capacity allocation to this formation according to the maximum capacity that 100ms can transmit.
12. device as claimed in claim 11 is characterized in that, described capacity allocation maximum wait time is set at the integral multiple of 100ms, and described buffer queue data volume minimum value is set at the maximum amount of data of four times of Transmission Time Intervals transmission.
13. device as claimed in claim 7 is characterized in that, described scheduling unit is set the concrete parameter of capacity allocation frame in the following manner:
Set repetition period T according to the buffer memory occupied information;
By calculating the MAC-d PDU number that obtains each formation Iub mouth be: (average transmission rate of eating dishes without rice or wine * T)/(MAC-d PDU length maximum).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2006100892131A CN101123622B (en) | 2006-08-09 | 2006-08-09 | A method and device for Iub interface traffic control |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2006100892131A CN101123622B (en) | 2006-08-09 | 2006-08-09 | A method and device for Iub interface traffic control |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101123622A true CN101123622A (en) | 2008-02-13 |
| CN101123622B CN101123622B (en) | 2011-12-28 |
Family
ID=39085800
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2006100892131A Active CN101123622B (en) | 2006-08-09 | 2006-08-09 | A method and device for Iub interface traffic control |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101123622B (en) |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102104913A (en) * | 2009-12-22 | 2011-06-22 | 上海无线通信研究中心 | Relay network flow control method |
| CN102457908A (en) * | 2010-10-27 | 2012-05-16 | 普天信息技术研究院有限公司 | Method for flow control of Iub port based on scheduling state |
| CN102546042A (en) * | 2010-12-14 | 2012-07-04 | 普天信息技术研究院有限公司 | Empty rate statistical method |
| CN102595507A (en) * | 2011-01-13 | 2012-07-18 | 普天信息技术研究院有限公司 | Lower limit stream control method |
| CN101668295B (en) * | 2009-05-31 | 2012-11-14 | 北京邮电大学 | Resource reuse method and system for supporting cooperative transmission in communication system |
| CN101888666B (en) * | 2009-05-14 | 2013-04-17 | 华为技术有限公司 | Method, device and system for providing capacity assignment information |
| CN102065483B (en) * | 2009-11-18 | 2013-12-04 | 华为技术有限公司 | Flow controlling method and device |
| WO2014121445A1 (en) * | 2013-02-05 | 2014-08-14 | 华为技术有限公司 | Method and device for data transmission |
| CN106789515A (en) * | 2016-12-30 | 2017-05-31 | 深圳市优必选科技有限公司 | Data transmission method and device |
| CN107343293A (en) * | 2016-04-29 | 2017-11-10 | 迈普通信技术股份有限公司 | A kind of link keep-alive method and equipment |
| CN108924665A (en) * | 2018-05-30 | 2018-11-30 | 深圳市捷视飞通科技股份有限公司 | Reduce method, apparatus, computer equipment and the storage medium of video playing delay |
| US11800385B2 (en) | 2018-01-09 | 2023-10-24 | Guangdong Oppo Mobile Telecommunications Corp., Ltd. | Data sending control method for terminal, terminal device, and computer storage medium |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| TW201101752A (en) * | 2002-05-10 | 2011-01-01 | Interdigital Tech Corp | Cognitive flow control based on channel quality conditions |
| CN100499858C (en) * | 2003-03-31 | 2009-06-10 | 富士通株式会社 | Radio communication network and flow control method |
| FR2861529B1 (en) * | 2003-10-24 | 2006-02-03 | Evolium Sas | METHOD FOR MANAGING PROCESSING RESOURCES IN A MOBILE RADIOCOMMUNICATION SYSTEM |
-
2006
- 2006-08-09 CN CN2006100892131A patent/CN101123622B/en active Active
Cited By (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101888666B (en) * | 2009-05-14 | 2013-04-17 | 华为技术有限公司 | Method, device and system for providing capacity assignment information |
| CN101668295B (en) * | 2009-05-31 | 2012-11-14 | 北京邮电大学 | Resource reuse method and system for supporting cooperative transmission in communication system |
| CN102065483B (en) * | 2009-11-18 | 2013-12-04 | 华为技术有限公司 | Flow controlling method and device |
| CN102104913A (en) * | 2009-12-22 | 2011-06-22 | 上海无线通信研究中心 | Relay network flow control method |
| CN102104913B (en) * | 2009-12-22 | 2013-11-20 | 上海无线通信研究中心 | Relay network flow control method |
| CN102457908A (en) * | 2010-10-27 | 2012-05-16 | 普天信息技术研究院有限公司 | Method for flow control of Iub port based on scheduling state |
| CN102457908B (en) * | 2010-10-27 | 2014-06-18 | 普天信息技术研究院有限公司 | Method for flow control of Iub port based on scheduling state |
| CN102546042B (en) * | 2010-12-14 | 2014-08-13 | 普天信息技术研究院有限公司 | Empty rate statistical method |
| CN102546042A (en) * | 2010-12-14 | 2012-07-04 | 普天信息技术研究院有限公司 | Empty rate statistical method |
| CN102595507A (en) * | 2011-01-13 | 2012-07-18 | 普天信息技术研究院有限公司 | Lower limit stream control method |
| CN102595507B (en) * | 2011-01-13 | 2014-07-30 | 普天信息技术研究院有限公司 | Lower limit stream control method |
| WO2014121445A1 (en) * | 2013-02-05 | 2014-08-14 | 华为技术有限公司 | Method and device for data transmission |
| CN104094636A (en) * | 2013-02-05 | 2014-10-08 | 华为技术有限公司 | Method and device for data transmission |
| CN104094636B (en) * | 2013-02-05 | 2018-02-23 | 华为技术有限公司 | A kind of method and apparatus of data transfer |
| CN107343293A (en) * | 2016-04-29 | 2017-11-10 | 迈普通信技术股份有限公司 | A kind of link keep-alive method and equipment |
| CN106789515A (en) * | 2016-12-30 | 2017-05-31 | 深圳市优必选科技有限公司 | Data transmission method and device |
| CN106789515B (en) * | 2016-12-30 | 2020-03-27 | 深圳市优必选科技有限公司 | Data transmission method and device |
| US11800385B2 (en) | 2018-01-09 | 2023-10-24 | Guangdong Oppo Mobile Telecommunications Corp., Ltd. | Data sending control method for terminal, terminal device, and computer storage medium |
| CN108924665A (en) * | 2018-05-30 | 2018-11-30 | 深圳市捷视飞通科技股份有限公司 | Reduce method, apparatus, computer equipment and the storage medium of video playing delay |
| CN108924665B (en) * | 2018-05-30 | 2020-11-20 | 深圳市捷视飞通科技股份有限公司 | Method and device for reducing video playing delay, computer equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101123622B (en) | 2011-12-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101123622B (en) | A method and device for Iub interface traffic control | |
| JP4510826B2 (en) | Method for scheduling uplink transmission of user equipment and base station | |
| CN100586220C (en) | Method of packet scheduling in high speed downlink packet access network | |
| TWI374645B (en) | Methods, wireless communications apparatus, machine-readable mediums, and processors for efficiently providing and obtaining scheduling information | |
| CN103166995B (en) | A kind of video transmission method and device | |
| JP4481990B2 (en) | Harmonized data flow control and buffer sharing in UMTS | |
| CN1921444B (en) | Method for classified package dispatching and resource distributing based on service quality, and communication device | |
| CN100431362C (en) | Packet service scheduling method in mobile communication system | |
| US7817660B2 (en) | High capacity scheduler | |
| CN101480077A (en) | Dynamic resource reuse pattern selection in a cellular communication system | |
| JP2014514818A (en) | Business flow creation and apparatus, business flow correction method and apparatus | |
| CN102577569A (en) | Rate shaping for wireless communication using token bucket that allows token debt | |
| US20190021101A1 (en) | Decreasing free-riding data traffic in uplink scheduling | |
| US8767760B2 (en) | Method and system for handling queues in communication networks, corresponding computer program product | |
| CN1996942A (en) | A method and system for traffic control | |
| CN101350804A (en) | Method and apparatus for scheduling high speed down packet access service | |
| CN100459578C (en) | A method to acquire downlink data from upper network equipment by cell base station | |
| CN100433637C (en) | Base station for carrying out resource scheduling for user device in wireless network and its method | |
| WO2016090607A1 (en) | Backhaul terminal, base station and flow control method for wireless network | |
| JP2006128774A (en) | Radio base station and scheduler algorithm setting method therein | |
| CN101610541B (en) | Method and device for transmitting RLC information in HSDPA system | |
| CN109729592A (en) | Base station and its resource allocation methods | |
| KR100606898B1 (en) | The method to manage radio resources for packet scheduling, and system using the same | |
| CN101795469A (en) | Data transmission method and device | |
| CN101527939B (en) | Method and device for UE bandwidth demand forecasting used for HSUPA 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 |