CN101141225A

CN101141225A - Data loss processing method in mobile communication system

Info

Publication number: CN101141225A
Application number: CNA2006101130756A
Authority: CN
Inventors: 宋科
Original assignee: ZTE Corp
Current assignee: ZTE Corp
Priority date: 2006-09-08
Filing date: 2006-09-08
Publication date: 2008-03-12
Anticipated expiration: 2026-09-08
Also published as: CN101141225B

Abstract

The utility model discloses a data loss solution, which comprises 1. Create a SN -PDP buffer; 2. Each SN -PDP buffer is connected with one or a couple of N-PDU buffers which can receive the SN -PDU piece as per the packet number of SN PDU piece. When the receiving timer of N-PDU buffer is timing out and failing to receive all SN -PDU pieces, the N-PDU can release the buffer occupied by the SN -PDU piece; 3. Each N-PDU buffer is connected with one or a couple of SN -PDU piece buffers; 4. Each SN -PDP buffer is connected with one or a couple of buffers which lose the memory. The packet number of the SN -PDU piece without the complete package shall be left in the memory buffer via SGSN. Also, as per the packet number, the unconfirmed upper pieces with the same packet numbers can be discarded. The utility model solves the upper data package loss of SGSN via non-confirming method.

Description

Data loss processing method in a kind of mobile communcations system

Technical field

The present invention relates to a kind of method that in mobile communication system, reduces loss of data, particularly relate to and in General Packet Radio Service System, reduce the method that upstream data is lost in the non-affirmation transmission mode on the core network service support node apparatus.

Background technology

In recent years, each GSM (Global System for Mobile Communications, global system for mobile communications) operator is in order to provide rich data bearer service more to the user, set about many GSM network systems are progressively expanded to support GPRS (General Packet Radio Service, GPRS) system makes data service rate greatly improve.Specifically, be exactly MS (Mobile Station, portable terminal) needs in to support that a cover is applicable to the GPRS protocol stack of terminal equipment, BSC (Base StationController, base control) needs to add PCU (Packet Control Unit in, packet control unit) equipment, with the protocol stack of realization with core net GPRS devices communicating, CN (Core Network, core net) needs to add SGSN (Service GPRS Support Node in, Serving GPRS Support Node) and GGSN (Gateway GPRS Support Node, GGSN), to realize the mobile management of GPRS network respectively, session management, functions such as outer net access and transfer of data.

In the GPRS network protocol stack, SNDCP (Sub-Network Dependent ConvergenceProtocol, depend on the convergence protocol of subnet) be the end-to-end protocol between MS and the SGSN on user's face, be specifically designed to loaded packet data message N-PDU (Network Packet Data Unit, network packet data unit).Typically, divide into groups as IP (Internal Protocol, Internet protocol).The grouping that sends to SGSN (being up direction shown in Figure 1) from MS is through LLC (Local Link Control, logic link control) protocol layer transmits, the LLC layer is in order to adapt to the actual bearer ability of bottom link, maximum length to LL-PDU (Local Link Control-Packet Data Unit, LLC Packet Data Unit) limits.This also makes transmitting terminal SNDCP layer N-PDU need be carried out segmentation according to the good length of as offered (being the negotiation between the LLC layer of MS and SGSN), and each SN-PDU of a N-PDU (SNDCP Packet Data Unit) burst all will send to SGSN by Um Interface (interface between wireless side MS and the BSC), Gb Interface (interface between BSC/PCU and the SGSN) and go up.

Typically, because Gb Interface may be by frame relay network carrying, for each SN-PDU burst of a N-PDU, may arrive SGSN through the different paths of frame relay network, the order when their orders of arriving SGSN just may send with MS so is inconsistent.This recipient SNDCP entity that just requires to be positioned on the SGSN need have the ability of ordering when reorganization SN-PDU burst, obtain correct N-PDU, to realize the transparent transmission of N-PDU.

" 3GPP TS 44.065 " agreement regulation, the composition structure of SNDCP protocol header and the reception processing and the recombination method that belong to all SN-PDU bursts of same N-PDU; Non-affirmation mode SN-PDU also is called SN-UNIT DATA PDU (non-affirmation mode Packet Data Unit).

