CN100544245C - A kind of retransfer scheduling method of the HARQ agreement based on number of retransmissions - Google Patents
A kind of retransfer scheduling method of the HARQ agreement based on number of retransmissions Download PDFInfo
- Publication number
- CN100544245C CN100544245C CNB2006100113185A CN200610011318A CN100544245C CN 100544245 C CN100544245 C CN 100544245C CN B2006100113185 A CNB2006100113185 A CN B2006100113185A CN 200610011318 A CN200610011318 A CN 200610011318A CN 100544245 C CN100544245 C CN 100544245C
- Authority
- CN
- China
- Prior art keywords
- packet
- retransmissions
- priority
- retransmission
- retransmission queue
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Communication Control (AREA)
Abstract
The invention discloses a kind of retransfer scheduling method of the HARQ agreement based on number of retransmissions, its characteristics are, comprising: the maximum retransmission that packet is set is M, N the retransmission queue that priority progressively descends is set, and N is less than or equal to M; If the actual number of retransmissions m of packet then abandons this packet greater than M; If m less than N, then is inserted into this packet the retransmission queue of respective priority; If m is greater than N and less than M, then this packet is inserted into the retransmission queue of lowest priority, thereby by number of retransmissions channel condition is reflected on the dispatching priority of packet, thereby makes the variation of the better adaptive channel condition of scheduling of packet, improve the throughput of system.
Description
Technical field
The present invention relates to the broadband wireless access field, be applicable to the retransfer scheduling of the HARQ packet in the BWA.
Background technology
HARQ (Hybrid Automatic Repeat Request mixes automatic repeat requests) as the physical layer key technology that next generation mobile communication (back 3G) generally adopts, more and more is subjected to people's attention.FEC (Forward Error Code, forward error correction coding) utilizes the error correcting code in the system automatically to find and correct the mistake that occurs in the transmission at receiving terminal, need not feedback channel, so efficiency of transmission height, real-time are good.But along with the raising of error correcting capability, coding and decoding equipment is too complicated.And ARQ (Automatic Repeat Request, automatic repeat requests) then be the technology that a kind of error detection is retransmitted, in case find wrong (utilizing the error detection code in the system) at receiving terminal, just retransmit this information code element through feedback channel notice transmitting terminal immediately, till receiving terminal acknowledges receipt of correct message, the advantage of the method is: the error correcting capability of system is extremely strong, and adaptability is good, and is irrelevant substantially with the variation of channel disturbance.But shortcoming is a requirement feedback channel again, and transmitting-receiving two-end is unified in complicated control system, and continuity, the real-time of communication are relatively poor.Consideration combines FEC and ARQ and has just formed HARQ.The check bit that in each packet that sends, contains error correction and error detection.If receive and to make mistakes bit number within error correcting capability in the bag, then wrongly corrected voluntarily; When mistake is serious, when having exceeded the error correcting capability of FEC, then allow the repeating transmission of making a start.The HARQ variation of adaptive channel condition automatically and insensitive to measure error and time delay.
Because HARQ has the advantage of above-mentioned quick re-transmission, therefore not only can be applied to non-real-time service in theory, also can be applicable to real time business.But in the application of reality, real time business and non-real-time service exist aspect requiring obviously different in time delay, shake, thereby maximum retransmission, the feedback delay of HARQ had corresponding different requirement.Real time business generally has strict time delay, shake requirement, but often mistake is had certain tolerance, so require the maximum retransmission can only be for once, feedback delay be shorter; And non-real-time service does not generally have strict requirement to time delay/shake, but often relatively responsive to mistake, thus require maximum retransmission more, and feedback delay does not have strict restriction.
For real time business, because maximum retransmission for once, as long as it is just enough therefore a retransmission queue to be set, packet is dispatched successively by the rule of first in first out (FIFO).For non-real-time service, because maximum retransmission can flexible configuration (more than or equal to 1), the different packet of number of retransmissions often needs to be sub-divided into different dispatching priorities, how to realize this segmentation the present invention's problem that will solve just.
Summary of the invention
Technical problem to be solved by this invention provides a kind of retransfer scheduling method of the HARQ agreement based on number of retransmissions, and solving prior art can not segment the different packet of number of retransmissions, can not take into account the technical problem of efficiency of transmission and fairness.
For achieving the above object, the invention provides a kind of retransfer scheduling method of the HARQ agreement based on number of retransmissions, its characteristics are, comprise: the maximum retransmission that packet is set is M, N the retransmission queue that priority progressively descends is set, the actual number of retransmissions that packet is set is m, and N is less than or equal to M, and M, N, m are the natural number more than or equal to 1; If m greater than M, then abandons this packet; If m is less than or equal to N, then this packet is inserted into the retransmission queue of respective priority; If m is greater than N and be less than or equal to M, then this packet is inserted into the retransmission queue of lowest priority, thereby channel condition is reflected on the dispatching priority of packet by number of retransmissions, improve the throughput of system.
Above-mentioned method, its characteristics are that described number of retransmissions is the reception number of times of packet " negative response ".
Above-mentioned method, its characteristics are, further comprise the steps:
Step 1 pre-sets N retransmission queue: Q
1, Q
2..., Q
N, difference corresponding priority: p
1, p
2..., p
N
Step 2, the reception number of times m according to packet reception " negative response ", carry out following processing: if m 〉=M+1, expression has arrived maximum retransmission, then direct packet discard; If m≤N, then the descriptor of packet being inserted into priority is p
mRetransmission queue Q
mIf N＜m≤M, then the descriptor insertion priority with packet is p
NRetransmission queue Q
N
Step 3, scheduler be from high to low order each retransmission queue of poll successively according to priority, and polling sequence is Q
1, Q
2..., Q
N
Step 4 extracts the descriptor of packet from the retransmission queue that is polled to by the order of first in first out.
Above-mentioned method, its characteristics are that described descriptor is the address of packet.
Above-mentioned method, its characteristics are that described descriptor is the pointer of packet.
Above-mentioned method, its characteristics are, also comprise in the described step 4: in described polling procedure, after the finishing scheduling of a formation, continue the scheduling of next formation, the packet that exhausts or do not need to retransmit until the bandwidth resources of distributing.
Above-mentioned method, its characteristics are, under the very big situation of maximum retransmission M, when the number of retransmissions of packet surpasses certain limit, these packets have not had significant different priorities feature, the number N of retransmission queue is set to less than M, thereby the packet that the scope of number of retransmissions surpasses N is belonged to same retransmission queue.
Technique effect of the present invention is:
The present invention proposes a kind of HARQ packet retransfer scheduling strategy of taking into account efficiency of retransmission and fairness, channel condition is reflected on the dispatching priority of packet by number of retransmissions, thereby the variation of the better adaptive channel condition of the scheduling that makes packet has improved the throughput of system.
Further describe specific embodiments of the invention below in conjunction with accompanying drawing.
Description of drawings
Fig. 1 is the flow chart of steps of the inventive method;
Fig. 2 is the retransmission packet scheduling schematic diagram that the present invention has 4 retransmission queues.
Embodiment
The present invention has proposed a kind of HARQ packet retransfer scheduling strategy of taking into account efficiency of retransmission and fairness, its remarkable advantage is: channel condition is reflected to the method on the dispatching priority of packet by number of retransmissions, thereby the variation of the better adaptive channel condition of the scheduling that makes packet has improved the throughput of system.
The inventive method is as follows: it is M (〉=1) that maximum retransmission is set, and the retransmission queue number is N (〉=1), and satisfies N≤M.The priority list of retransmission queue is shown p
1, p
2, Λ, p
N, and from p
1To p
NPriority progressively descends.Retransmission queue is preserved the descriptor of packet, and descriptor can be the address of packet or the pointer that points to packet, and this depends on implementation strategy.In the HARQ agreement, the number of retransmissions of a packet promptly is that this packet receives that the number of times of NAK (Negative Acknowlegment, negative response) subtracts one, and therefore argumentation all embodies number of retransmissions with the reception number of times of NAK below.
Fig. 1 is the flow chart of steps of the inventive method, and the method that the present invention proposes mainly may further comprise the steps:
Whether each packet of step 402 inquiry receives NAK, for the packet of receiving NAK, adds up the reception number of times m of its NAK.Judge NAK receives number of times, should be inserted in decision for which retransmission queue.Basis for estimation is as follows: if m 〉=M+1, expression has arrived maximum retransmission, then direct packet discard; If m≤N, then the descriptor of packet being inserted into priority is p
mRetransmission queue Q
mIf N＜m≤M, then the descriptor insertion priority with packet is P
NRetransmission queue Q
N
Implementation step is described as follows:
Require N≤M in step 401 and the step 402, that is to say, under the very big situation of maximum retransmission M, the number N of retransmission queue should be less than M.This mainly is to consider that these packets have not had significant different priorities feature when the number of retransmissions of packet surpasses certain limit, therefore belongs to same retransmission queue.
In the step 402, descriptor with packet of identical number of retransmissions inserts in the same retransmission queue according to the time order and function order, when the purpose of doing like this is to make full use of number of retransmissions information, consider the sequencing that packet sends again, taken into account efficiency of transmission and fairness.So-called " efficient " is meant because the more packet of number of retransmissions often is in relatively poor channel circumstance, (can predict its channel condition continues abominable), the success rate of Chong Chuaning is lower next time, therefore put it in the lower retransmission queue of priority ratio, give channel condition packet preferably with transmission opportunity, and for the less packet of number of retransmissions, though can't predict its channel condition, but channel condition possibility is preferably arranged at least, therefore can put it in the higher retransmission queue of priority tactfully, so just can utilize channel preferably, thereby improve the availability of frequency spectrum.So-called " fairness " has two-layer connotation, and one is meant under identical number of retransmissions situation, receives that earlier the packet of NAK obtains scheduling earlier; Two and be meant that the few packet of number of retransmissions deserves redress, promptly give the chance of prioritised transmission.
In step 403 and the step 404, scheduler is from the highest retransmission queue Q of priority
1Begin scheduling, and the order of press FIFO takes out therefrom successively and need the packet descriptor that sends, this queue scheduling continues the scheduling of next formation after finishing, the packet that exhausts or do not need to retransmit until the bandwidth resources of distribution.
Fig. 2 is the retransmission packet scheduling schematic diagram that the present invention has 4 retransmission queues, and four formations 101,102,103,104 are arranged among the figure, by scheduler 201 they is dispatched in the output link 301.Maximum retransmission M=4 (maximum retransmission can according to the real system flexible configuration) wherein, the number N=M=4 of retransmission queue.
Provide the detailed process of specific embodiment among Fig. 2 below:
1) the retransmission queue Q of 4 different priorities is set
1, Q
2, Q
3, Q
4, the corresponding p of difference
1, p
2, p
3, p
4Priority;
2) inquire about each packet and whether receive NAK,, add up the reception number of times m of its NAK for the packet of receiving NAK.Judge NAK receives number of times, should be inserted in decision for which retransmission queue.Basis for estimation is as follows: if m 〉=5, expression has arrived maximum retransmission, then direct packet discard; If m≤4, then the descriptor of packet being inserted into priority is p
mRetransmission queue Q
m
3) scheduler from high to low order each retransmission queue of poll successively according to priority, polling sequence is Q
1, Q
2, Q
3, Q
4
4) from the retransmission queue that is polled to, extract the descriptor of packet by the order of first in first out (FIFO);
As from the foregoing, the present invention has taken all factors into consideration number of retransmissions and transmission time order, and packet is joined the team to has the retransmission queue of different dispatching priorities.Design of the present invention is reflected to channel condition on the dispatching priority of packet by number of retransmissions, thereby makes the variation of the better adaptive channel condition of scheduling of packet, improves the data throughout of system.
What provide above only is an exemplary embodiments of the present invention, and also there are other many obvious variation in the method for the invention, so the above is preferred embodiment of the present invention only, is not to be used for limiting practical range of the present invention; Every according to equivalence variation and modification that the present invention did, all contained by claim of the present invention.
Claims (7)
1, a kind of retransfer scheduling method of the HARQ agreement based on number of retransmissions, it is characterized in that, comprise: the maximum retransmission that packet is set is M, N the retransmission queue that priority progressively descends is set, the actual number of retransmissions that packet is set is m, and N is less than or equal to M, and M, N and m are the natural number more than or equal to 1; If m greater than M, then abandons this packet; If m is less than or equal to N, then this packet is inserted into the retransmission queue of respective priority; If m is greater than N and be less than or equal to M, then this packet is inserted into the retransmission queue of lowest priority, thereby channel condition is reflected on the dispatching priority of packet by number of retransmissions, improve the throughput of system.
2, method according to claim 1 is characterized in that, described number of retransmissions is the reception number of times of packet " negative response ".
3, method according to claim 2 is characterized in that, further comprises the steps:
Step 1 pre-sets N retransmission queue: Q
1, Q
2..., Q
N, difference corresponding priority: p
1, p
2..., p
N
Step 2, the reception number of times m according to packet reception " negative response ", carry out following processing: if m 〉=M+1, expression has arrived maximum retransmission, then direct packet discard; If m≤N, then the descriptor of packet being inserted into priority is p
mRetransmission queue Q
mIf N＜m≤M, then the descriptor insertion priority with packet is P
NRetransmission queue Q
N
Step 3, scheduler be from high to low order each retransmission queue of poll successively according to priority, and polling sequence is Q
1, Q
2..., Q
N
Step 4 extracts the descriptor of packet from the retransmission queue that is polled to by the order of first in first out.
4, method according to claim 3 is characterized in that, described descriptor is the address of packet.
5, method according to claim 3 is characterized in that, described descriptor is the pointer of packet.
6, method according to claim 3, it is characterized in that, also comprise in the described step 4: in described polling procedure, after the finishing scheduling of a formation, continue the scheduling of next formation, the packet that exhausts or do not need to retransmit until the bandwidth resources of distributing.
7, method according to claim 3, it is characterized in that, under the very big situation of maximum retransmission M, when the number of retransmissions of packet surpasses certain limit, these packets have not had significant different priorities feature, the number N of retransmission queue is set to less than M, thereby the packet that the scope of number of retransmissions surpasses N is belonged to same retransmission queue.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100113185A CN100544245C (en) | 2006-02-10 | 2006-02-10 | A kind of retransfer scheduling method of the HARQ agreement based on number of retransmissions |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100113185A CN100544245C (en) | 2006-02-10 | 2006-02-10 | A kind of retransfer scheduling method of the HARQ agreement based on number of retransmissions |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101018110A CN101018110A (en) | 2007-08-15 |
| CN100544245C true CN100544245C (en) | 2009-09-23 |
Family
ID=38726887
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2006100113185A Expired - Fee Related CN100544245C (en) | 2006-02-10 | 2006-02-10 | A kind of retransfer scheduling method of the HARQ agreement based on number of retransmissions |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100544245C (en) |
Families Citing this family (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101494530B (en) * | 2008-01-21 | 2012-10-10 | 中兴通讯股份有限公司 | Method for distributing and using mixing automatic retransmission request data outburst buffer zone |
| CN101686196B (en) * | 2008-09-26 | 2012-04-25 | 电信科学技术研究院 | Service scheduling method and service scheduling device |
| WO2010048747A1 (en) * | 2008-10-31 | 2010-05-06 | 上海贝尔股份有限公司 | A method for receiving feedback in multi-channel harq, and an apparatus and equipment thereof |
| CN101854588B (en) * | 2009-04-01 | 2013-11-06 | 中兴通讯股份有限公司 | Data retransmission method and device in enhanced multimedia broadcast and multicast service |
| CN101908953A (en) * | 2009-06-02 | 2010-12-08 | 中兴通讯股份有限公司 | Method and device for dispatching retransmission data |
| CN102790667B (en) * | 2011-05-18 | 2016-08-03 | 中兴通讯股份有限公司 | A kind of method processing re-transmission data and base station |
| CN102790668B (en) * | 2011-05-18 | 2016-08-03 | 中兴通讯股份有限公司 | A kind of method processing re-transmission data and base station |
| CN103138899A (en) * | 2011-11-28 | 2013-06-05 | 中兴通讯股份有限公司 | Retransmission method and retransmission device for communication packs in communication link layer |
| US9836325B2 (en) * | 2012-05-21 | 2017-12-05 | Nvidia Corporation | Resource management subsystem that maintains fairness and order |
| CN105072508A (en) * | 2015-08-12 | 2015-11-18 | 苏州华启智能科技有限公司 | System and method for making up packets for multimedia playing of wireless network |
| CN107094160B (en) * | 2016-02-18 | 2020-07-14 | 北大方正集团有限公司 | Method and system for downloading data file |
| CN108418659A (en) * | 2017-02-10 | 2018-08-17 | 中兴通讯股份有限公司 | A kind of data transmission method, device and relevant device |
| CN108390764B (en) * | 2018-01-02 | 2020-07-31 | 东南大学 | Broadcast content repacking method and system for broadcast storage network |
| CN109905479B (en) * | 2019-03-04 | 2022-06-07 | 腾讯科技（深圳）有限公司 | File transmission method and device |
| CN111988240B (en) * | 2020-07-27 | 2024-03-29 | 北京北方华创微电子装备有限公司 | Data transmission method and device, electronic equipment and storage medium |
-
2006
- 2006-02-10 CN CNB2006100113185A patent/CN100544245C/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN101018110A (en) | 2007-08-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100544245C (en) | A kind of retransfer scheduling method of the HARQ agreement based on number of retransmissions | |
| CN1290286C (en) | Automatic repeat request protocol | |
| CN101911569B (en) | Method and device for operating wireless communication device | |
| CN101878612B (en) | Method and system for data transmission in a data network | |
| CN103580773A (en) | Method and device for transmitting data frame | |
| KR20020042438A (en) | Hybrid ARQ with parallel packet transmission | |
| CN108418659A (en) | A kind of data transmission method, device and relevant device | |
| CN101099325A (en) | Methods and media access controller for broadband wireless communications with variable data unit size and delayed data unit construction | |
| CN101346925A (en) | Apparatus, method and computer program product providing retransmission utilizing multiple ARQ mechanisms | |
| CA2466231A1 (en) | Time-aware best-effort hole-filling retry method and system for network communications | |
| CN102497248B (en) | Data retransmission method based on network coding | |
| CN101267388B (en) | A dispatching method and device based on mixed automatic request retransfer | |
| CN101079814A (en) | Method and apparatus for handling packet data in a wireless communications system | |
| CN101330465B (en) | Method for allocating resources in a mobile radio communication network, and the corresponding transmitter and receiver | |
| CN102208962B (en) | Wireless data transmission method | |
| CN102077671A (en) | Packet transmission device and packet transmission method | |
| US20060114936A1 (en) | Enhanced processing methods for wireless base stations | |
| CN109152071A (en) | Data transmission instruction and data transmission method, base station, terminal and storage medium | |
| EP1776797A1 (en) | Packet-based data processing technique and transmission | |
| EP1833182B1 (en) | Communication control method, wireless communication system, and wireless communication device | |
| CN102106176A (en) | Signal transmission method and apparatus for user equipment in mobile communication system | |
| CN101908953A (en) | Method and device for dispatching retransmission data | |
| CN101964703A (en) | Data retransmission method and system | |
| CN104184568A (en) | Data transmission method and system of communication system | |
| CN101888668A (en) | Method for shortening time delay in Mesh 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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20090923 Termination date: 20150210 |
|
| EXPY | Termination of patent right or utility model |