WO2010145163A1 - Processing method and system for acknowledgement imformation based on the rlc protocol acknowledged mode - Google Patents

Abstract

A processing method and system for acknowledgement information based on the Radio Link Control (RLC) protocol Acknowledged Mode (AM) are provided by the invention, which can save the storage resource and the transmission resource, and improve the service quality. The method includes: (a), a sending end Acknowledged Mode Radio Link Control (AM RLC) entity receives acknowledgement information sent by a receiving end AM RLC entity, the acknowledgement information is the acknowledgement information returned by the receiving end AM RLC entity for the Acknowledged Mode Data Protocol Data Unit (AMD PDU) sent by the sending end AM RLC entity; and (b), the sending end AM RLC entity judges whether there exists a successfully transmitted Radio Link Control Service Data Unit (RLC SDU) according to the acknowledgement information, if yes, reports a transmission success message about the successfully transmitted RLC SDU to the upper layer; or else, does not report.

Description

 Information method and system for information in R C mode

Wood field

 This is a third-generation communication long-term (o gTemEvo o , T ) wood, especially related to the control method ( ado Co o, C) mode information method and system.

Background

 The C-type C-received transparent mode (T sp e ode, T ) RC H, non-mode ( ack owedge ode) RC Hugh and mode (Ack owedge ode, A ) RC H, the ARC break includes ARC Hugh part and ARC Hugh receiving part, in

 The receiving part of A R C Hugh is mainly received, that is, the acke aCo vege ce ooco (CP) element controls each ram ( ado Co o Se Vce a , ), received

 , the special or multi-mode teaching sheep ( ck owedged ode aa ooco aa A ), and then the part of the low, that is, the control ( edaAccessCo o, AC) of the privileged P to receive the ARC Low, that is, the AC receives the P of the ARC, and then moves it to the upper part, that is, P CP .

In general, ARC Hugh ( ck owedgeme sae Va abe) VTA) and maximum ( axm m Se d Sae Va abe ) VT ) ( sm gw do ), which, VTA) are below, and their values indicate not in P , the sequence (Seq e ce mbe , S ) the smallest P, that is, before the VTA), the P has been successfully VT) is the window, its VTA) + length. In addition, ARC Close (Se d Sae v north) VT) in operation, its force distribution of the required P

 R C is within the P, that is, if P is satisfied, then VTA) VT )

 P, possessing a new P needs to be sent to the low, new need to be sent to the lower P VT), and VT) to indicate the lower assignable

 Receiving R C Hugh R C Retirement Receiving

P information, so that R C information, and the order of the line and the regular, receive R C

 The information of the R C retreat can be the information of the P, or the information of the multi-P, that is, the P-return information that can be successfully received by receiving R C, or the P-return information with more success. 1 Existing wood, R C Hugh received information processing method, 1 shown, existing wood, R C Hugh received information Contains steps

 Step 11 R C Receive Receive Receive R C information.

 Information in the successful P

 Step 12 Does the information contain the window?

P, if yes, go to step 13 otherwise, go to step 14.

 If there is a window under the same P in the information, then the information contains the lower P of the window; otherwise, the information does not contain the lower P of the window.

 Step 13 Information update of P and phase

, to the lower and upper phase of the phase window of step 15, that is, VTA) and VT) receive a P equal to VTA), RC Update VTA) In the P, the smallest P, due to the value of the length, therefore, VT) is also the same. Same, in, see VTA), before, can be new P

 Step 14 Information update of the P, process.

 P's "no", this step is updated with the information in the P.

 Step 15 Is there a successful C S , and if so, go to Step 16 Otherwise, the process.

 If all the Ps of the fruit phase indicate that R C S has succeeded, the phase of C S P , the C S of the A Hugh will be more or more P

 storage.

 Step 16 A R C Hugh Up to Success

Success message.

 It can be seen that in the existing wood, if the ARC is successful, only the P that is equal to VTA) is successfully passed, and the CS of the phase P is greater than VTA, even if it has been successful. , can’t immediately go up

 The success message, but also the successful message execution and other operations, even the successful CS to receive ARC, for example, in the reconstruction of P CP, possible, so the existing rationale is easy to cause storage resources and The wave of resources, and each (Qo) household.

Content

 In this case, the method and system for providing information in the C mode, storage resources and resources, are improved.