" 3GPP TS 44.065 " agreement regulation, in each burst of each bag (N-PDU), first section is had only one, and its section head is known F=1; The end section also has only one, and its section tail tag is known M=0.The section head knowledge F that is not first section burst is 0 without exception; The section tail tag knowledge M that is not the burst of end section is 1 without exception, and expression also has subsequent segment.Each burst all has a segment number Seg, the order of maintaining each burst of a bag with segment number.The span of segment number Seg is 0 to 15, and in other words, the SNDCP agreement only supports same bag to be divided into 16 sections at most.

As shown in Figure 2, the formed SN-PDU protocol header of first burst of a N-PDU has four bytes (byte is eight binary digits), the information relevant with segmentation/reorganization is that a section head is known F, a section tail tag is known M, four segment number Seg, and 12 Bale No. N-PDU Number (usually, a N-PDU is called " bag ", its numbering N-PDU Number is called " Bale No. ").

As shown in Figure 3, the formed SN-PDU protocol header of the subsequent segment of a N-PDU (non-first section) has three bytes, its layout structure and fields function and first section protocol stem shown in Figure 2 are similar, and just subsequent segment does not need to carry compressing mark (DCOMP in first section and PCOMP).Wherein, the subscriber data compression algorithm sign that DCOMP (Identifier of the user data compression algorithm used for theN-PDU) uses for specifying N-PDU, the Protocol Control Information compression algorithm sign that PCOMP (Identifier ofthe protocol control information compression algorithm used for the N-PDU) uses for specifying N-PDU.

" 3GPP TS 44.065 " agreement is pointed out, for non-affirmation mode SN-PDU burst, the SNDCP layer need provide the function of ordering, and the ordering after according to fragmentation state machine treatment mechanism, carry out the legitimacy judgement SN-PDUs burst that can form complete N-PDU is recombinated, form complete N-PDU.SN-PDUs represents a plurality of SN-PDU, and s represents plural number.

" 3GPP TS 44.065 " agreement is pointed out, receive the SNDCP entity and be in one of following three kinds of states all the time: receive first section state, receive subsequent segment state and discarding state, the state that first section of reception, expectation receive subsequent segment and the segmentation that receives should be abandoned is expected in expression respectively.If actual reception to SN-PDU burst and not being inconsistent of expecting of accepting state, that will abandon this burst and change current accepting state according to this burst.As can be seen, since agreement has been stipulated non-affirmation mode message and also will have been carried out the state machine treatment mechanism, be based on a kind of like this hypothesis with regard to explanation--" different N-PDU is that the order when sending according to MS sends on the SGSN-SNDCP protocol layer ", clearly, this hypothesis is inapplicable for the frame-relay network of complexity, because the up SN-PDUs that sends might send to SGSN by different routes upward continuously, the order that their arrive can't guarantee.

Typically, be respectively 1,2 N-PDUs as two Bale No.s and all be divided into two sections and send to SGSN through frame relay networks and go up, the SGSN-SNDCP protocol stack receives following SN-PDU burst successively: wrap 1

section

1,2 section 2 of bag, wrap 1 section 2, wrap 2 section 1.So, receiving 2 sections of bags at 2 o'clock, according to the state machine treatment mechanism of agreement regulation, just should continue then expectation receives the burst of bag 2, and subsequent packet is to wrap 1 section 2, causes these two bags all will be dropped.In other words, the method for handling burst according to accepting state machine mode pointed out of agreement is inappropriate.

Lose the problem except above-mentioned situation can cause upstream data, the realization according to SGSN equipment itself also might produce unnecessary packet loss.Because as network equipment, the resource quota of distributing to the different application use all limits, if quota reaches maximum, so follow-up business can not obtain handling.Typically, the buffer resource that receives up SN-PDU as SGSN-SNDCP is used up, and the so follow-up SN-PDU that receives again will be dropped, but obtains discharging and till the free buffer time spent is arranged up to corresponding buffer resource." 3GPP TS 44.065 " agreement points out that if do not receive whole SN-PDU bursts of a N-PDU in a period of time, all bursts of this N-PDU will be dropped.General SGSN equipment all is to use timer expiry mechanism to realize, this also means and is receiving whole bursts or the SN-PDU buffering area will be shared by these bursts before timer expiry.For a long time (especially unnecessarily) take and may cause reaching the quota maximum, thereby cause to a certain degree packet loss phenomenon.

Summary of the invention

Technical problem to be solved by this invention is to provide the method that reduces loss of data in a kind of mobile communcations system, is used for solving the non-affirmation mode of GPRS mobile communcations system equipment of the core network SGSN SNDCP upstream data packet loss problem.

