CN101252516A - Method for realizing high speed downlink grouping traffic - Google Patents

Method for realizing high speed downlink grouping traffic Download PDF

Info

Publication number
CN101252516A
CN101252516A CNA2008100662764A CN200810066276A CN101252516A CN 101252516 A CN101252516 A CN 101252516A CN A2008100662764 A CNA2008100662764 A CN A2008100662764A CN 200810066276 A CN200810066276 A CN 200810066276A CN 101252516 A CN101252516 A CN 101252516A
Authority
CN
China
Prior art keywords
priority
data
error rate
priority query
outer shroud
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
Application number
CNA2008100662764A
Other languages
Chinese (zh)
Other versions
CN101252516B (en
Inventor
李瑞峰
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Meng Yanfang
Qi Aiguo
Qiao Ruchun
Shao Xishan
Original Assignee
ZTE Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by ZTE Corp filed Critical ZTE Corp
Priority to CN2008100662764A priority Critical patent/CN101252516B/en
Publication of CN101252516A publication Critical patent/CN101252516A/en
Application granted granted Critical
Publication of CN101252516B publication Critical patent/CN101252516B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses an implementation method of the high-speed downlink packet service, which includes the steps that the queues with different priorities in the community are sorted; the queue with data accumulation is sorted in front of the scheduling priority queue; the queue with data accumulation priority is scheduled and packaged; the error rate is set in the high-speed downlink grouping service for the exterior ring adjustment. The implementation method of the high-speed downlink grouping service provided by the invention adopts the mode of arranging the priority of the HSDPA service so that the transmission error rate is reduced and the transmission delay is reduced effectively.

Description

A kind of implementation method of high speed downlink grouping traffic
Technical field
The present invention proposes a kind of service implementation method in WCDMA and TD-SCDMA field, and in particular a kind of (hereinafter to be referred as NodeB) realizes solving sudden and low discharge high speed downlink grouping traffic (hereinafter to be referred as HSDPA) implementation method in the base station.
Background technology
HSDPA is meant that high speed downlink packet inserts, it be 3GPP in the R5 agreement on satisfying/the asymmetric demand of downstream data traffic and a kind of modulation and demodulation algorithm of proposing, it can bring up to 10Mbps to downstream data traffic speed under the situation that does not change the WCDMA network configuration of having built.This technology is a kind of important technology that the WCDMA networking later stage improves downlink capacity and data service rate.The HSDPA The Application of Technology can fully satisfy operator and face the enforcement that capacity requirement is carried out dilatation when big especially in the 3G network maturity period.
In the prior art, what of participation outer shroud adjustment statistical sample number are the effect of adjusting external circule power control depend on, when participating in that outer shroud adjusts that less and time of sample number distributes and when inhomogeneous, outer shroud is adjusted effect comparatively speaking will be weaker, and the main feature of bursts of traffic to be data be not sends continuously, but cut in and out; And that the main feature of low discharge business is a data volume is smaller.
More than these two kinds of business all belong to HSDPA basic service characteristics; Therefore the adjustment of common HSDPA data channel (HSDSCH) external circule power control is all not too suitable for these two kinds of business.For example common R99 external circule power control is adjusted sample more for a long time at outer shroud, adjusts by BLER (Block Error Rate), and works as number of samples more after a little while, adjusts by BER (bit error rate).
But owing in HSDPA, send with the transmission block packetized form, so adjusting the less situation of sample when outer shroud can not be by being similar to R99 outer shroud method of adjustment, therefore find a kind of burst service or professional outer shroud method of adjustment of low discharge HSDPA of being applicable to, help to reduce transmission error rates, just seem important thereby reduce propagation delay time.
Therefore, prior art has yet to be improved and developed.
Summary of the invention
The object of the present invention is to provide a kind of implementation method of high speed downlink grouping traffic, at bursts of traffic or low discharge HSDPA business characteristic, realization is applicable to burst service or the professional outer shroud method of adjustment of low discharge HSDPA, reduces transmission error rates, thereby reduces propagation delay time.
Technical scheme of the present invention comprises:
A kind of implementation method of high speed downlink grouping traffic, it may further comprise the steps:
A, sort for all priority queries in this sub-district, what data stacking will be arranged is placed on dispatching priority formation front;
B, scheduling have the priority query of data stacking, and package;
C, high speed downlink grouping traffic is set the error rate carry out the outer shroud adjustment.
Described method, wherein, described step C also comprises:
C1, initial setting up one target error rate, and adjustment step-length and outer shroud initial value are set;
C2, whenever receive and a confirmation (ACK) the outer shroud adjustment is subtracted 1; Whenever receive a negative acknowledgment information (NACK), the outer shroud adjustment adds one and adjusts step-length;
C3, in the given time, add up the error rate of this Priority Queuing, and compare, if greater than the maximum bit error rate of described permission with the maximum bit error rate that allows, described target error rate is turned down, and upgrading the adjustment step-length simultaneously is (the former target error rate of 1-)/former target error rate.
Described method wherein, comprises among the described step C1: the described target error rate of initial setting up is 10%, and is provided with that to adjust step value be 9, and described outer shroud initial value is set to 0.
Described method, wherein, described steps A also comprises:
A1, sort according to set dispatching algorithm for the priority query that the data stacking amount is arranged.
Described method, wherein, described steps A also comprises:
The priority query of A2, free of data is positioned in the dispatching priority formation after the current priority query that data are arranged, relative priority level size between the free of data priority query is with the preceding once scheduling moment time difference inversely proportional relation of current time with subscriber equipment under this priority query.
Described method, wherein, described dispatching algorithm comprises PF, or RR, or MAX-C/I.
Described method, wherein, described step B also comprises:
B1, select priority query to be scheduled, and scheduling there is the priority query of data stacking, writes down the transmission block size of this priority query;
B2, after the Priority Queuing of data is finished, whether do not have data priority formation wait for scheduling, withdraw from as not existing then if judging to exist in the priority query;
B3, judge whether this local resource has residue, as then not withdrawing from; Otherwise, dispatch this priority query, selection is near the transmission block that writes down before this priority query;
B4, the transmission block of selecting according to described step B3 package.
Described method, wherein, described local resource comprises code channel and power.
Described method, wherein, described step B4 also comprises: VF, QueueID, SID in the group bag data of free of data priority query, the F bit is filled in when data are arranged, and that the group bag fills in is consistent, and it transmits Sequence Number and is changed to this priority query and obtains transmitting Sequence Number of acknowledgement indicator the last time.
The implementation method of a kind of high speed downlink grouping traffic provided by the present invention owing to adopted the mode that the HSDPA service priority is arranged, has reduced transmission error rates, and has effectively reduced propagation delay time.
Description of drawings
Fig. 1 is the schematic flow sheet of arranging for low discharge or the formation of burst service dispatching priority in the inventive method;
Fig. 2 is a MAC-hs PDU data structure schematic diagram on the agreement in the inventive method;
Fig. 3 is the burst service or the low discharge HSDPA service dispatching handling process schematic diagram of the inventive method;
Fig. 4 is that the burst service or the professional outer shroud of low discharge HSDPA of the inventive method adjusted schematic flow sheet.
Embodiment
Below in conjunction with accompanying drawing, will be described in more detail each preferred embodiment of the present invention.
In the implementation method of high speed downlink grouping traffic of the present invention, it has comprised bursts of traffic or low discharge HSDPA service priority alignment processes, bursts of traffic or low discharge HSDPA service dispatching processing procedure, the professional outer shroud adjustment process of burst service or low discharge HSDPA, and bursts of traffic or the professional HARQ use of low discharge HSDPA.
For burst service or low discharge HSDPA business are maintained less BLER (Block Error Rate), reduce transmission error rates, and effectively reduce propagation delay time, the inventive method is about burst service or the professional outer shroud adjustment process of low discharge HSDPA, as shown in Figure 4, comprise step:
The first step: initial setting up one target block error rate BLER for example is 10%, and being provided with this moment and adjusting step-length K value is 9; The outer shroud initial value is set to 0;
Second step: whenever receive a confirmation (ACK), the outer shroud adjustment is subtracted 1; Whenever receive a negative acknowledgment information (NACK), the outer shroud adjustment adds K;
The 3rd step: within a certain period of time, add up the Que of this priority query and send the MACHSPDU error rate, only statistics comprises the MACHSPDU bag transmission situation of MACDPDU bag, and the data dispatch situation is just arranged, and does not have the data dispatch situation and do not add up; Compare with the maximum bit error rate value ALLOWED_MAXBLER that is allowed then,, upgrade the K value simultaneously and be ((1-BLER)/BLER) if, just target error rate BLER is turned down greater than the maximum bit error rate value ALLOWED_MAXBLER of this permission.
In the inventive method, adjust statistical sample for increasing outer shroud, the present invention as shown in Figure 1, comprises the steps: about bursts of traffic or low discharge HSDPA service priority alignment processes
The first step: sorting for all Que (priority query) in this sub-district, is that the unification that will data stacking be arranged under the Que is placed on dispatching priority formation front in principle, and current do not have the Que of data then to be placed on dispatching priority formation back;
Second step: for the data stacking amount is arranged under the Que, according to set dispatching algorithm PF, or RR, or MAX-C/I etc. sorts, for the Que that does not have data stacking, judge the time difference between the last scheduling constantly of the affiliated subscriber equipment (UE) of current time and this Que, whether be not less than predefined assignment SCHTTI_INTERVAL (can carry out assignment) according to actual conditions or type of service; If when being not less than SCHTTI_INTERVAL, carrying out next step, otherwise withdraw from;
The 3rd step: the Que of free of data is put in the dispatching priority formation, and the Que of free of data is positioned in the dispatching priority formation after the current Que that data are arranged; Relative priority level size between the Que of free of data is with the preceding once scheduling moment time difference inversely proportional relation of current time with UE under this Que.
Have under the Que of the data normal consistency prerequisite not influencing, increase external circule power control and adjust performance; The present invention as shown in Figure 3, comprises the steps: about bursts of traffic or low discharge HSDPA service dispatching processing method
The first step: after selecting priority query to be scheduled in bursts of traffic or the low discharge HSDPA service priority alignment processes, at first scheduling has the Que of data stacking, write down FilterTbsize=p*FilterTbsize+ (1-p) the * TBSIZE of this Que, p wherein: filtering factor, TBSIZE are that this dispatching office is selected the transmission block size;
Second step: after the Que of data scheduling is finished, judge whether exist the Que that does not have data to wait for scheduling in this priority query, if there is no not have the Que of data, directly to withdraw from getting final product;
The 3rd step: judge whether code channel and power that local resource is included have residue; If residue does not directly withdraw from;
The 4th step: dispatch this priority query, can use code channel and power, select to write down the transmission block of FilterTbsize near this priority query according to the sub-district;
The 5th step: the transmission block of selecting according to previous step packages, as shown in Figure 2, VF in the MAC-hs PDU packet structure on agreement, QueueID, SID, bit fills in that time group bag is filled in unanimity with data are arranged among the F, and TSN is changed to this Que the last time and obtains the TSN (transmitting Sequence Number) of ACK, N is changed to 0 processing that packages, and the structure of VF, QueueID, SID, TSN, N as shown in Figure 2.
The inventive method does not have the HARQ process to use when having prevented data, and the present invention is about dispatching sudden or during low discharge HSDPA service dispatching free of data, use comprises for HARQ:
The first step: the Que of priority query for free of data dispatches employed HARQ process, does not carry out retransmission process;
Second step: if data dispatch is arranged as the Que of priority query, but and do not have the HARQ process time spent, dispatching office uses and is waiting for that UE returns the HARQ process of acknowledge message in the time of can seizing free of data.
Like this, the inventive method is by above-mentioned process scheduling, realized the external circule power control function, effectively reduce transmission error rates, and can effectively reduce propagation delay time, solution because of sudden or low discharge professional since separately professional particularity comprise that the less or data burst of data volume increases the problem that the HSDSCH exterior ring power is adjusted difficulty, thereby reduced the HSDPA error rate, reduced propagation delay time.
Need to prove, the above-mentioned relevant embodiment of the present invention of only describing, the relevant Que of priority query, HARQ process or the like basic conception is known by prior art those skilled in the art, repeats no more once more; The above-mentioned description at specific embodiment of the present invention is comparatively concrete, can not therefore think the restriction to scope of patent protection of the present invention, and scope of patent protection of the present invention should be as the criterion with claims.

Claims (9)

1, a kind of implementation method of high speed downlink grouping traffic, it may further comprise the steps:
A, sort for all priority queries in this sub-district, what data stacking will be arranged is placed on dispatching priority formation front;
B, scheduling have the priority query of data stacking, and package;
C, high speed downlink grouping traffic is set the error rate carry out the outer shroud adjustment.
2, method according to claim 1 is characterized in that, described step C also comprises:
C1, initial setting up one target error rate, and adjustment step-length and outer shroud initial value are set;
C2, whenever receive and a confirmation outer shroud adjustment is subtracted 1; Whenever receive a negative acknowledgment information, the outer shroud adjustment adds one and adjusts step-length;
C3, in the given time, add up the error rate of this Priority Queuing, and compare, if greater than the maximum bit error rate of described permission with the maximum bit error rate that allows, described target error rate is turned down, and upgrading the adjustment step-length simultaneously is (the former target error rate of 1-)/former target error rate.
3, method according to claim 2 is characterized in that, comprises among the described step C1: the described target error rate of initial setting up is 10%, and is provided with that to adjust step value be 9, and described outer shroud initial value is set to 0.
4, method according to claim 1 is characterized in that, described steps A also comprises:
A1, sort according to set dispatching algorithm for the priority query that the data stacking amount is arranged.
5, method according to claim 1 is characterized in that, described steps A also comprises:
The priority query of A2, free of data is positioned in the dispatching priority formation after the current priority query that data are arranged, relative priority level size between the free of data priority query is with the preceding once scheduling moment time difference inversely proportional relation of current time with subscriber equipment under this priority query.
6, method according to claim 4 is characterized in that, described dispatching algorithm comprises PF, or RR, or MAX-C/I.
7, method according to claim 1 is characterized in that, described step B also comprises:
B1, select priority query to be scheduled, and scheduling there is the priority query of data stacking, writes down the transmission block size of this priority query;
B2, after the Priority Queuing of data is finished, whether do not have data priority formation wait for scheduling, withdraw from as not existing then if judging to exist in the priority query;
B3, judge whether this local resource has residue, as then not withdrawing from; Otherwise, dispatch this priority query, select transmission block near this priority query's record;
B4, the transmission block of selecting according to described step B3 package.
8, method according to claim 7 is characterized in that, described local resource comprises code channel and power.
9, method according to claim 7, it is characterized in that, described step B4 also comprises: VF, QueueID, SID in the group bag data of free of data priority query, the F bit is filled in when data are arranged, and that the group bag fills in is consistent, and it transmits Sequence Number and is changed to this priority query and obtains transmitting Sequence Number of acknowledgement indicator the last time.
CN2008100662764A 2008-03-27 2008-03-27 Method for realizing high speed downlink grouping traffic Expired - Fee Related CN101252516B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2008100662764A CN101252516B (en) 2008-03-27 2008-03-27 Method for realizing high speed downlink grouping traffic

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2008100662764A CN101252516B (en) 2008-03-27 2008-03-27 Method for realizing high speed downlink grouping traffic

Publications (2)

Publication Number Publication Date
CN101252516A true CN101252516A (en) 2008-08-27
CN101252516B CN101252516B (en) 2011-07-13

Family

ID=39955710

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2008100662764A Expired - Fee Related CN101252516B (en) 2008-03-27 2008-03-27 Method for realizing high speed downlink grouping traffic

Country Status (1)

Country Link
CN (1) CN101252516B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102959888A (en) * 2011-06-27 2013-03-06 华为技术有限公司 Method and apparatus for implementing uplink data transmission
CN103428774A (en) * 2012-05-16 2013-12-04 中兴通讯股份有限公司 Resource scheduling method and device
CN107770736A (en) * 2016-08-18 2018-03-06 中国移动通信集团重庆有限公司 A kind of data service issues dispatching method and device
CN115701149A (en) * 2021-07-14 2023-02-07 宸芯科技有限公司 Power control method, device, equipment and medium under unicast service of Internet of vehicles

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5640563A (en) * 1992-01-31 1997-06-17 International Business Machines Corporation Multi-media computer operating system and method
US6871011B1 (en) * 2000-09-28 2005-03-22 Matsushita Electric Industrial Co., Ltd. Providing quality of service for disks I/O sub-system with simultaneous deadlines and priority
CN101098295B (en) * 2006-06-27 2010-10-20 大唐移动通信设备有限公司 High speed downlink packet accessing medium access controlled multi-queue transmission method and device

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102959888A (en) * 2011-06-27 2013-03-06 华为技术有限公司 Method and apparatus for implementing uplink data transmission
CN102959888B (en) * 2011-06-27 2015-06-17 华为技术有限公司 Method and apparatus for implementing uplink data transmission
CN103428774A (en) * 2012-05-16 2013-12-04 中兴通讯股份有限公司 Resource scheduling method and device
CN103428774B (en) * 2012-05-16 2018-03-23 中兴通讯股份有限公司 Resource regulating method and device
CN107770736A (en) * 2016-08-18 2018-03-06 中国移动通信集团重庆有限公司 A kind of data service issues dispatching method and device
CN115701149A (en) * 2021-07-14 2023-02-07 宸芯科技有限公司 Power control method, device, equipment and medium under unicast service of Internet of vehicles

Also Published As

Publication number Publication date
CN101252516B (en) 2011-07-13

Similar Documents

Publication Publication Date Title
CN101288247B (en) Method and apparatus for transmitting/receiving control information of user equipment for uplink data transmission
CA2656859C (en) Compressed delay packet transmission scheduling
CA2616542C (en) Method and apparatus for control of enhanced dedicated channel transmissions
CN100512087C (en) Use of idle frames for the control of negative frame acknowledgement
CN100550691C (en) The method of dispatching group data transmission
EP3300421A1 (en) Slow mac-e for autonomous transmission in high speed uplink packet access (hsupa) along with service specific transmission time control
CN101212782B (en) High-speed uplink packet access scheduling method and system
CN1954521A (en) Method and apparatus for scheduling enhanced uplink dedicated channels in a mobile communication system
CN101064664B (en) Method for mapping and guaranteeing quality of service of high-speed downlink packet accessing system
CN101044698A (en) Method and apparatus for signaling of uestatus information for uplink data transmission in a mobile communication system
CN101164262A (en) Method and apparatus for scheduling transmissions via an enhanced dedicated channel
CN101926133A (en) Client/server adaptation scheme for communications traffic
CN106936918B (en) R L C PDU transmission method for L TE mobile communication system
CN101252516B (en) Method for realizing high speed downlink grouping traffic
CN102104968A (en) Resource scheduling method and base station
CN102104969A (en) Resource scheduling method and base station
CN101162969A (en) Method and apparatus for setting field data of scheduling information in a wireless communications system
CN1866906A (en) Priority processing method for medium access control layer of third generation mobile communication system
CN103476061A (en) UE and method of generating radio link control packet data unit by UE
CN101132352B (en) Method and system for implementing high-speed ascending grouping access characteristic
CN102469602B (en) Method for user multi-service dispatching
CN103001748B (en) A kind of method of data re-transmission and data retransmission process, equipment
CN1798446B (en) Method for transferring short signaling through Mac-ePDU
CN101179513B (en) Base station and method for determining service flux
CN102104916A (en) Data scheduling method and 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
CB03 Change of inventor or designer information

Inventor after: Li Fahui

Inventor after: Yan Xuejiang

Inventor after: Wang Hongpu

Inventor after: Gu Wenna

Inventor after: Huang Lei

Inventor after: Qi Aiguo

Inventor before: Li Ruifeng

CB03 Change of inventor or designer information
TR01 Transfer of patent right

Effective date of registration: 20170830

Address after: 300450 No. 124, Shanghai Road, Tanggu Binhai New Area, Tianjin

Co-patentee after: Yan Xuejiang

Patentee after: Li Fahui

Co-patentee after: Wang Hongpu

Co-patentee after: Gu Wenna

Co-patentee after: Huang Lei

Co-patentee after: Qi Aiguo

Address before: 518057 Nanshan District Guangdong high tech Industrial Park, South Road, science and technology, ZTE building, Ministry of Justice

Patentee before: ZTE Corporation

TR01 Transfer of patent right
CB03 Change of inventor or designer information

Inventor after: Jin Qing

Inventor after: Qiao Ruchun

Inventor after: Zhang Ali

Inventor after: Xu Hongjun

Inventor after: Shao Xishan

Inventor after: Meng Yanfang

Inventor after: Qi Aiguo

Inventor before: Li Fahui

Inventor before: Yan Xuejiang

Inventor before: Wang Hongpu

Inventor before: Gu Wenna

Inventor before: Huang Lei

Inventor before: Qi Aiguo

CB03 Change of inventor or designer information
TR01 Transfer of patent right

Effective date of registration: 20180103

Address after: 300450 No. 124, Shanghai Road, Tanggu Binhai New Area, Tianjin

Co-patentee after: Qiao Ruchun

Patentee after: Jin Qing

Co-patentee after: Zhang Ali

Co-patentee after: Xu Hongjun

Co-patentee after: Shao Xishan

Co-patentee after: Meng Yanfang

Co-patentee after: Qi Aiguo

Address before: 300450 No. 124, Shanghai Road, Tanggu Binhai New Area, Tianjin

Co-patentee before: Yan Xuejiang

Patentee before: Li Fahui

Co-patentee before: Wang Hongpu

Co-patentee before: Gu Wenna

Co-patentee before: Huang Lei

Co-patentee before: Qi Aiguo

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

Granted publication date: 20110713

Termination date: 20180327

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