CN100401665C - Method for judging reverse data packet byte loss - Google Patents
Method for judging reverse data packet byte loss Download PDFInfo
- Publication number
- CN100401665C CN100401665C CNB2006100057005A CN200610005700A CN100401665C CN 100401665 C CN100401665 C CN 100401665C CN B2006100057005 A CNB2006100057005 A CN B2006100057005A CN 200610005700 A CN200610005700 A CN 200610005700A CN 100401665 C CN100401665 C CN 100401665C
- Authority
- CN
- China
- Prior art keywords
- reverse data
- data bag
- current
- bag
- successful
- 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
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention discloses a method for judging the byte loss of a reverse data packet. The method has one realization way that the waiting time duration of the current reverse data packet with successful decoding is determined; moreover, whether reverse bytes transmitted before the bytes in the current reverse data packet is received in the waiting time duration is judged; if no byte is received, reverse byte loss occurs. The method has the other realization way that a packet caching queue is set, and the other realization way comprises: which comprises the procedures: the waiting time duration of the current reverse data packet with successful decoding is determined, and the reverse data packet is put into the packet caching queue; when the waiting time duration is reached, the reverse data packet with successful decoding and reverse data packets prior to the reverse data packet with successful decoding are selected from the packet caching queue to be used as sequenced reverse data packets; whether byte loss exists in the sequenced reverse data packets is judged, if true, reverse byte loss occurs. The phenomenon of wrongly determining orderless reverse data packets as reverse byte loss can be avoided by the technical scheme provided by the present invention.
Description
Technical field
The present invention relates to mobile communication technology, particularly relate to a kind of method of judging reverse data packet byte loss.
Background technology
(Code Division Multiple Access, CDMA) (Evolution Data Optimized EV-DO) has developed into Rev A version by initial Rev 0 version to the new types of data business of 2000 systems to code division multiple access.Fig. 1 has illustrated in EV-DO Rev A, the effect when receiving the reverse data bag of sending as the portable terminal of transmit leg as the base station of reciever.
In EV-DO Rev A, on portable terminal, the reverse data bag that each will send is divided into 4 son bags, and wherein first son wraps all effective informations and the partial redundance information of having carried former packet, and other 3 packets all carry the redundant information that helps decoding; Simultaneously, have three numbers of interweaving to be respectively 0,1,2 three and interweave, these three interweave and are used to send the child bag that adheres to three different reverse data bags separately.All son bags of a reverse data bag are by the identical interleaved transmission of the number of interweaving.Because portable terminal is very violent to the variation of the wireless channel between the base station, on the base station, for each packet, might receive that first son bag just can successfully decode, also might receive second, third, could decode successfully behind the 4th son bag, even finally all not decode successfully.If decode successfully after receiving the first son bag in the base station, so can by by the base station to the feed-forward transmission Nak of portable terminal to portable terminal, allow portable terminal send out second sub bag again; If decode successfully after receiving the first son bag in the base station, can send out Ack by feed-forward so and give portable terminal, portable terminal begins new packet of the first Zi Bao place interleaved transmission, and the rest may be inferred.In Fig. 1, reverse data bag A is 0 interleaved transmission by the number of interweaving, and just decode successfully at first son bag A0, the base station sends Ack to portable terminal by feed-forward, like this portable terminal next time the number of interweaving be 0 interleaved transmission be exactly first sub D0 of bag of reverse data bag D; 4 son bags B0, B1, B2 and the B3 of reverse data bag B, all be 1 interleaved transmission by the number of interweaving, in the 4th the son bag B3 success of just decoding, therefore after receiving B0, B1 and B2, the base station all can send Nak to portable terminal by feed-forward, and allow portable terminal then give a son bag; Reverse data bag C is 2 interleaved transmission by the number of interweaving, and just decode successfully at first son bag C0, the base station sends Ack to portable terminal by feed-forward, so next time the number of interweaving be 2 interleaved transmission be exactly that first son of reverse data bag E wraps E0, or the like.Adopt the method for this interleaved transmission, can realize the premature termination of reverse data bag, improved reverse data rate, but also make that the reverse data bag may the entanglement of appearance order simultaneously.For example in Fig. 1, at transmitting terminal, reverse data bag B began to send before reverse data bag C; But, just decode successfully because reverse data bag B wraps at the 4th son, and reverse data bag C just decodes successfully at first son bag, so C finishes decoding earlier than B at receiving terminal.
The decoding work of reverse data bag be by base station transceiver (Base Transceiver Station BTS) finishes, the reverse data bag that BTS finishes decoding be sent to base station controller (Base StationController, BSC).In the prior art, if above-mentioned reverse data bag C ratio inverse packet B finishes the situation of decoding earlier, radio link protocol on the BSC (Radio Link Protocol, RLP) module is when handling the byte of reverse data bag, what the byte that discovery reverse data bag A is comprised was closelyed follow later is the byte that reverse data bag C is comprised, then think the byte loss that reverse data bag B is comprised, the notice portable terminal is retransmitted reverse data bag B.In fact reverse data bag B just postpones to arrive, and will cause unnecessary reverse data bag to retransmit like this, influences the speed of reverse link communication.
Summary of the invention
In view of this, the method that provides a kind of reverse judgment data packet byte to lose is provided main purpose of the present invention, preventing that under the situation of out of order reverse data bag base station controller mistake from thinking byte loss in the reverse data bag, thereby avoid unnecessary reverse data bag to repeat to send.
In order to achieve the above object, the invention provides a kind of method of judging reverse data packet byte loss, first kind of implementation of this method comprises:
Step B1 judges within the wait duration that obtains in steps A 1, whether receives the reverse byte that sends before the byte in current reverse data bag, reverse byte loss takes place, the reverse byte of notice transmit leg retransmits lost if do not receive then think.
Wherein, the wait duration of the reverse data bag that steps A 1 described definite current decoding is successful comprises:
Steps A 11, the reverse data bag that base station transceiver is successful with current decoding, and current reverse data bag when decoding successfully the interweaving information of generation send base station controller to;
Steps A 12, base station controller judge whether current reverse data bag finishes in advance, if execution in step A13 then, otherwise think and wait for that duration is 0;
Steps A 13, the interweaving information that produces when base station controller is decoded successfully according to current reverse data bag is calculated the wait duration of current reverse data bag.
Wherein, the wait duration of the reverse data bag that steps A 1 described definite current decoding is successful comprises:
Steps A 21, base station transceiver judge whether current reverse data bag finishes in advance, if execution in step A22 then, otherwise think and wait for that duration is 0;
Steps A 22, the interweaving information that produces when base station transceiver is decoded successfully according to current reverse data bag is calculated the wait duration of current reverse data bag;
The reverse data bag that steps A 23, base station transceiver will be decoded successful, and the wait duration that calculates sends base station controller to.
Wherein, within the wait duration that the described judgement of step B1 obtains, whether receive that the reverse byte that sends before the byte in current reverse data bag finished by base station controller in steps A 1.
Second kind of execution mode of this method be, the bag buffer queue is set, and this method comprises:
Step B2 when the wait duration that obtains in steps A 2 arrives, will wrap in the buffer queue, and reverse data bag that decoding is successful in the steps A 2 and reverse data bag before thereof are selected, as sorted reverse data bag;
Step C2, whether in sorted reverse data bag have byte disappearance, reverse byte loss takes place, the reverse byte of notice transmit leg retransmits lost if then think if judging.
Wherein, steps A 2 is described puts into the bag buffer queue with the successful reverse data bag of current decoding and is:
According to the successful entrained frame number of reverse data bag of current decoding, judge the successful reverse data bag of current decoding, with existing reverse data bag in the bag buffer queue, the sequencing when sending is put into the bag buffer queue with the successful reverse data bag of current decoding then.
Wherein, the wait duration of the reverse data bag that steps A 2 described definite current decodings are successful comprises:
Steps A 31, the reverse data bag that base station transceiver is successful with current decoding, and current reverse data bag when decoding successfully the interweaving information of generation send base station controller to;
Steps A 32, base station controller judge whether current reverse data bag finishes in advance, if execution in step A33 then, otherwise think and wait for that duration is 0;
Steps A 33, the interweaving information that produces when base station controller is decoded successfully according to current reverse data bag is calculated the wait duration of current reverse data bag.
Wherein, the wait duration of the reverse data bag that steps A 2 described definite current decodings are successful comprises:
Steps A 41, base station transceiver judge whether current reverse data bag finishes in advance, if execution in step A42 then, otherwise think and wait for that duration is 0;
Steps A 42, the interweaving information that produces when base station transceiver is decoded successfully according to current reverse data bag is calculated the wait duration of current reverse data bag.
Wherein, steps A 2 is described puts into the bag buffer queue with the successful reverse data bag of current decoding, begins then for the successful reverse data bag timing of current decoding to be:
The reverse data bag that base station transceiver will be decoded successful, and the wait duration that calculates in the steps A 42 sends base station controller to, base station controller is put into the bag buffer queue with the successful reverse data bag of current decoding, begins to be the successful reverse data bag timing of current decoding then.
Wherein, steps A 2 is described puts into the bag buffer queue with the successful reverse data bag of current decoding, begins then for the successful reverse data bag timing of current decoding to be:
Base station transceiver begins to be the successful reverse data bag timing of current decoding then according to the successful reverse data bag of current decoding is put into the bag buffer queue;
Step B2 is described will to be wrapped in the buffer queue, in the steps A 2 the successful reverse data bag of decoding and before the reverse data bag select, as sorted reverse data bag be:
Base station transceiver will wrap in the buffer queue, in the steps A 2 the successful reverse data bag of decoding and before the reverse data bag select, send base station controller to as sorted reverse data bag.
Wherein, whether the described judgement of step C2 has the byte disappearance to be finished by base station controller in sorted reverse data bag.
Adopt technical scheme provided by the present invention, for out of order reverse data bag, at first calculate to wait for duration, only wait for that duration is just thought later on the byte loss that comprised in the reverse data bag takes place that has so just avoided mistake regards as reverse byte loss with out of order reverse data bag exceeding.Further, wait for that duration can be used for out of order reverse data packet sequencing, thereby accelerate the speed of subsequent treatment in the base station controller.Can finish by base station transceiver and calculate the work of waiting for duration and ordering, so just alleviated the calculating pressure of base station controller.
Description of drawings
Fig. 1 is the delivery plan of reverse data bag among the CDMA2000 EV-DO Rev A;
Fig. 2 is the flow chart that duration is waited in calculating provided by the invention;
Fig. 3 is the flow chart of judgement reverse data packet byte loss method embodiment one provided by the invention;
Fig. 4 is the flow chart of judgement reverse data packet byte loss method embodiment two provided by the invention.
Embodiment
Core concept of the present invention is, for out of order reverse data bag, at first calculates and waits for duration, according to waiting for that duration has judged whether to take place the byte loss in the packet.
For making the purpose, technical solutions and advantages of the present invention clearer, the present invention is described in further detail below in conjunction with drawings and the specific embodiments.
Please refer to Fig. 2, Fig. 2 is the flow chart that duration is waited in calculating provided by the invention.For the ease of understanding, and being without loss of generality, is example explanation computational process with reverse data bag C shown in Figure 1.According to Fig. 1, on directly perceived, reverse data bag C does not need to wait for reverse data bag A, but needs to wait for reverse data bag B.
Here, C0 is current son bag, and decoding successfully produces readjustment, starts the wait duration calculation flow process for reverse data bag C.
For current son bag C0, current son bag first son bag forward is son bag B0, and current son bag second son bag forward is son bag A0.
Described interweaving information comprises three data fields: the number of interweaving, sub-Bale No. and the state that interweaves.
The number of interweaving represents which this child bag is positioned at and interweaves, and its span is 0 to 2, interweaves because always have 3.In Fig. 1, son bag A0 is positioned at the number of interweaving 0, and son bag B0 is positioned at the number of interweaving 1, and son bag C0 is positioned at the number of interweaving 2.
Sub-Bale No. represents that this child bag is which height bag of place reverse data bag, and its span is 0 to 3, because for the base station as receiving terminal, a reverse data bag comprises 4 son bags at most.In Fig. 1, A0, B0 and C0 are the 0th son bags of the reverse data bag at place separately.
The state of this Zi Bao place reverse data bag of son bag state representation can be following these four values:
CRCPass, the reverse data bag is decoded successfully, and this reverse data bag is the current reverse data bag of separating numeral bag place;
CRCFail, the reverse data bag success of not decoding;
Invalid, the reverse data bag is decoded successfully, and this reverse data bag is not the current reverse data bag of separating numeral bag place; Perhaps this reverse data bag does not have data to send; Perhaps the 4th son bag decoding failure, and this reverse data bag is not the current reverse data bag of separating numeral bag place;
SubPacketFail, this child bag is invalid, can not be used for the decoding of place reverse data bag.
In Fig. 1, the child bag state value of son bag A0 is Invalid, and the child bag state value of son bag B0 is CRCFail, and the child bag state value of son bag C0 is CRCPass;
Need to prove, more than only provided four kinds of values of sub-bag state represented wait for the relevant meaning of duration with calculating.
Step 203 judges that whether current son wraps premature termination, if execution in step 204 then, otherwise execution in step 212.
Judge the current son method of premature termination whether of wrapping is to see whether the sub-Bale No. in the interweaving information of current son bag is 3, if be that 3 expressions do not have premature termination, if be not 3 expression premature terminations.
When current son bag was C0, the sub-Bale No. in the interweaving information of current son bag was 0, the expression premature termination.
Step 204 judges whether current Zi Bao place reverse data bag needs to wait for current son bag first Zi Bao place reverse data bag forward, if execution in step 205 then, otherwise execution in step 206.
Judge current Zi Bao place reverse data bag whether need to wait for current son bag forward first reverse method of son bag institute at packet be, if any one condition in following three conditions is set up, think that then current Zi Bao place reverse data bag does not need to wait for current son bag first Zi Bao place reverse data bag forward, otherwise think that current Zi Bao place reverse data bag need wait for current son bag first Zi Bao place reverse data bag forward.These three conditions are:
(1) the sub-Bale No. in the current son bag interweaving information is greater than the current son bag Bale No. in the interweaving information of first son bag forward;
(2) current son bag forward the child bag state in the interweaving information of first son bag be Invalid;
(3) current son bag forward the child bag state in the interweaving information of first son bag be SubPacketFail, and current son bag forward the sub-Bale No. in the interweaving information of first son bag be 3.
Current son wraps when being C0, and current son bag first son bag forward is B0, and above-mentioned three conditions are all satisfied, and the reverse data bag at therefore current son bag C0 place need wait for that current son wraps the reverse data bag at first son bag B0 place forward.
Step 205 is calculated current Zi Bao place reverse data bag and need be waited for the current son bag wait duration of first Zi Bao place reverse data bag forward, and execution in step 207 then.
The computational methods of waiting for duration are, at first with the number of interweaving in the interweaving information of current son bag, deduct the number of interweaving in the interweaving information of first son bag forward of current son bag, add 3, and the result of addition gained is got remainder after 3; Deduct the current son bag Bale No. in the interweaving information of first son bag forward with 3 then, the difference that obtains be multiply by 3, and the result with multiplication deducts the remainder that one step of front obtains, and the reverse data bag at current exactly Zi Bao place need be waited for the current son bag wait duration of the reverse data bag at first Zi Bao place forward.
According to above computational methods, the reverse data bag at son bag C0 place should wait for that the wait duration of the reverse data bag at son bag B0 place is 8, and unit is the son bag.
Step 207 judges whether current Zi Bao place reverse data bag needs to wait for current son bag second Zi Bao place reverse data bag forward, if execution in step 208 then, otherwise execution in step 209.
Judge current Zi Bao place reverse data bag whether need to wait for current son bag forward the method for second Zi Bao place reverse data bag be, if any one condition in following three conditions is set up, think that then current Zi Bao place reverse data bag does not need to wait for current son bag second Zi Bao place reverse data bag forward, otherwise think that current Zi Bao place reverse data bag need wait for current son bag second Zi Bao place reverse data bag forward.These three conditions are:
(1) the sub-Bale No. in the current son bag interweaving information is greater than the current son bag Bale No. in the interweaving information of second son bag forward;
(2) current son bag forward the child bag state in the interweaving information of second son bag be Invalid;
(3) current son bag forward the child bag state in the interweaving information of second son bag be SubPacketFail, and current son bag forward the sub-Bale No. in the interweaving information of second son bag be 3.
Current son wraps when being C0, and current son bag second son bag forward is A0, and (2) in above-mentioned three conditions are satisfied, and the reverse data bag at therefore current son bag C0 place does not need to wait for that current son wraps the reverse data bag at second son bag A0 place forward.
Step 208 is calculated current Zi Bao place reverse data bag and need be waited for the current son bag wait duration of second Zi Bao place reverse data bag forward, and execution in step 210 then.
The computational methods of waiting for duration are, at first with the number of interweaving in the interweaving information of current son bag, deduct the number of interweaving in the interweaving information of second son bag forward of current son bag, add 3, and the result of addition gained is got remainder after 3; Deduct the current son bag Bale No. in the interweaving information of second son bag forward with 3 then, the difference that obtains be multiply by 3, and the result with multiplication deducts the remainder that one step of front obtains, and the reverse data bag at current exactly Zi Bao place need be waited for the current son bag wait duration of the reverse data bag at second Zi Bao place forward.
Two of needing respectively to wait for of step 210, the reverse data bag of judging current Zi Bao place wait for whether durations are 0, if execution in step 212 then, otherwise execution in step 211.
Step 211 is waited for a bigger wait duration as current Zi Bao place reverse data bag in the durations for two that need respectively to wait for the reverse data bag at current Zi Bao place.
Because the reverse data bag C at current son bag C0 place need wait for the current son bag packet B at first son bag B0 place forward, and waits for that duration is 8; And the reverse data bag C at current son bag C0 place need wait for current son bag forward the wait duration of the packet A at second son bag A0 place be 0, the wait duration of the reverse data bag at therefore current son bag C0 place is 8.
Please refer to Fig. 3, Fig. 3 is the flow chart of judgement reverse data packet byte loss method embodiment one provided by the invention.
In mobile communication base station system, the reverse data bag decoded finish by BTS.In to the description of calculating the flow process of waiting for duration, mention, after BTS decodes successfully to the reverse data bag at current Zi Bao place, can obtain current son bag, current son bag first son bag and the current son bag interweaving information of second son bag forward forward, the reverse data bag that BTS decodes success, and three corresponding interweaving information all send BSC to.
Step 302 flow process that to be exactly step 201 carry out to step 212.
The RLP agreement be used for of resetting buffering area and be prior art is to the usefulness that sorts of the byte in the reverse data bag.Portable terminal can be the RLP sequence number of each byte allocation that is sent according to the RLP agreement, and the RLP sequence number increases progressively according to the sequencing that byte sends; BSC with the byte that the reverse data bag is comprised, puts into the rearrangement buffering area according to the RLP sequence number after receiving the reverse data bag.Have only continuous, that surpass the certain-length thresholding and enter one section byte of resetting buffering area the earliest and just can be admitted to the subsequent treatment module.
For example, suppose that length threshold is 20 bytes, resetting and having byte now in the buffering area is 6 successive bytes altogether of RLP sequence number from 30 to 35, because the length of successive byte surpasses length threshold, therefore can not send into the subsequent treatment module.Receiving first reverse data bag now, is 11 successive bytes of 40 to 50 comprising the RLP sequence number.According to the RLP sequence number put into reset buffering area after, the number of successive byte is not still above 20.If receive second reverse data bag again, comprising the RLP sequence number 4 successive bytes of 36 to 39.According to the RLP sequence number put into reset buffering area after, the RLP sequence number from 30 to 40 of successive byte, the number of successive byte is 21, has surpassed length threshold, then these 21 bytes is all sent to the subsequent treatment module.
Step 304 is judged and is reset whether the byte disappearance is arranged before the byte in the current reverse data bag in the buffering area, if having then execution in step 305, otherwise execution in step 308.
So-called byte disappearance, promptly step 303 for example in, receive the situation before second reverse data bag, the RLP sequence number is that 36 to 39 byte lacks byte exactly.
The effect of timer is that the byte disappearance might be caused by out of order reverse data bag, also might be that the reverse data packet loss causes.If cause, then in the wait duration that step 302 calculated, just should receive to comprise the reverse data bag that lacks byte by out of order reverse data bag.Do not receive also that if surpass this time then this reverse data wraps on the communication path from the portable terminal to the base station and loses, and needs portable terminal to resend this disappearance byte.
Step 311 is thought to require portable terminal to retransmit the disappearance byte by the fail reverse data bag at decoding disappearance byte place of BTS.
In embodiment one,, all finish by BSC from step 302 to step 311.In the mobile communication base station system of reality, a BSC often has a lot of BTS, and for the reverse data bag that each BTS sends, BSC will carry out the flow process of step 302 to step 311.So just taken the big energy-handling capability of BSC.On the other hand, BSC calculates and waits for that duration needs BTS to send interweaving information when transmitting current reverse data bag, and this can reduce the utilization ratio of interface between BTS and the BSC.For example, the interweaving information of three son bags is approximately 3 bytes, and at speech business (the Voice on Internet Protocol of internet protocol-based, VoIP) in, the length of a reverse data bag is 22 bytes, transmit interweaving information and make the interface utilance between BTS and the BSC reduce nearly 10%.
A kind of improvement as embodiment one, in the step 301, BTS can not send decoded reverse data bag and interweaving information to BSC earlier, but by BTS self execution in step 302, sends decoded reverse data bag and the wait duration that calculates to BSC together then.So just can improve the utilization ratio of interface between BTS and the BSC.Also shared simultaneously a part of amount of calculation of BSC.
But, can only carry out at BSC for the processing of byte in the reverse data bag, carry out with regard to making step 303 to be moved on among the BTS to step 311 like this.Like this, the amount of calculation of BSC is still very big, and transmits and wait for that duration still needs to take the resource of interface between BTS and the BSC.
Embodiments of the invention two can address this problem.Please refer to Fig. 4, Fig. 4 is the flow chart of judgement reverse data packet byte loss method embodiment two provided by the invention.
For to the reverse data packet sequencing, BTS is three and interweaves and respectively safeguard a timer that the initial value of each timer all is 0.(Frame SequenceNumber, FSN), expression starts the FSN of the Zi Bao place reverse data bag of this timer to the also corresponding separately startup frame number of each timer.FSN is the numbering of portable terminal in each allocation of packets of transmission reverse data Bao Shiwei, and FSN and packet are to concern one to one, and distributing FSN is according to the sequencing that sends packet.BTS also for safeguarding a reverse data bag buffer queue, is called for short the bag buffer queue, the ascending arrangement of reverse data bag FSN in the bag buffer queue.
Step 401, BTS receives the son bag.
Step 402, BTS judges whether to finish at current son bag the decoding of current Zi Bao place reverse data bag, if execution in step 410 then, otherwise execution in step 403.
Step 403 judges whether the timer that current Zi Bao place interweaves is 0, if execution in step 405 then, otherwise execution in step 404.
Step 404, execution in step 420.
Step 405 judges whether other two timers that interweave are not 0 except that the interweaving of current Zi Bao place, if execution in step 407 then; If except that the interweaving of current Zi Bao place, any one in other two timers that interweave is 0 execution in step 406.
Step 406 judges whether other two timers that interweave all are 0 except that the interweaving of current Zi Bao place, if execution in step 409 then; If except that the interweaving of current Zi Bao place, having and have only one in other two timers that interweave is 0 execution in step 408.
Step 407 judges that relatively the startup FSN of other two timers that interweave will wrap in the buffer queue except that the interweaving of current Zi Bao place, and the reverse data bag before the less pairing reverse data bag of startup FSN of value sends to BSC, execution in step 420.
Step 408 will be wrapped in the buffer queue, not be that the reverse data bag before the pairing reverse data bag of startup FSN of 0 timer sends to BSC, execution in step 420.
Step 409 all sends to BSC, execution in step 420 with the reverse data bag in the bag buffer queue.
Step 410, the timer zero clearing that current Zi Bao place is interweaved, and current son bag inserted the bag buffer queue according to the order of FSN.
Step 411, the current son that the BTS basis is obtained when successfully decoding the reverse data bag wraps, current sub first sub-bag and current sub second sub interweaving information of wrapping forward of wrapping forward of wrapping, calculate current Zi Bao place reverse data bag respectively and need wait for that the wait duration t1 and the current Zi Bao place reverse data bag of first son bag need be waited for the current son bag wait duration t2 of second son bag forward to current son bag forward.
Step 412 judges whether t1 and t2 are 0, if execution in step 414 then, if any one is not 0 then execution in step 413 among t1 and the t2.
Step 413 judges whether t1 is 0, is not 0 if then t2 is inevitable, execution in step 418, otherwise execution in step 415.
Step 414 is returned execution in step 405.
Step 415, judge current son bag forward the timer that interweaves of first Zi Bao place whether be 0, if execution in step 416 then, otherwise execution in step 417.
Step 416, with current son bag forward the value of the timer that interweaves of first Zi Bao place be made as the value of t1, and with current son bag forward the startup FSN of the timer that interweaves of first Zi Bao place be made as the FSN of current Zi Bao place packet.
Step 417 judges whether t2 is 0, if execution in step 420 then, otherwise execution in step 418.
Step 418, judge current son bag forward the timer that interweaves of second Zi Bao place whether be 0, if execution in step 419 then, otherwise execution in step 420.
Step 419, with current son bag forward the value of the timer that interweaves of second Zi Bao place be made as the value of t2, and with current son bag forward the startup FSN of the timer that interweaves of second Zi Bao place be made as the FSN of current Zi Bao place packet.
Step 420 subtracts 1 back with the timer that is not 0 and finishes current sub handling process of wrapping is prepared to handle next height bag.
Like this, the reverse data bag that is sent to BSC from BTS all is that shooting sequence according to transmitting terminal sequences.Though BSC still wants execution in step 303 to step 310, but because the reverse data bag all is through sorting, so BSC need not do any rearrangement buffered to the byte the reverse data bag that sends from BTS, has so just reduced the amount of calculation of BSC, calculates without BSC basically.Because BTS only need send packet itself to BSC, so just can further improve the utilization ratio of BTS and BSC interface again.Certainly, if consider, also the work that the reverse data bag is sorted can be put among the BSC fully and carry out based on other.In this case, described in step 407, step 408 and the step 409 the reverse data bag being sent to BSC then should be for sending to the subsequent treatment module with the reverse data bag from the bag buffer queue.
The above is preferred embodiment of the present invention only, is not to be used to limit protection scope of the present invention.Within the spirit and principles in the present invention all, any modification of being done, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (11)
1. a method of judging reverse data packet byte loss is characterized in that, this method comprises:
Steps A 1 is determined the wait duration of the reverse data bag that current decoding is successful, and whether the reverse byte that sends before the byte of judgement in current reverse data bag lack, if having then execution in step B1;
Step B1 judges within the wait duration that obtains in steps A 1, whether receives the reverse byte that sends before the byte in current reverse data bag, reverse byte loss takes place, the reverse byte of notice transmit leg retransmits lost if do not receive then think.
2. the method for judgement reverse data packet byte loss according to claim 1 is characterized in that, the wait duration of the reverse data bag that steps A 1 described definite current decoding is successful comprises:
Steps A 11, the reverse data bag that base station transceiver is successful with current decoding, and current reverse data bag when decoding successfully the interweaving information of generation send base station controller to;
Steps A 12, base station controller judge whether current reverse data bag finishes in advance, if execution in step A13 then, otherwise think and wait for that duration is 0;
Steps A 13, the interweaving information that produces when base station controller is decoded successfully according to current reverse data bag is calculated the wait duration of current reverse data bag.
3. the method for judgement reverse data packet byte loss according to claim 1 is characterized in that, the wait duration of the reverse data bag that steps A 1 described definite current decoding is successful comprises:
Steps A 21, base station transceiver judge whether current reverse data bag finishes in advance, if execution in step A22 then, otherwise think and wait for that duration is 0;
Steps A 22, the interweaving information that produces when base station transceiver is decoded successfully according to current reverse data bag is calculated the wait duration of current reverse data bag;
The reverse data bag that steps A 23, base station transceiver will be decoded successful, and the wait duration that calculates sends base station controller to.
4. according to the method for any described judgement reverse data packet byte loss of claim 1 to 3, it is characterized in that, within the wait duration that the described judgement of step B1 obtains, whether receive that the reverse byte that sends before the byte in current reverse data bag finished by base station controller in steps A 1.
5. a method of judging reverse data packet byte loss is characterized in that, the bag buffer queue is set, and this method comprises:
Steps A 2 is determined the wait duration of the reverse data bag that current decoding is successful, and the successful reverse data bag of current decoding is put into the bag buffer queue, and beginning then is the current successful reverse data bag timing of decoding;
Step B2 when the wait duration that obtains in steps A 2 arrives, will wrap in the buffer queue, and reverse data bag that decoding is successful in the steps A 2 and reverse data bag before thereof are selected, as sorted reverse data bag;
Step C2, whether in sorted reverse data bag have byte disappearance, reverse byte loss takes place, the reverse byte of notice transmit leg retransmits lost if then think if judging.
6. the method for judgement reverse data packet byte loss according to claim 5 is characterized in that, steps A 2. is described to be put into the bag buffer queue with the successful reverse data bag of current decoding and be:
According to the successful entrained frame number of reverse data bag of current decoding, judge the successful reverse data bag of current decoding, with existing reverse data bag in the bag buffer queue, the sequencing when sending is put into the bag buffer queue with the successful reverse data bag of current decoding then.
7. the method for judgement reverse data packet byte loss according to claim 5 is characterized in that, the wait duration of the reverse data bag that steps A 2 described definite current decodings are successful comprises:
Steps A 31, the reverse data bag that base station transceiver is successful with current decoding, and current reverse data bag when decoding successfully the interweaving information of generation send base station controller to;
Steps A 32, base station controller judge whether current reverse data bag finishes in advance, if execution in step A33 then, otherwise think and wait for that duration is 0;
Steps A 33, the interweaving information that produces when base station controller is decoded successfully according to current reverse data bag is calculated the wait duration of current reverse data bag.
8. the method for judgement reverse data packet byte loss according to claim 5 is characterized in that, the wait duration of the reverse data bag that steps A 2 described definite current decodings are successful comprises:
Steps A 41, base station transceiver judge whether current reverse data bag finishes in advance, if execution in step A42 then, otherwise think and wait for that duration is 0;
Steps A 42, the interweaving information that produces when base station transceiver is decoded successfully according to current reverse data bag is calculated the wait duration of current reverse data bag.
9. the method for judgement reverse data packet byte loss according to claim 8 is characterized in that, steps A 2 is described puts into the bag buffer queue with the successful reverse data bag of current decoding, begins then for the successful reverse data bag timing of current decoding to be:
The reverse data bag that base station transceiver will be decoded successful, and the wait duration that calculates in the steps A 42 sends base station controller to, base station controller is put into the bag buffer queue with the successful reverse data bag of current decoding, begins to be the successful reverse data bag timing of current decoding then.
10. the method for judgement reverse data packet byte loss according to claim 8 is characterized in that, steps A 2 is described puts into the bag buffer queue with the successful reverse data bag of current decoding, begins then for the successful reverse data bag timing of current decoding to be:
Base station transceiver begins to be the successful reverse data bag timing of current decoding then according to the successful reverse data bag of current decoding is put into the bag buffer queue;
Step B2 is described will to be wrapped in the buffer queue, in the steps A 2 the successful reverse data bag of decoding and before the reverse data bag select, as sorted reverse data bag be:
Base station transceiver will wrap in the buffer queue, in the steps A 2 the successful reverse data bag of decoding and before the reverse data bag select, send base station controller to as sorted reverse data bag.
11. the method according to any described judgement reverse data packet byte loss of claim 5 to 10 is characterized in that, whether the described judgement of step C2 has the byte disappearance to be finished by base station controller in sorted reverse data bag.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100057005A CN100401665C (en) | 2006-01-19 | 2006-01-19 | Method for judging reverse data packet byte loss |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100057005A CN100401665C (en) | 2006-01-19 | 2006-01-19 | Method for judging reverse data packet byte loss |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1859072A CN1859072A (en) | 2006-11-08 |
| CN100401665C true CN100401665C (en) | 2008-07-09 |
Family
ID=37297939
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2006100057005A Expired - Fee Related CN100401665C (en) | 2006-01-19 | 2006-01-19 | Method for judging reverse data packet byte loss |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100401665C (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110958084B (en) | 2018-09-27 | 2021-12-14 | 华为技术有限公司 | Method and communication equipment for transmitting acknowledgement message |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020045449A1 (en) * | 2000-10-02 | 2002-04-18 | Mamiko Oobayashi | Mobile communication terminal apparatus, control circuit, and handoff control method |
| US20020167926A1 (en) * | 2001-05-14 | 2002-11-14 | Samsung Electronics Co., Ltd. | Apparatus and method for controlling packet data transmission between BSC and BTS |
| US20030086427A1 (en) * | 2001-11-08 | 2003-05-08 | Samsung Electronics Co., Ltd. | Method and apparatus for retransmitting packet data between base station controller and base transceiver system in a mobile communication system |
| GB2396998A (en) * | 2003-01-06 | 2004-07-07 | Roke Manor Research | Handover method for packet streaming data |
| CN1551552A (en) * | 2003-05-10 | 2004-12-01 | Lg电子株式会社 | Method for transmitting control signal for reverse chain packet transmission |
-
2006
- 2006-01-19 CN CNB2006100057005A patent/CN100401665C/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020045449A1 (en) * | 2000-10-02 | 2002-04-18 | Mamiko Oobayashi | Mobile communication terminal apparatus, control circuit, and handoff control method |
| US20020167926A1 (en) * | 2001-05-14 | 2002-11-14 | Samsung Electronics Co., Ltd. | Apparatus and method for controlling packet data transmission between BSC and BTS |
| US20030086427A1 (en) * | 2001-11-08 | 2003-05-08 | Samsung Electronics Co., Ltd. | Method and apparatus for retransmitting packet data between base station controller and base transceiver system in a mobile communication system |
| GB2396998A (en) * | 2003-01-06 | 2004-07-07 | Roke Manor Research | Handover method for packet streaming data |
| CN1551552A (en) * | 2003-05-10 | 2004-12-01 | Lg电子株式会社 | Method for transmitting control signal for reverse chain packet transmission |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1859072A (en) | 2006-11-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8402343B2 (en) | Reliable packet cut-through | |
| AU765553B2 (en) | An apparatus and method for transmitting and receiving data according to radio link protocol in a mobile communications system | |
| EP1871031B1 (en) | Retransmission control method and device | |
| CN104104479B (en) | The method and apparatus for sending/receiving data via wireless network and wireless device | |
| CA2466231A1 (en) | Time-aware best-effort hole-filling retry method and system for network communications | |
| US20030086427A1 (en) | Method and apparatus for retransmitting packet data between base station controller and base transceiver system in a mobile communication system | |
| CA2601637A1 (en) | Method and apparatus for improving data transmission reliability in a wireless communications system | |
| JP2007089177A (en) | Method and apparatus for improving transmission rate of state report signal in radio communication system | |
| JP2002135233A (en) | Method and apparatus for asynchronous incremental redundancy reception in communication system | |
| JP2003514486A (en) | Method and apparatus for multi-channel stop and wait ARQ communication | |
| CN107342848A (en) | A kind of adaptive code stream transmission method, device and equipment | |
| JP2007318759A (en) | Method and device for processing packet data in wireless communication system | |
| CN111770428A (en) | Monitoring method of wireless equipment | |
| JP5085821B2 (en) | Method for transmitting information in a communication system using ARQ with IR function | |
| CN101686556B (en) | Method, device and system of resource release | |
| CN104113722A (en) | Wireless video conference transmission method | |
| CN110618900B (en) | UART data transmission method | |
| CN100401665C (en) | Method for judging reverse data packet byte loss | |
| CN101068372A (en) | Method and apparatus of handling a variable of a rlc reset procedure | |
| CN101631074B (en) | Multilink message sending method, device and network equipment | |
| CN102201901A (en) | Data retransmission method and device | |
| CN113541874A (en) | Data transmission method and network equipment | |
| CN100372278C (en) | A data unit retransmission method | |
| TWI486030B (en) | Method and apparatus for polling transmission status in a wireless communications system | |
| CN116963175A (en) | Data transmission method, device 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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20080709 Termination date: 20150119 |
|
| EXPY | Termination of patent right or utility model |