To achieve these goals, the invention provides data loss processing method in a kind of mobile communcations system, it is characterized in that, comprising:

Step 1 is created a SN-PDP buffering for each customer service on Serving GPRS Support Node;

Step 2, each described SN-PDP buffering articulates one or limited a plurality of N-PDU buffering, described N-PDU buffering receives the SN-PDU burst according to the Bale No. of SN-PDU burst, when described N-PDU was buffered in its reception timer expiry and does not receive all SN-PDU bursts, release had received the buffering that the SN-PDU burst takies;

Step 3, each described N-PDU buffering articulate one or limited a plurality of SN-PDU burst buffering, and when same described N-PDU cushioned SN-PDU burst of every reception, described reception timer resetted; And

Step 4, each described SN-PDP buffering articulates one or limited a plurality of memory buffering of losing, can not form the Bale No. of the SN-PDU burst of complete packet by SGSN and charge to the described memory buffering that abandons, and abandon the non-affirmation mode upstream data burst of identical Bale No. according to described Bale No., when described abandon memory buffering to abandon memory timer overtime, discharge this and abandon the memory buffering.

Data loss processing method in the described mobile communcations system, wherein, in the described step 2, each described SN-PDP buffering all is provided with a pointer that points to a bag buffering, all bag bufferings that belong to same described SN-PDP buffering are connected in series by the mode of order chained list, each described bag buffering all is provided with a pointer that points to a burst buffering, and all bursts bufferings that belong to same described bag buffering are connected in series by the mode of order chained list.

Data loss processing method in the described mobile communcations system, wherein, described SN-PDP buffering, described N-PDU buffering, described SN-PDU burst buffering, described memory buffering, described reception timer or the described memory timer that abandons lost are when application one resource, take the buffering element by an idle queues head pointer away from the idle queues head, when discharging a resource, the buffering element that will give back by an idle queues tail pointer is placed into the idle queues tail.

Data loss processing method in the described mobile communcations system, wherein, when described idle queues head pointer overlapped with described idle queues tail pointer, corresponding buffer region did not have idle element.

Data loss processing method in the described mobile communcations system, wherein, in the described step 1, also comprise by described SN-PDP buffering reception one non-affirmation mode SN-PDU upstream data burst, and judge the whether solely section step that becomes to wrap of this non-affirmation mode SN-PDU upstream data burst with a section tail tag knowledge according to the section head knowledge of this non-affirmation mode SN-PDU upstream data burst.

Data loss processing method in the described mobile communcations system, wherein, when this non-affirmation mode SN-PDU upstream data burst can not be solely section when becoming bag, also comprise judge described abandon whether to exist with this non-affirmation mode SN-PDU upstream data burst in the memory buffering have the step of the element of identical Bale No., if exist, then abandon this non-affirmation mode SN-PDU upstream data burst,, judge further then whether the uplink packet buffering is full if do not exist.

Data loss processing method in the described mobile communcations system wherein, if the uplink packet buffering is full, then adds described Bale No. described memory buffering and the dropping packets of abandoning; If uplink packet buffering less than, then further judge the bag buffering that whether has had identical Bale No. in the described SN-PDP buffering, if do not exist, then create new burst buffering and bag buffering, if exist, then further judge by the abnormality juding treatment step whether burst maximum or this non-affirmation mode SN-PDU upstream data burst of whether attaching most importance to this non-affirmation mode SN-PDU upstream data burst whether subdivision sheet or described N-PDU buffering surpassing regulation are exception message.

Data loss processing method in the described mobile communcations system, wherein, as if being judged to be by the abnormality juding treatment step, then abandon this non-affirmation mode SN-PDU upstream data burst, discharge corresponding buffer region, close the corresponding memory timer of losing, add this non-affirmation mode SN-PDU upstream data burst to the described memory buffering that abandons; If be judged to be not by the abnormality juding treatment step, then newly-built burst buffering also judges whether to satisfy into the bag condition.

Data loss processing method in the described mobile communcations system, wherein, if satisfy into the bag condition, then all the SN-PDU burst bufferings with described N-PDU buffering are reassembled as complete bag, discharge corresponding buffer region, close corresponding reception timer; If do not satisfy into the bag condition, then described newly-built burst buffering is hung described N-PDU buffering, described reception timer resets.