This wood plan is This method of providing information for controlling the RC mode, including

 a, mode control R C Hugh Receive and Receive R C Hugh Information, Information Receive R C Hugh

 The information of R C Hugh’s mode to teach the sheep P and

 b, C Hugh information Whether there is a successful meta-control of each teacher R, is, the success message of the top up to the successful R, otherwise, do not.

 In the above method, in the step b of storing the R C H, the R C information is present. The successful R C S step includes the information received by the R C H. The P is updated, and the updated P is present. Successful R CS

 In addition, in the above method, the information with the successful P is in the step a, and the method includes the R C

 Information, before or after step b, update the values below and above the R C window. Steps to update the values below and above the R C window before step b

 The information contains the value of P under the window, the value under the update window, the value of the smallest P in the P, and the value of the value under the window of the update window.

 Steps to update the values below and above the R C window in step b

The information contains the lower P of the window The value of the smallest P in the P value under the update window, and the sum of the lengths of the values under the window of the value update window on the update window.

 In the above method, before the step a, the method includes the A R C to receive the A R C H, and the A R C to receive the P and return to the A R C .

 In addition, the values below and above the updated window, the method includes the A R C to receive the A R C

 Therefore, in the above method, there is a successful method in step b. If all Ps of phase C are successful, then success is successful and unsuccessful.

 The logic provided here to control the information of the C mode, including the mode control A R C Hugh,

 A R C Hugh includes 碉 information receiving sheep, upper control sheep, storage sheep and upper sheep, among them,

 The information receiving sheep receives and receives the information of A R C and sends the received information to the control sheep.

 On the control sheep received the information to receive the sheep's information, information and storage of the meta-storage stored in the sheep to control the sheep's RCS mode to teach the sheep P, whether you need to go up the success message, if you need to, then the success of the message on the sheep Otherwise, no operation is performed

Store the sheep storage CSP on the upper sheep to control the sheep's pass, on the success message success message. Therefore, in the upper system, ARC Hugh includes management sheep, management sheep information to receive sheep information, update storage P stored in sheep, and in the update, control the sheep

 Information receiving sheep, near the information received to the management sheep

 Storage sheep, near storage P

Controlling the sheep, receiving the management of the sheep, storing the P stored in the sheep, and

 P, do you need to be up to the success message, if you need to go up, then the success message on the sheep, otherwise, do not perform the operation.

 , in the system, the storage sheep near storage A R

 In the above system, the R C approach includes the sheep and the sheep, and receives the information from the P R C stored in the R C memory sheep to receive and receive the R received from the R.

 Storage sheep near storage P

 In addition, in the above system, the management sheep is updating the values below and below the windows stored in the storage sheep.

Sheep

 The sheep is near the management of the sheep, and the R C is stored in the storage sheep.

Whether the method and system of the RC mode information are connected The success of the next P received in the window is up to the successful success message. Due to the success message of instinct and upsizing, the successful execution of the message can also be performed, and the rabbit has been successful, so this

 Resources and resources, improve each.

solid

 1 Existing wood A R C Hour received information method flow 2 The way of providing the C mode information method flow and

 3 ways to provide information in the C mode.

The preferred way of this

 The basic idea of this is whether it is received under the window.

The success of P is up to the success of the successful C S.

 The following is a combination of the steps of the wood scheme.

 2 The information processing method of the C mode is shown in Fig. 2, and the information processing method of the C mode includes the following steps. Step 21 A R C Receive reception Receive information of A R C rest.

 , information for successful P

The information of receiving the ARC retreat to the ARC retiring may be the information of the P or the P, that is, the P retransmission information that the AR rehearsing can be successful, or more Successful P return information.

 Step 22 Information is updated by P.

 Stored information on the existing P, A R C, "not", P received information, updated

"P."

 Step 23 Is there a successful C S , if yes, go to step 24 otherwise, go to step 25, and all the Ps of the phase, that is, all the Ps of the phase, indicate that C S has been .

 Step 24 A R C Hugh up to the successful message of success.

 After the successful C S , A R C is on the success message , the general phase of the storage is the same as the P CP on the ground , and the phase of the successful phase is terminated .

 Step 25 Does the information contain the window?

P, if yes, perform step 26 Otherwise, flow.

 , Hugh information with the success of P in the VTA) P

 Step 26 Information update phase, process.

 The bottom and bottom of the phase window, ie VTA) and VT) receive a P equal to VTA), ARC Hove Update VTA), P in the smallest P, due to the value of the length, so VT) also, which is

 .

If there is a P in the fruit, then ARC H It should be noted that whether the information contains the lower P of the window, and whether there is success or not can also be the purpose of the scheme.

 3 force in the C mode of information management, 3, the information in the C mode includes the friend ARC Hugh 31 and the receiving ARC Hugh 32, receive ARC Hugh 32 in the receiving ARC Hugh 31 P, receive P, to ARC Hugh 31 return information ARC Hugh 31 includes information receiving sheep 311, upper control sheep 312 storage sheep 313 and Shangyang 314, wherein

 The information receiving sheep 311 receives and receives the information of the A R C rest 32, and sends the received information to the upper control sheep 312.

 On the control sheep 312, after receiving the information receiving sheep 311 information, new information and teaching the stored CSP in the storage sheep, whether it needs to go up the success message, need to go up, then pass the sheep 314 success message, otherwise Performing operations

 Store sheep 313, for storing P's, and