Adopt this method, solved when the SNDCP upstream data is through frame-relay network under the non-affirmation mode among the GPRS mobile communcations system equipment of the core network SGSN the multiple packet loss problem of SGSN side that cause preferably because message arrival order is inconsistent with sending order.

The clear and definite SNDCP of the present invention is non-, and the affirmation mode data transmission does not rely on accepting state machine mode, has avoided issuable packet drop.

The present invention stipulates to use SN-PDP (SNDCP Packet Data Protocol, the SNDCP packet data protocol) buffering, N-PDU buffering, SN-PDU burst buffering secondary chained list way to manage, allow staggered arrival of burst of limited a plurality of different N-PDU of same customer service, promptly reduce the reception of SN-PDU and the coupling of Bale No. significantly, take place with the out of order situation that allows various complexity, thereby reduced the packet drop that therefore produces.

The present invention introduces for each SN-PDP buffering and abandons the memory buffering, make and directly to abandon the burst of confirming to reassemble into complete packet, rather than need wait until that receiving timer expiry just abandons them, can save the timer resource like this and receive buffer resource.And various resources can not be proceeded to receive message when reaching the quota maximum again and handle, and cause packet loss, so the present invention has reduced the packet drop that therefore produces.

Describe the present invention below in conjunction with the drawings and specific embodiments, but not as a limitation of the invention.

Description of drawings

Fig. 1 is a GPRS protocol stack schematic diagram;

Fig. 2 is non-affirmation mode SN-PDU protocol header (first a section) schematic diagram;

Fig. 3 is non-affirmation mode SN-PDU protocol header (subsequent segment) schematic diagram;

Fig. 4 is a data buffering structural representation of the present invention;

Fig. 5 becomes the burst schematic diagram of bag situation for the only section of the present invention;

Fig. 6 is two sections burst schematic diagrames that become the bag situation of the present invention;

Fig. 7 becomes the burst schematic diagram of bag situation for multistage of the present invention;

Fig. 8 is for reducing the method flow diagram of loss of data in the mobile communcations system of the present invention;

Fig. 9 is for reducing a concrete grammar flow chart of loss of data in the mobile communcations system of the present invention.

Embodiment

See also shown in Figure 4ly, be data buffering structural representation of the present invention.This data buffering structure is the non-affirmation mode of a SGSN-SNDCP of the present invention upstream data buffer structure.The present invention has adopted two layers of cache management mechanism.Each SN-PDP buffering is all preserved a pointer that points to a bag buffering, all bag bufferings that belong to same SN-PDP buffering all use the mode of order chained list to contact, each bag buffering is all preserved a pointer that points to a burst buffering, and all burst bufferings that belong to same bag buffering all use the mode of order chained list to contact.The number of bag (N-PDU) buffering that each SN-PDP buffering articulates is limited, for example, can stipulate maximum 4.The number of burst (SN-PDU) buffering that each bag buffering articulates is limited, and maximum can not surpass the maximum burst number of bag that the SNDCP agreement is supported, promptly 16.

The present invention if receive timer expiry, does not also receive all bursts of a bag for each bag buffering is equipped with a reception timer, then abandons all burst bufferings of this bag, and abandons this bag buffering.Whenever receive a burst, unless the reception timer of this bag buffering that will reset once is last burst that this burst is this bag.

SGSN handles by butt joint contracture sheet, when discovery can not be formed complete packet, already present relevant buffer resource must be discharged; SGSN handles by butt joint contracture sheet, and the Bale No. of finding this burst is abandoning in the memory table of this SN-PDP buffering Already in, then directly abandons this burst.Abandoning memory buffering during each uses all starts one and abandons memory timer, this lose memory timer overtime after, this be abandoned the memory buffering and discharge from abandoning the memory table of corresponding SN-PDP buffering.

Resource used in the present invention comprises: SN-PDP buffering, N-PDU buffering, SN-PDU burst buffering ", abandon the memory buffering, receive timer, abandon memory timer; Total number average of these resources is limited.Typically, its occupation mode all can adopt the idle queues administrative mechanism, and idle queues head pointer, idle queues tail pointer promptly are provided.When applying for a resource, just take a buffering element away from the idle queues head, when discharging a resource, the buffering element that just will give back is put into the idle queues tail.If the idle queues head pointer overlaps with the idle queues tail pointer, just illustrate that buffering area has not had idle element to have used.

Why N-PDU cushions, abandons the number of memory buffering for limited a plurality of, reason is communication network side apparatus requirement long-time steady operation, so generally do not take dynamic application, discharge the method for internal memory, but when device start, distribute the buffering area of fixed size; And the capacity of equipment physical memory is limited; So the number that N-PDU cushioned, abandoned the memory buffering is limited.

See also shown in Figure 5, be the present invention solely section become the burst schematic diagram of bag situation.Only section for F=1 and M=0 becomes packet fragmentation, and promptly transmitting terminal has comprised complete N-PDU not with the N-PDU segmentation among the SN-PDU.This situation is handled without two layers of buffering of the present invention, directly carries out subsequent treatment.

See also shown in Figure 6ly, be two sections burst schematic diagrames that become the bag situation of the present invention.If a bag is divided into two sections, knows F with the section head of these two SN-PDU bursts so and just can finish organizing the judgement of bag condition with a section tail tag knowledge M.No matter which section arrives first, all be to create a burst buffering, and create one and wrap buffering that the burst buffering is associated with on the bag buffering, and startup receives timer, waits for that follow-up burst reaches.If the branch segment identification of two SN-PDU bursts bufferings during a bag cushions is respectively " F=1 and M=1 and Seg=0 " and " F=0 and M=0 and Seg=1 ", promptly reach into the bag condition, according to segment number Seg this two bursts of resequencing, then reassemble into original packet (N-PDU), and carry out subsequent treatment.

See also shown in Figure 7ly, become the burst schematic diagram of bag situation for multistage of the present invention.It is to be example with three sections that this multistage becomes the burst of bag situation.If a bag is divided into three sections, each burst＜F, M, Seg〉combined situation is as follows:

First section: F=1 and M=1 and Seg=0;

Second section: F=0 and M=1 and Seg=1;

The 3rd section: F=0 and M=0 and Seg=2.

If a bag is divided into four sections (perhaps more than four sections), middle two sections F/M combination is identical, each burst＜F, M, Seg〉combined situation is as follows:

First section: F=1 and M=1 and Seg=0;

Second section: F=0 and M=1 and Seg=1; //＜F, M〉with the 3rd section identical

The 3rd section: F=0 and M=1 and Seg=2; //＜F, M〉with second section identical

The 4th section: F=0 and M=0 and Seg=3.

Natural preface by segment number Seg is arranged, order in the time of just can judging the transmission of removing all interludes outside two sections of the head and the tail, thus sort, reassemble into complete original packet (N-PDU), and carry out subsequent treatment.

Under normal circumstances, when reaching all burst reorganization conditions of a bag, just can discharge the relevant bag buffering and the burst buffering of this bag.But under abnormal conditions,, also should discharge various buffer resources even without reaching into bag (all bursts of a bag are formed complete bag) condition.The cause and the consequence of various buffer memory release conditions and generation thereof are below described.

Situation one, occurrence condition: the one-tenth bag condition that reaches a bag.Produce action: all the burst bufferings that will wrap reassemble into complete packet, and carry out subsequent treatment.Discharge this bag buffering and these bursts buffering.Kill the reception timer.

Situation two, occurrence condition: overtime.The reception timer arrives, and all bursts that can form complete packet are not received in expression at this moment yet.Produce action: all the burst bufferings and the bag buffering itself that discharge this bag.Creating one abandons memory buffering and hangs the abandoning in the memory table of this SN-PDP buffering.

Situation three, occurrence condition: do not have idle burst buffering and can't receive new burst.Produce action: all the burst bufferings and the bag buffering itself that discharge this bag.Creating one abandons memory buffering and hangs the abandoning in the memory table of this SN-PDP buffering.

Situation four, occurrence condition: reach a SN-PDP and cushion the maximum bag number that can articulate and can't receive new burst.Produce action: all the burst bufferings and the bag buffering itself that discharge this bag.Creating one abandons memory buffering and hangs the abandoning in the memory table of this SN-PDP buffering.

Situation five, occurrence condition: do not have idle packet buffering and can't receive new burst.Produce action: all the burst bufferings and the bag buffering itself that discharge this bag.Creating one abandons memory buffering and hangs the abandoning in the memory table of this SN-PDP buffering.

Situation six, occurrence condition: reach a bag and cushion the maximum burst number (as: 16) that can hang and can't receive new burst.Produce action: all the burst bufferings and the bag buffering itself that discharge this bag.Creating one abandons memory buffering and hangs the abandoning in the memory table of this SN-PDP buffering.