P

 On the sheep 314, on the root control sheep 312 pass, success message.

 A R C Hugh 31 includes management sheep 315, information on receiving sheep 311 in the root information, updating the P stored in the storage storage sheep 313, and updating the sheep 312 in the update.

 Information receiving sheep 311, near the information received to the management sheep 315 storage sheep 313, close to the storage P

 Controlling the sheep 312, near the receipt of the management sheep 315, the stored sheep 313 stored in the P, and the C S

P, do you need to get up the success message, need to go, then Success message on the sheep, otherwise, no action is taken.

 Store sheep 313 near the lower and upper values of the storage window

 The teaching management sheep 315 is close to the root information update teaches the values of the lower and upper windows of the stored sheep 313.

 A R C 休 31 includes sheep 316, sheep 316 in the receiving A R C 休 32 storage sheep 313 stored in the P A A C C receiving receiving A R C 休 receiving the P and returning P information storage sheep 313, near storage P

 Manage Sheep 315, near the value of the window below and stored in the update store sheep 313, Tong Yang 316

 Sheep 316, near the root management sheep 315, to receive A R C rest 32 storage sheep 313 stored in, inside, not P

 In the above A R C Hugh 31, the information receiving sheep 311 is in the receiving portion of A R C Hugh 31, the upper sheep 314 and the sheep 316 are in the A R C Hugh 31 portion.

 Above, Liben is better, not limited to the guarantee.

 However, there are many other ways to do this, and the understanding of wood in this field can be made in the context of the sum of the various aspects, and not the spirit and the sum of the phases are included in the requirements of this warranty.

Usability

The information processing method and system in the C mode, whether it receives the success of the next P in the window, is up to the successful success message. Instinctive and up In the success message, but also on the successful execution of the message, and the rabbit has been successful, so, this storage resource and resources, improve each.

Claims

Claim  1. A method for controlling information in the C mode, which includes  a, mode control A R C receive reception and reception A R C rest information, information reception A R C rest  A R C Hugh's mode teaches the sheep to return information and  b. A C Hugh Information Is there a successful meta-control for each teacher, and the result is that the success message of success is above, otherwise, it is not done.  2. The method described in claim 1, wherein  A R C rest store with P  In step b, the step of A R C Hour information is successful.  A R C Hugh Received information updated P, updated P exists or not Successful 3. The method described in claim 2, wherein  Information with a sequence of successful P  In step a, the method includes the A R C  Information, before step b or step b, update the values under and below the window of A R C Hugh,  Steps to update the values below and above the window of A R C Hugh before step b  The information contains the window P's S, the value under the update window is not the value of the smallest P in P, and the update window Steps to update the values below and above the RC window in step b  The information contains the window  P, the value under the update window, the value of the smallest P in the P, and the update window 4. The method of any one of the requirements of 1 to 3, the method before the step a includes the A R C to receive the A R C H, and the P received by the A R C to return the information to the A R C .  5. The method of requirement 3, the value below and above the updated window, the method includes the A R C to receive the A R C  6. The method of requirement 1, where there is a successful method in step b. If all the Ps of the phase are successful, then the success is unsuccessful. 7, in control

The mode of information, including mode control ARC Hugh, where  A R C Hugh includes 碉 information receiving sheep, upper control sheep, storage sheep and upper sheep, among them, The information receiving sheep receives the information of receiving the ARC, and sends the received information to the upper control sheep information, and the information stored in the storage sheep controls the CS mode of the sheep, whether it needs to be up to the success message. Need to go, then Success message on the sheep, otherwise, no operation  Store the sheep storage R C S A on the upper sheep to control the sheep on the success message, the success message.  8. The system of claim 7, wherein the A R C approach includes managing the sheep, the management sheep information receiving the sheep information, updating the stored A in the sheep, and updating the sheep in the update  Storage sheep near storage A  The upper control sheep is received by the management sheep, the A stored in the storage sheep, and the R C S A, whether it needs to be up to the success message. If it needs to be up, then the success message is sent to the sheep. Otherwise, the operation is not performed.  9. The system described in claim 8, wherein  Storage sheep near storage A R C

 10. The system of requirement 9, where  R C Hugh includes sheep, The sheep receives the R R from the R C storage sheep and receives the information received by the R C to receive the P received. Storage sheep near storage P 11. The system of claim 10, where The value of the window below and above, through the sheep  The sheep is near the management of the sheep, and receives the R C to store the internal P stored in the sheep.