Situation seven, occurrence condition: the current slotted protocol header message of receiving is unusual.Produce action: all the burst bufferings and the bag buffering itself that discharge this bag.Creating one abandons memory buffering and hangs the abandoning in the memory table of this SN-PDP buffering.

Situation eight, occurrence condition: start the reception timer failure of bag buffering.Produce action: all the burst bufferings and the bag buffering itself that discharge this bag.Creating one abandons memory buffering and hangs the abandoning in the memory table of this SN-PDP buffering.

See also shown in Figure 8ly, be to reduce in the mobile communcations system of the present invention the method flow diagram of loss of data.This flow process specifically comprises the steps:

Step 801 is created the buffering (brief note cushions for SN-PDP) of a SNDCP protocol layer for each customer service on SGSN;

Step 802, each SN-PDP buffering articulate one or limited a plurality of N-PDU buffering.The sum of the last N-PDU buffering of SGSN is limited.Each N-PDU buffering all has a reception timer, does not receive all bursts of this N-PDU during as if this reception timer expiry yet, and the buffering that then all paid-in bursts is taken discharges;

Step 803, each N-PDU buffering articulate one or limited a plurality of SN-PDU burst buffering.The sum of the last SN-PDU burst buffering of SGSN is limited.Which bag buffering the burst that New Development is sent up belongs to, and can determine by the Bale No. (N-PDU Number) in the burst.For same N-PDU buffering, whenever receive a SN-PDU burst, the reception timer of (stop and restarting immediately) this N-PDU buffering that will reset;

Step 804, each SN-PDP buffering articulates one and abandons the memory table, promptly one or more memory bufferings that abandon.The Bale No. that SGSN can not form the burst of complete packet is charged to and is abandoned the memory buffering.SGSN directly abandons the non-affirmation mode upstream data burst of identical Bale No. according to the Bale No. that abandons in the memory buffering.Each abandons memory buffering and all has one and abandon memory timer, when this timer expiry, then discharges this and abandons the memory buffering.

Wherein, receive timer and to abandon memory timer also be a limited number of resources in the SGSN equipment.

See also shown in Figure 9ly, be to reduce in the mobile communcations system of the present invention a concrete grammar flow chart of loss of data.This flow process specifically comprises the steps:

Step 901 receives a non-affirmation mode SN-PDU upstream data on the SN-PDP buffering.Know F according to its section head and judge with section tail tag knowledge M whether only section becomes bag for it.If then execution in step 907; Otherwise, enter step 902.

Step 902 becomes the situation of bag for section not merely, judges whether abandoning on this SN-PDP buffering exists the element that has identical N-PDU Number with this non-affirmation mode SN-PDU upstream data in the memory table.If exist, directly abandon, otherwise, enter step 903.

Step 903 judges whether the uplink packet buffering is full.If full, then this N-PDU Number is added abandoning the memory table and should abandoning by non-affirmation mode SN-PDU upstream data of this SN-PDP buffering, otherwise, enter step 904.

Step 904 judges whether this SN-PDP buffering has existed the bag buffering of identical N-PDU Number.If there is no, then create new burst buffering and bag buffering, and start the reception timer of this bag buffering.Wherein may there be newly-built burst buffering in this, starts the situation of reception timer failure, so long as the situation of failure just needs this N-PDU Number adding is abandoned the memory table.If exist, then enter step 905.

Step 905, by the abnormality juding handling process, judge this this non-affirmation mode SN-PDU upstream data whether be the repetition burst or whether this N-PDU surpassed the burst maximum number (as: maximum 16 bursts of bag of the implicit regulation of SNDCP agreement) of agreement regulation or implicit regulation, perhaps this non-affirmation mode SN-PDU upstream data be first section of a bag still its segment number Seg be not equal to the exception message that 0 grade and agreement are not inconsistent.If, then abandon this non-affirmation mode SN-PDU upstream data, and abandon all associated buffer of release, kill relevant timer, and adding abandons the memory table; Otherwise, change step 906 over to.

Step 906, newly-built burst buffering also judges whether to satisfy into the bag condition.If satisfy, then all the SN-PDU burst bufferings with this N-PDU buffering are reassembled as complete N-PDU, discharge associated buffer, kill the reception timer of bag buffering, execution in step 907; Otherwise, this burst buffering is hung in this bag buffering the reception timer of reset packet buffering.

Step 907 is carried out follow-up normal process.

Adopt the inventive method, solved when the SNDCP upstream data is through frame-relay network under the non-affirmation mode among the GPRS mobile communcations system equipment of the core network SGSN the multiple packet loss problem of SGSN side that cause preferably because message arrival order is inconsistent with sending order.

Certainly; the present invention also can have other various embodiments; under the situation that does not deviate from spirit of the present invention and essence thereof; those of ordinary skill in the art work as can make various corresponding changes and distortion according to the present invention, but these corresponding changes and distortion all should belong to the protection range of the appended claim of the present invention.

Claims

1. data loss processing method in the mobile communcations system is characterized in that, comprising:

2. data loss processing method in the mobile communcations system according to claim 1, it is characterized in that, in the described step 2, each described SN-PDP buffering all is provided with a pointer that points to a bag buffering, all bag bufferings that belong to same described SN-PDP buffering are connected in series by the mode of order chained list, each described bag buffering all is provided with a pointer that points to a burst buffering, and all bursts bufferings that belong to same described bag buffering are connected in series by the mode of order chained list.

3. data loss processing method in the mobile communcations system according to claim 1 and 2, it is characterized in that, described SN-PDP buffering, described N-PDU buffering, described SN-PDU burst buffering, described memory buffering, described reception timer or the described memory timer that abandons lost are when application one resource, take the buffering element by an idle queues head pointer away from the idle queues head, when discharging a resource, the buffering element that will give back by an idle queues tail pointer is placed into the idle queues tail.

4. data loss processing method in the mobile communcations system according to claim 3 is characterized in that, when described idle queues head pointer overlapped with described idle queues tail pointer, corresponding buffer region did not have idle element.

5. according to data loss processing method in claim 1, the 2 or 4 described mobile communcations systems, it is characterized in that, in the described step 1, also comprise by described SN-PDP buffering reception one non-affirmation mode SN-PDU upstream data burst, and judge the whether solely section step that becomes to wrap of this non-affirmation mode SN-PDU upstream data burst with a section tail tag knowledge according to the section head knowledge of this non-affirmation mode SN-PDU upstream data burst.

6. data loss processing method in the mobile communcations system according to claim 5, it is characterized in that, when this non-affirmation mode SN-PDU upstream data burst can not be solely section when becoming bag, also comprise judge described abandon whether to exist with this non-affirmation mode SN-PDU upstream data burst in the memory buffering have the step of the element of identical Bale No., if exist, then abandon this non-affirmation mode SN-PDU upstream data burst,, judge further then whether the uplink packet buffering is full if do not exist.

7. data loss processing method in the mobile communcations system according to claim 6 is characterized in that, if the uplink packet buffering is full, then described Bale No. is added described memory buffering and the dropping packets of abandoning; If uplink packet buffering less than, then further judge the bag buffering that whether has had identical Bale No. in the described SN-PDP buffering, if do not exist, then create new burst buffering and bag buffering, if exist, then further judge by the abnormality juding treatment step whether burst maximum or this non-affirmation mode SN-PDU upstream data burst of whether attaching most importance to this non-affirmation mode SN-PDU upstream data burst whether subdivision sheet or described N-PDU buffering surpassing regulation are exception message.

8. data loss processing method in the mobile communcations system according to claim 7, it is characterized in that, as if being judged to be by the abnormality juding treatment step, then abandon this non-affirmation mode SN-PDU upstream data burst, discharge corresponding buffer region, close the corresponding memory timer of losing, add this non-affirmation mode SN-PDU upstream data burst to the described memory buffering that abandons; If be judged to be not by the abnormality juding treatment step, then newly-built burst buffering also judges whether to satisfy into the bag condition.

9. data loss processing method in the mobile communcations system according to claim 8, it is characterized in that if satisfy into the bag condition, then all the SN-PDU burst bufferings with described N-PDU buffering are reassembled as complete bag, discharge corresponding buffer region, close corresponding reception timer; If do not satisfy into the bag condition, then described newly-built burst buffering is hung described N-PDU buffering, described reception timer resets.

10. data loss processing method in the mobile communcations system according to claim 3, it is characterized in that, in the described step 1, also comprise by described SN-PDP buffering reception one non-affirmation mode SN-PDU upstream data burst, and judge the whether solely section step that becomes to wrap of this non-affirmation mode SN-PDU upstream data burst with a section tail tag knowledge according to the section head knowledge of this non-affirmation mode SN-PDU upstream data burst.