CN110138680A - Packet loss processing method, device and the base station equipment of PDCP queue - Google Patents
Packet loss processing method, device and the base station equipment of PDCP queue Download PDFInfo
- Publication number
- CN110138680A CN110138680A CN201910389039.XA CN201910389039A CN110138680A CN 110138680 A CN110138680 A CN 110138680A CN 201910389039 A CN201910389039 A CN 201910389039A CN 110138680 A CN110138680 A CN 110138680A
- Authority
- CN
- China
- Prior art keywords
- message
- pdcp queue
- queue
- deposited
- new message
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/32—Flow control; Congestion control by discarding or delaying data units, e.g. packets or frames
- H04L47/326—Flow control; Congestion control by discarding or delaying data units, e.g. packets or frames with random discard, e.g. random early discard [RED]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention relates to packet loss processing method, device and the base station equipments of a kind of PDCP queue.The described method includes: receiving the new message that upper layer issues；If current PDCP queue has been fully loaded with, in the message that new message and current PDCP queue have been deposited, the N number of message of random drop；Wherein, N=A-B, A are the total quantity of new message and the message deposited, and B is the maximum message segment storage quantity of current PDCP queue.By being fully loaded in current PDCP queue and there are in the case where new message, the message deposited with new message and current PDCP queue as a whole, carries out random drop processing from all messages.So, so that remaining each message is able to satisfy the storage limitation of the current PDCP queue after discard processing simultaneously, avoid the problem of abandoning using time-out or directly abandoning the decline of TCP flow amount present in the discard processings modes such as the new message of queue tail, it obtains storage forwarding with can making new message part, improves the efficiency of transmission and transmission stability of base station equipment.
Description
Technical field
The present invention relates to fields of communication technology, packet loss processing method, device more particularly to a kind of PDCP queue
And base station equipment.
Background technique
With the development of mobile communication technology, construction and practical portion of the covering of base station equipment with mating transmission plan
Administration, can all be faced with various problem, such as network congestion.For the reception of short-term larger flow, base station equipment is met
The problem of facing Buffer forwarding.For base station equipment due to being limited by cost, internal buffer queue can not be arranged to infinity, certain
In order to reduce cost in a little situations, buffer queue can be arranged to obtain very little instead, it is unavoidable that this allows for packet loss event.It is producing
In the link of raw packet loss, the processing mode of different base station equipment is different.In the art, the PDCP of conventional base station device
There is also queue packet losses for queue in (Packet Data Convergence Protocol, Packet Data Convergence Protocol) layer
Problem, for this problem of packet loss, the settling mode that conventional base station device uses is: being abandoned at PDCP layers using time-out or straight
It connects and abandons queue tail newly into modes such as messages.However, during realization, inventor find traditional settling mode there is
The problem of TCP (Transmission Control Protocol, transmission control protocol) flow declines.
Summary of the invention
Based on this, it is necessary to aiming at the problem that TCP flow amount decline present in above-mentioned traditional settling mode, provide a kind of energy
Enough eliminate the packet loss processing method of PDCP queue of TCP flow amount decline, a kind of packet loss processing unit of PDCP queue,
A kind of base station equipment and a kind of computer readable storage medium.
To achieve the goals above, the embodiment of the present invention the following technical schemes are provided:
On the one hand, the embodiment of the present invention provides a kind of packet loss processing method of PDCP queue, comprising:
Receive the new message that upper layer issues；
If current PDCP queue has been fully loaded with, in the message that new message and current PDCP queue have been deposited, random drop N
A message；
Wherein, N=A-B, A are the total quantity of new message and the message deposited, and B is the maximum message segment of current PDCP queue
Storage quantity.
In one of the embodiments, in the message that new message and current PDCP queue have been deposited, the N number of report of random drop
Text process include:
Respectively new message is numbered with the message distribution deposited；
Random function is called according to each number, chosen at random from new message and the message deposited and deletes N number of message.
The above method in one of the embodiments, further include:
If N number of message of random drop is the message deposited, each new message is stored in dropping packets by transmitting sequence
Current PDCP queue afterwards.
The above method in one of the embodiments, further include:
If in N number of message of random drop, part of message is the message deposited, another part message is new message, then
By remaining new message by the current PDCP queue after giving sequence deposit dropping packets.
The above method in one of the embodiments, further include:
The quantity M2 and maximum message segment storage quantity of the quantity M1, the message deposited that obtain new message respectively；
If the sum of quantity M1 and quantity M2, it is greater than maximum message segment storage quantity, it is determined that current PDCP queue has been fully loaded with.
The above method in one of the embodiments, further include:
If the sum of quantity M1 and quantity M2, be less than or equal to maximum message segment storage quantity, then it is each new message is suitable by issuing
Sequence is stored in current PDCP queue.
On the other hand, a kind of packet loss processing unit of PDCP queue is also provided, comprising:
Message receiving module, the new message issued for receiving upper layer；
Discard processing module, for having been deposited in new message and current PDCP queue in current PDCP queue full load
Message in, the N number of message of random drop；
Wherein, N=A-B, A are the total quantity of new message and the message deposited, and B is the maximum message segment of current PDCP queue
Storage quantity.
Above-mentioned discard processing module includes: in one of the embodiments,
Numbering module is numbered for being respectively new message with the message distribution deposited；
Delete processing module, for being selected at random from new message and the message deposited according to each number calling random function
In and delete N number of message.
Another aspect, also provides a kind of base station equipment, including memory and processor, and memory is stored with computer journey
The step of sequence, processor realizes the packet loss processing method of above-mentioned PDCP queue when executing computer program.
In another aspect, also providing a kind of computer readable storage medium, it is stored thereon with computer program, computer program
The step of packet loss processing method of above-mentioned PDCP queue is realized when being executed by processor.
Packet loss processing method, device and the base station equipment of above-mentioned PDCP queue, by having expired in current PDCP queue
Carry and there are in the case where new message, the message deposited with new message and current PDCP queue as a whole, from all messages
Middle progress random drop processing.In this way, the storage of the current PDCP queue after making remaining each message be able to satisfy discard processing
Limitation simultaneously, is avoided and is abandoned or directly abandoned present in the discard processings modes such as the new message of queue tail using time-out
The problem of TCP flow amount declines obtains storage forwarding in which can make new message part, to effectively eliminate the decline of TCP flow amount
It is insufficient.The efficiency of transmission and transmission stability of base station equipment are improved, reduces the access of other communication equipments to the negative of network
It influences.
Detailed description of the invention
Fig. 1 is the application environment schematic diagram of the packet loss processing method of PDCP queue in one embodiment；
Fig. 2 is the first pass schematic diagram of the packet loss processing method of PDCP queue in one embodiment；
Fig. 3 is the second procedure schematic diagram of the packet loss processing method of PDCP queue in one embodiment；
Fig. 4 is the third flow diagram of the packet loss processing method of PDCP queue in one embodiment；
Fig. 5 is the packet loss process schematic of current PDCP queue in one embodiment；
Fig. 6 is the 4th flow diagram of the packet loss processing method of PDCP queue in one embodiment；
Fig. 7 is the 5th flow diagram of the packet loss processing method of PDCP queue in one embodiment；
Fig. 8 is the packet loss processing flow schematic diagram of a specific PDCP queue in one embodiment；
Fig. 9 is the function structure chart of the packet loss processing unit of PDCP queue in one embodiment.
Specific embodiment
It is with reference to the accompanying drawings and embodiments, right in order to which the objects, technical solutions and advantages of the application are more clearly understood
The application is further elaborated.It should be appreciated that specific embodiment described herein is only used to explain the application, not
For limiting the application.
It should be noted that unless otherwise defined, all technical and scientific terms used herein and belong to this hair
The normally understood meaning of bright those skilled in the art is identical.Term as used herein in the specification of the present invention
It is intended merely to describe the purpose of specifically embodiment, it is not intended that in the limitation present invention.Term as used herein "and/or"
Including any and all combinations of one or more related listed items.
When TCP flow measurer has adaptive characteristic namely transmitting terminal to learn data-bag lost, i.e., sharp reduces and send window
Mouthful, the rate that data packet reaches receiving end will decline rapidly, and then network congestion is released.When subsequent network is no longer gathered around
Plug, transmitting terminal start to increase transmission speed, finally will appear network congestion next time, and this phenomenon usually can week and
The appearance renewed makes network be in the lower state of network utilization whithin a period of time, reduces entire throughput.So
And the queue packet loss in PDCP layers is abandoned using traditional time-out or tail loses strategy, generates significantly to TCP flow amount
The problem of negatively affecting, namely TCP flow amount caused to decline.The problem of for traditional settling mode, the application provide with
Lower technical solution:
Referring to Fig. 1, the packet loss processing method of PDCP queue provided in an embodiment of the present invention can be applied to such as Fig. 1
Shown in application environment.It is appreciated that being agreement layer architecture and the base station equipment inside base station equipment shown in Fig. 1
Illustrated between terminal by eating dishes without rice or wine to carry out the cyberrelationship of data interaction.It will be understood by those skilled in the art that being shown in Fig. 1
Base station equipment can also include other composition agreements, to support base station equipment to realize corresponding data processing and transfer function.
Base station equipment can be LTE base station eNB, be also possible to the base station 5G gNB, can also be that other base stations comprising corresponding each layer are set
It is standby.
During the work time, PDCP layers receive GTP (GPRS Tunnelling Protocol, grouping nothing to base station equipment
Line service tunnel protocol) after the message that issues of layer, namely after receiving the new message that upper layer issues, PDCP layers may determine that and be used for
Whether the current PDCP queue for storing new message has been fully loaded with.If fully loaded, in the report current PDCP queue new message and deposited
Wen Zhong, the N number of message of random drop, the current PDCP queue after obtaining discard processing are a fully loaded PDCP queue.Wherein, N
=A-B, A are the total quantity of new message and the message deposited, and B is the maximum message segment storage quantity of current PDCP queue.It is lost
The message of abandoning is due to randomly choosing and abandoning, it is thus possible to all new messages of the message being dropped occurs, or all
For the message deposited in the current PDCP queue before discard processing, or in the message that is dropped, a part is new message, separately
A part of then message to have been deposited in the current PDCP queue before discard processing.
Referring to Fig. 2, in one embodiment, providing a kind of packet loss processing method of PDCP queue, it is applied to Fig. 1
Shown in application environment, include the following steps S12 and S14:
S12 receives the new message that upper layer issues；
Refer on data up direction it is appreciated that the upper layer in the present embodiment that is to say, PDCP layers of a upper protocol layer,
Such as, but not limited to above-mentioned GTP layer.Wherein, new message directly or indirectly can be issued to PDCP layers for GTP layers.Newly message is
Refer to the newest message for being handed down to PDCP layers in upper layer, be relative to the message stored in PDCP queue current in PDCP layers and
Speech.The quantity of new message can be one or more.
Specifically, during PDCP layers of processing downlink data, GTP layers can treated that downlink is needed to send by itself
Data packet (namely message) be handed down to PDCP layers.Data packet in PDCP layers by way of PDCP queue to be issued to uplink
Cached, handled and be sent to lower layer.Each PDCP queue of PDCP layers of maintenance can store a certain number of messages,
To wait subsequent data processing.
S14, if current PDCP queue has been fully loaded with, in the message that new message and current PDCP queue have been deposited, at random
Abandon N number of message；Wherein, N=A-B, A are the total quantity of new message and the message deposited, and B is the maximum of current PDCP queue
Packet storage quantity.
It is appreciated that current PDCP queue has been fully loaded with and has been referred to: the total quantity for the message deposited in current PDCP queue is
Reach the total of the message deposited in the maximum storage quantity of the current PDCP queue, or new message and current PDCP queue
Quantity alreadys exceed the maximum storage quantity of the current PDCP queue.And the maximum storage quantity namely refer to current PDCP team
Arrange the quantity thresholding for the message that can be stored simultaneously.
Specifically, PDCP layers can be according to the current PDCP queue for caching new message after receiving new message
Full load conditions are that all new messages are stored in current PDCP queue to determine, or to current whole message (including new message
The message deposited) execute the operation of random drop after, then will the current PDCP queue of undiscarded new message deposit.It is receiving
After new message, if current PDCP queue has been fully loaded with, PDCP layers in all new messages and the current PDCP queue to have deposited
Whole object of all messages as discard processing randomly lost from all new messages and all messages deposited
Abandon N number of message.After can so making remaining message all be stored in the current PDCP queue, which reaches again
To fully loaded state, namely obtain the current PDCP queue after discard processing.
The packet loss processing method of above-mentioned PDCP queue, by being fully loaded in current PDCP queue and there are new messages
In the case of, the message deposited with new message and current PDCP queue as a whole, carries out from random drop from all messages
Reason.In this way, the storage limitation of the current PDCP queue after making remaining each message be able to satisfy discard processing is simultaneously, avoids and adopt
The problem of being abandoned with time-out or directly abandoning the decline of TCP flow amount present in the discard processings modes such as the new message of queue tail,
Obtain storage forwarding with can making new message part, to effectively eliminate the deficiency of TCP flow amount decline.Improve base station equipment
Efficiency of transmission and transmission stability, reduce negative effect of the access to network of other communication equipments.
Referring to Fig. 3, in one embodiment, before above-mentioned step S14, can also include the following steps S131 and
S133:
S131, the quantity M1 for obtaining new message respectively, the quantity M2 for the message deposited and maximum message segment storage quantity.
It is appreciated that PDCP layers can synchronize statistics when receiving new message, periodically count or connect in receive process
It harvests statistics after finishing and obtains the quantity M1 of new message.PDCP layers can also obtain the number of new message in such a way that upper layer indicates
Measure M1.PDCP layers can be, but not limited to by directly carrying out quantity statistics, Huo Zhetong to the message deposited in current PDCP queue
The mode for crossing upper layer instruction obtains the quantity M2 for the message deposited.PDCP layers can be, but not limited to examine current PDCP queue
The mode for surveying or reading queue configuration parameter, obtains the maximum message segment storage quantity of current PDCP queue.
S133 is greater than maximum message segment storage quantity if the sum of quantity M1 and quantity M2, it is determined that current PDCP queue has been expired
It carries.
Specifically, PDCP layers can by the quantity M2 of the quantity M1, the message deposited for obtaining new message respectively and most
After big packet storage quantity, the ratio according to the sum of quantity M1 and quantity M2, with the maximum message segment storage quantity of current PDCP queue
It has been fully loaded with compared with as a result, to determine whether current PDCP queue has been fully loaded with, or after the new message in deposit part.PDCP layers can
Directly by the sum of quantity M1 and quantity M2, to carry out difference calculating with maximum message segment storage quantity, and then calculate and tie according to difference
Fruit, judges whether current PDCP queue has been fully loaded with.PDCP layers of quantity M1, the quantity M2 that can also be will acquire and maximum message segment storage
Quantity is sent to other processing apparatus of base station, to carry out difference calculating；By the difference meter for receiving the return of other processing apparatus
It calculates as a result, judging whether current PDCP queue has been fully loaded with.
When the sum of quantity M1 and quantity M2 can determine that current PDCP queue has been expired when being greater than maximum message segment storage quantity
It carries, to indicate in subsequent processing steps, whole random drop is carried out to all new messages and the message deposited and is handled, really
Current PDCP queue is protected after being stored in remaining all messages, reaches full load condition again.
S131 and S133 through the above steps, PDCP layers can quickly determine, after receiving new message, current PDCP queue
Whether it has been fully loaded with, it is ensured that current PDCP queue full load quickly triggers the random drop process flow of message.
Referring to Fig. 4, in one embodiment, the packet loss processing method of above-mentioned PDCP queue can also include as follows
Step S15:
S15 is less than or equal to maximum message segment storage quantity, then presses each new message if the sum of quantity M1 and quantity M2
Hair sequence is stored in current PDCP queue.
Specifically, work as the sum of quantity M1 and quantity M2, when being less than or equal to maximum message segment storage quantity, in other words, when
Preceding PDCP queue can also be stored in all new messages, without to all reports in the case where storing the message deposited
Text carries out random drop processing.In this way, PDCP layers after the current PDCP queue of determination can be stored in all new messages, it can will
The sequence that all new messages are issued according to upper layer is sequentially stored into current PDCP queue, to wait subsequent data processing.
Can S15 through the above steps can quickly determine the new message given for upper layer, all be stored in current
PDCP queue, and meet the storage limitation of the current PDCP queue.In this way, can greatly reduce because PDCP layers are taken random drop
Strategy, the additional consumption problem of possible system operations resource optimizes the resource utilization of base station equipment.
Referring to Fig. 5, in one embodiment, about in above-mentioned step 14 new message and current PDCP queue
In the message deposited, the process of the N number of message of random drop can specifically include following processing step:
Respectively new message is numbered with the message distribution deposited；
Random function is called according to each number, chosen at random from new message and the message deposited and deletes N number of message.
Wherein, random function can be any one in the random function of all kinds of common types in this field, specifically can be with
It is selected according to indexs such as base station computing capability, data processing speed, O&M cost and program complexities, in this specification
It is not especially limited.Above-mentioned number can be digital number, be also possible to the number of alphabetical form, can with when other symbols
The number of form, as long as can be by random function directly or indirectly use.PDCP layers can be same when receiving new message
Step distribution number, can also after receiving new message, unified before executing packet loss processing current all messages are carried out
Number distribution, as long as random function can be facilitated to carry out choosing processing at random using each number.
PDCP layers are appreciated that in the treatment process for executing random drop to each message, random function can be passed through
It calls to realize choosing at random for message, and then deletes the message being selected randomly.Specifically, PDCP layers can for new message with
And all messages deposited distribute different numbers.It in other words, is all reports deposited in current PDCP queue in PDCP layers
Text, and all new messages of storage are waited, distribution is corresponding respectively numbers, so that each message both corresponds to a number,
And the number between each message is all different.PDCP layers, by calling random function, the volume of each message are inputted to random function
Number, thus the N number of number chosen at random.In this way, PDCP layers i.e. using the N number of number chosen at random to each message into
Row retrieval finds the corresponding N number of message of N number of number institute chosen at random, namely chooses the N number of message that will be abandoned.Most
Afterwards, PDCP layers the N number of message chosen at random is deleted, completes packet loss processing.
By above-mentioned processing step, PDCP layers can efficiently complete the random of message and choose i.e. delete processing, mention significantly
The random drop treatment effeciency of high message is preferably avoided and new message of queue tail etc. is abandoned or directly abandoned using time-out
The problem of TCP flow amount present in discard processing mode declines obtains storage forwarding, to more have in which can make new message part
Eliminate to effect the deficiency of TCP flow amount decline.
In one embodiment, above-mentioned number is the natural number number for being incremented by or successively decreasing.It is appreciated that in this implementation
In example, PDCP layer can using being incremented by or the natural number of production decline law is numbered, to be numbered processing for each message, such as when
When the message total amount deposited in new message and current PDCP queue is 15, PDCP layers of elder generation can be issued to according to each message
Sequence afterwards is followed successively by the digital number that each message distributes 1 to 15 or 15 to 1.In this way, coming to be each using natural number number
Allocation processing is numbered in a message, can to avoid additional number information conversion process simultaneously, can make PDCP layers call with
Each number is directly used when machine function, that improves message chooses treatment effeciency at random, reduces the consumption of system operations resource.
Referring to Fig. 6, in one embodiment, the packet loss processing method of above-mentioned PDCP queue can also include
Following processing step S16:
S16 is abandoned each new message by transmitting sequence deposit if N number of message of random drop is the message deposited
Current PDCP queue after message.
It is appreciated that PDCP layers can also be each to what is be dropped after PDCP layers execute random drop processing to each message
Message is identified, belongs to the message deposited in new message or current PDCP queue by the message of random drop to determine.Example
Such as, but not limited to, by the receiving time or sequence number according to each message, determines and new message is belonged to also by the message of random drop
It is the message deposited in current PDCP queue.
When the N number of message for determining random drop is the message deposited, PDCP layers can be directly by each new message, by upper
The sequence that issues of layer is sequentially stored into the current PDCP queue after dropping packets, the current PDCP team after discard processing can be obtained
Column.In this way, S16 through the above steps, PDCP layers can effectively determine and belong to current PDCP team by the message of random drop
When the message deposited in column, the current PDCP queue in storage vacancy enough will be directly generated after each new message deposit dropping packets
In, the current PDCP queue after obtaining discard processing, to improve the reliability of packet loss processing.
Referring to Fig. 7, in one embodiment, the packet loss processing method of above-mentioned PDCP queue can also include
Following processing step S17:
S17, if in N number of message of random drop, part of message is the message deposited, another part message is new report
Text, then by remaining new message by the current PDCP queue after giving sequence deposit dropping packets.
In the N number of message for determining random drop, the message of some is the message deposited, remaining another part report
When Wen Weixin message, undiscarded each new message can be sequentially stored into dropping packets by the sequence that upper layer issues by PDCP layers
Current PDCP queue in current PDCP queue afterwards, after discard processing can be obtained.In this way, S17 through the above steps,
PDCP layers can effectively determine in the message by random drop, and the message of some is the message deposited, remaining another portion
When point message is new message, the current PDCP queue in storage vacancy enough will be generated after remaining each new message deposit dropping packets
In, the current PDCP queue after obtaining discard processing, to improve the reliability of packet loss processing.
In order to be more convenient for understanding the packet loss processing method of above-mentioned PDCP queue, in the present embodiment, such as Fig. 8 institute
Show, by taking upper layer is GTP layers as an example, the packet loss processing method of above-mentioned PDCP queue carried out detailed for example:
PDCP layers receive after GTP layers of downlink message (namely new message)；The number X of the PDCP layers of new message of acquisition,
It obtains the number Y for the message that current PDCP queue has been deposited and obtains the maximum message segment storage quantity Z of current PDCP queue.PDCP
Layer judges whether X+Y is greater than Z: if so, random screening X+Y-Z from all messages (new message and the message deposited),
And the message chosen is deleted, to discharge the memory space of current PDCP queue.By the not selected and new message of remainder that is deleting
It is stored among the current PDCP queue according to GTP layers of transmitting sequence.If it is not, then by all new messages directly according under GTP layers
Hair sequence is stored among the current PDCP queue.
Wherein, the process of random screening, which may is that, carries out unified number to the message for waiting the new message of caching and having deposited
Number, such as since 1, X+Y is gradually incremented to for step-length with 1；Then through random function from number collection [1, X+Y], with
Machine selects (X+Y-Z) a digital number；Subsequently following table retrieval is carried out according to the digital number selected (namely to be assigned with currently
Retrieval is numbered in all messages of number, to find message corresponding to the digital number selected, to choose these choosings
Message corresponding to digital number out) and delete the message chosen that is retrieved.Complete above-mentioned message random drop processing
Afterwards, subsequent general protocol processes can be carried out for PDCP layers, such as the message in current PDCP queue is unziped it (if
Open compression function), decryption (if having turned on decryption function) reconciliation PDCP SN (sequence number) handle, and to uplink PDCP
SDU (service Data Unit, service data unit) reorders etc..
Although should be understood that each step in the flow chart of Fig. 2, Fig. 3, Fig. 4, Fig. 6, Fig. 7 and Fig. 8 according to arrow
Instruction successively show that but these steps are not that the inevitable sequence according to arrow instruction successively executes.Unless having herein
Explicitly stated, there is no stringent sequences to limit for the execution of these steps, these steps can execute in other order.And
And at least part step in Fig. 2, Fig. 3, Fig. 4, Fig. 6, Fig. 7 and Fig. 8 may include multiple sub-steps or multiple stages,
These sub-steps or stage are not necessarily to execute completion in synchronization, but can execute at different times, these
Sub-step perhaps the stage execution sequence be also not necessarily successively carry out but can be with the son of other steps or other steps
Step or at least part in stage execute in turn or alternately.
Referring to Fig. 9, in one embodiment, a kind of packet loss processing unit 100 of PDCP queue is also provided, including
Message receiving module 11 and discard processing module 13.Wherein, message receiving module 11 is for receiving the new message that upper layer issues.It loses
Processing module 13 is abandoned to be used in current PDCP queue full load, in the message that new message and current PDCP queue have been deposited,
The N number of message of random drop.Wherein, N=A-B, A are the total quantity of new message and the message deposited, and B is current PDCP queue
Maximum message segment storage quantity.
The packet loss processing unit 100 of above-mentioned PDCP queue has been expired by the cooperation of each module in current PDCP queue
Carry and there are in the case where new message, the message deposited with new message and current PDCP queue as a whole, from all messages
Middle progress random drop processing.In this way, the storage of the current PDCP queue after making remaining each message be able to satisfy discard processing
Limitation simultaneously, is avoided and is abandoned or directly abandoned present in the discard processings modes such as the new message of queue tail using time-out
The problem of TCP flow amount declines obtains storage forwarding in which can make new message part, to effectively eliminate the decline of TCP flow amount
It is insufficient.The efficiency of transmission and transmission stability of base station equipment are improved, reduces the access of other communication equipments to the negative of network
It influences.
The specific restriction of packet loss processing unit 100 about PDCP queue may refer to above for PDCP queue
Packet loss processing method restriction, details are not described herein.It is each in the packet loss processing unit 100 of above-mentioned PDCP queue
A module can be realized fully or partially through software, hardware and combinations thereof.Above-mentioned each module can be embedded in the form of hardware or
Independently of in the processor in computer equipment, can also be stored in a software form in the memory in computer equipment, with
It is called convenient for processor and executes the corresponding operation of the above modules.
In one embodiment, above-mentioned discard processing module includes numbering module and delete processing module.Wherein, it compiles
Number processing module is numbered for being respectively new message with the message distribution deposited.Delete processing module is used to be called according to each number
Random function is chosen at random from new message and the message deposited and deletes N number of message.By above-mentioned numbering module and
The collaboration of delete processing module, PDCP layers can efficiently complete the random of message and choose i.e. delete processing, greatly improve message
Random drop treatment effeciency is preferably avoided and the discard processings such as the new message of queue tail is abandoned or directly abandoned using time-out
The problem of TCP flow amount present in mode declines obtains storage forwarding, to more effectively eliminate in which can make new message part
The deficiency of TCP flow amount decline.
In one embodiment, the packet loss processing unit 100 of above-mentioned PDCP queue can also include that quantity obtains
Module and fully loaded determining module.Wherein, quantity obtains the number that module is used to obtain the quantity M1 of new message, the message deposited respectively
Measure M2 and maximum message segment storage quantity.Fully loaded determining module is used to be greater than maximum message segment in the sum of quantity M1 and quantity M2 and store
When quantity, determine that current PDCP queue has been fully loaded with.Module and fully loaded determining module are obtained by above-mentioned quantity, and PDCP layers can be with
It quickly determines, after receiving new message, whether current PDCP queue has been fully loaded with, it is ensured that current PDCP queue full load quickly touches
Transmit messages text random drop process flow.
In one embodiment, fully loaded determining module is also used to be less than or equal to maximum in the sum of quantity M1 and quantity M2
When packet storage quantity, each new message is stored in current PDCP queue by transmitting sequence.By above-mentioned fully loaded determining module, also
It can quickly determine the new message given for upper layer, can all be stored in current PDCP queue, and meet the current PDCP team
The storage of column limits.In this way, the strategy for taking random drop because of PDCP layers can be greatly reduced, possible system operations money
The additional consumption problem in source, optimizes the resource utilization of base station equipment.
In one embodiment, the packet loss processing unit 100 of above-mentioned PDCP queue can also include queue processing
Module.Queue processing module is used for when N number of message of random drop is the message deposited, and each new message is pressed transmitting sequence
Current PDCP queue after being stored in dropping packets.By queue processing module, PDCP layers can effectively be determined by random drop
When message belongs to the message deposited in current PDCP queue, directly storage enough will be generated after each new message deposit dropping packets
In the current PDCP queue in vacancy, current PDCP queue after obtaining discard processing, to improve the reliable of packet loss processing
Property.
In one embodiment, above-mentioned queue processing module is used in N number of message of random drop, and part of message is
The message deposited, when another part message is new message, by remaining new message by working as after giving sequence deposit dropping packets
Preceding PDCP queue.By queue processing module, PDCP layers can effectively be determined in the message by random drop, the report of some
The message that Wen Weiyi is deposited when remaining another part message is new message, will produce after remaining each new message deposit dropping packets
In the current PDCP queue in the raw vacancy of storage enough, the current PDCP queue after obtaining discard processing, to improve packet loss
The reliability of processing.
In one embodiment, a kind of base station equipment, including memory and processor are also provided, memory is stored with calculating
Machine program, processor performs the steps of when executing computer program receives the new message that upper layer issues；If current PDCP queue
It has been be fully loaded with that, then in the message that new message and current PDCP queue have been deposited, the N number of message of random drop；Wherein, N=A-B, A are
The total quantity of new message and the message deposited, B are the maximum message segment storage quantity of current PDCP queue.
Base station equipment in the present embodiment can be all kinds of packet loss for being related to PDCP layers in mobile communication technology field
The base station equipment of processing, such as, but not limited to various base station equipment or 5G mobile communication used in LTE mobile communication system
Various base station equipment used in system.It will be understood by those skilled in the art that the base station equipment in the present embodiment is except above-mentioned
It can also include other component parts outside memory and processor, it specifically can be according to the structure group of each model base station equipment
At and its function determine, explanation is no longer unfolded in this specification one by one.
In one embodiment, a kind of computer readable storage medium is also provided, computer program is stored thereon with, is calculated
Machine program performs the steps of when being executed by processor receives the new message that upper layer issues；If current PDCP queue has been fully loaded with,
In the message that new message and current PDCP queue have been deposited, the N number of message of random drop；Wherein, N=A-B, A be new message with
And the total quantity for the message deposited, B are the maximum message segment storage quantity of current PDCP queue.
Those of ordinary skill in the art will appreciate that realizing all or part of the process in above-described embodiment method, being can be with
Instruct relevant hardware to complete by computer program, computer program to can be stored in a non-volatile computer readable
It takes in storage medium, the computer program is when being executed, it may include such as the process of the embodiment of above-mentioned each method.Wherein, this Shen
Please provided by any reference used in each embodiment to memory, storage, database or other media, may each comprise
Non-volatile and/or volatile memory.Nonvolatile memory may include read-only memory (ROM), programming ROM
(PROM), electrically programmable ROM (EPROM), electrically erasable ROM (EEPROM) or flash memory.Volatile memory may include
Random access memory (RAM) or external cache.By way of illustration and not limitation, RAM is available in many forms,
Such as static state RAM (SRAM), dynamic ram (DRAM), synchronous dram (SDRAM), double data rate sdram (DDRSDRAM), enhancing
Type SDRAM (ESDRAM), synchronization link (Synchlink) DRAM (SLDRAM), memory bus (Rambus) direct RAM
(RDRAM), direct memory bus dynamic ram (DRDRAM) and memory bus dynamic ram (RDRAM) etc..
Each technical characteristic of embodiment described above can be combined arbitrarily, for simplicity of description, not to above-mentioned reality
It applies all possible combination of each technical characteristic in example to be all described, as long as however, the combination of these technical characteristics is not deposited
In contradiction, all should be considered as described in this specification.
The embodiments described above only express several embodiments of the present invention, and the description thereof is more specific and detailed, but simultaneously
It cannot therefore be construed as limiting the scope of the patent.It should be pointed out that coming for those of ordinary skill in the art
It says, without departing from the inventive concept of the premise, various modifications and improvements can be made, these belong to protection of the invention
Range.Therefore, the scope of protection of the patent of the invention shall be subject to the appended claims.
Claims (10)
1. a kind of packet loss processing method of PDCP queue characterized by comprising
Receive the new message that upper layer issues；
If current PDCP queue has been fully loaded with, in the message that the new message and the current PDCP queue have been deposited, at random
Abandon N number of message；
Wherein, N=A-B, A are the total quantity of the new message and the message deposited, and B is the current PDCP queue
Maximum message segment storage quantity.
2. the packet loss processing method of PDCP queue according to claim 1, which is characterized in that the new message with
And in the message deposited of the current PDCP queue, the process of the N number of message of random drop includes:
The respectively described new message is numbered with the message distribution deposited；
Random function is called according to each number, is chosen at random from the new message and the message deposited and deletes N
A message.
3. the packet loss processing method of PDCP queue according to claim 1 or 2, which is characterized in that the method is also
Include:
If N number of message of random drop is the message deposited, each new message is stored in by transmitting sequence
The current PDCP queue after dropping packets.
4. the packet loss processing method of PDCP queue according to claim 1 or 2, which is characterized in that the method is also
Include:
If in N number of message of random drop, part of message is the message deposited, another part message is described new
Message, then by the remaining new message by the current PDCP queue after giving sequence deposit dropping packets.
5. the packet loss processing method of PDCP queue according to claim 1, which is characterized in that the method is also wrapped
It includes:
The quantity M2 of the quantity M1, the message deposited that obtain the new message respectively and the maximum message segment storage quantity；
If the sum of the quantity M1 and the quantity M2, it is greater than the maximum message segment storage quantity, it is determined that the current PDCP
Queue has been fully loaded with.
6. the packet loss processing method of PDCP queue according to claim 5, which is characterized in that the method is also wrapped
It includes:
If the sum of the quantity M1 and the quantity M2, be less than or equal to the maximum message segment storage quantity, then it will be each described new
Message is stored in the current PDCP queue by transmitting sequence.
7. a kind of packet loss processing unit of PDCP queue characterized by comprising
Message receiving module, the new message issued for receiving upper layer；
Discard processing module, in current PDCP queue full load, in the new message and the current PDCP queue
In the message deposited, the N number of message of random drop；
Wherein, N=A-B, A are the total quantity of the new message and the message deposited, and B is the current PDCP queue
Maximum message segment storage quantity.
8. the packet loss processing unit of PDCP queue according to claim 7, which is characterized in that the discard processing mould
Block includes:
Numbering module is numbered for being respectively the new message with the message distribution deposited；
Delete processing module, for calling random function according to each number, from the new message and the message deposited
In choose at random and delete N number of message.
9. a kind of base station equipment, including memory and processor, the memory are stored with computer program, which is characterized in that
The processor realizes that the message of PDCP queue described in any one of claims 1 to 6 is lost when executing the computer program
The step of abandoning processing method.
10. a kind of computer readable storage medium, is stored thereon with computer program, which is characterized in that the computer program
The step of packet loss processing method of PDCP queue described in any one of claims 1 to 6 is realized when being executed by processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910389039.XA CN110138680B (en) | 2019-05-08 | 2019-05-08 | Method and device for discarding packet of PDCP queue and base station equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910389039.XA CN110138680B (en) | 2019-05-08 | 2019-05-08 | Method and device for discarding packet of PDCP queue and base station equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110138680A true CN110138680A (en) | 2019-08-16 |
| CN110138680B CN110138680B (en) | 2022-08-23 |
Family
ID=67573216
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910389039.XA Active CN110138680B (en) | 2019-05-08 | 2019-05-08 | Method and device for discarding packet of PDCP queue and base station equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110138680B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115695583A (en) * | 2022-05-08 | 2023-02-03 | 荣耀终端有限公司 | Data transmission method and electronic equipment |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101616129A (en) * | 2008-06-27 | 2009-12-30 | 成都市华为赛门铁克科技有限公司 | The methods, devices and systems of anti-network attack flow overload protection |
| CN103229466A (en) * | 2012-12-27 | 2013-07-31 | 华为技术有限公司 | Data packet transmission method and device |
| CN104580008A (en) * | 2015-01-07 | 2015-04-29 | 盛科网络（苏州）有限公司 | Method and device for improving multi-queue random message discarding accuracy based on hardware |
| CN106603426A (en) * | 2015-10-19 | 2017-04-26 | 大唐移动通信设备有限公司 | Message discarding method and device |
| CN107508655A (en) * | 2017-07-19 | 2017-12-22 | 西南交通大学 | A kind of adaptive end to end network coding and transmission method |
-
2019
- 2019-05-08 CN CN201910389039.XA patent/CN110138680B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101616129A (en) * | 2008-06-27 | 2009-12-30 | 成都市华为赛门铁克科技有限公司 | The methods, devices and systems of anti-network attack flow overload protection |
| CN103229466A (en) * | 2012-12-27 | 2013-07-31 | 华为技术有限公司 | Data packet transmission method and device |
| CN104580008A (en) * | 2015-01-07 | 2015-04-29 | 盛科网络（苏州）有限公司 | Method and device for improving multi-queue random message discarding accuracy based on hardware |
| CN106603426A (en) * | 2015-10-19 | 2017-04-26 | 大唐移动通信设备有限公司 | Message discarding method and device |
| CN107508655A (en) * | 2017-07-19 | 2017-12-22 | 西南交通大学 | A kind of adaptive end to end network coding and transmission method |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115695583A (en) * | 2022-05-08 | 2023-02-03 | 荣耀终端有限公司 | Data transmission method and electronic equipment |
| CN115695583B (en) * | 2022-05-08 | 2023-12-01 | 荣耀终端有限公司 | Data transmission method and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110138680B (en) | 2022-08-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103838552B (en) | The process system and method for 4G wide-band communication system multi-core parallel concurrent pipelined digital signal | |
| CN101305564B (en) | Provision of move indication to resource requester | |
| CN106134147A (en) | Realize the delivery acceleration device of request manager and connection manager function | |
| CN102149140B (en) | End-to-end multi-link parallel transmission network control method | |
| CN101932128A (en) | Data receiving, transmitting and processing method and equipment for data link layer | |
| CN103906257A (en) | LTE broadband communication system calculation resource dispatcher based on GPP and dispatching method thereof | |
| CN107733813B (en) | Message forwarding method and device | |
| CN107005560A (en) | A kind of data transmission method for uplink, data receiver method and relevant device | |
| CN110062425A (en) | Control method, device, computer equipment and the storage medium of network transmission speed | |
| CN107634908A (en) | A kind of method and apparatus of data transfer | |
| WO2012050912A1 (en) | System and method for proactive resource allocation | |
| CN103782554A (en) | Data shunting method, data transmission device and shunting node device | |
| CN108631947A (en) | A kind of RDMA network data transmission methods based on correcting and eleting codes | |
| CN101507336A (en) | Method and arrangement for access selection in a multi-access communications system | |
| CN110138680A (en) | Packet loss processing method, device and the base station equipment of PDCP queue | |
| CN108616925A (en) | A kind of processing method and processing device of data flow | |
| CN101123580A (en) | Packet transmission method and base station device | |
| CN102098170B (en) | Data acquisition optimization method and system | |
| CN1893686A (en) | Method for retesting net-element in shortmessage system | |
| CN104468656A (en) | Mobile data downloading method, mobile data downloading system, mobile data uploading method and mobile data uploading system | |
| CN101651658A (en) | Method, device and system for cross-layer joint optimization in wireless Mesh network | |
| CN101150354A (en) | Message dispatching method and device | |
| CN107484204A (en) | Base station uplink burst alleviates method and device | |
| CN114499777B (en) | Data transmission method for cluster unmanned system | |
| AU2013347470A1 (en) | Traffic management scheduling method and apparatus |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20200113 Address after: 510663 Shenzhou Road 10, Guangzhou Science City, Guangzhou economic and Technological Development Zone, Guangzhou, Guangdong Applicant after: COMBA TELECOM SYSTEMS (CHINA) Ltd. Address before: 510663 Shenzhou Road 10, Guangzhou Science City, Guangzhou economic and Technological Development Zone, Guangzhou, Guangdong Applicant before: COMBA TELECOM SYSTEMS (CHINA) Ltd. Applicant before: COMBA TELECOM SYSTEMS (GUANGZHOU) Ltd. Applicant before: COMBA TELECOM TECHNOLOGY (GUANGZHOU) Ltd. Applicant before: TIANJIN COMBA TELECOM SYSTEMS Ltd. |
|
| TA01 | Transfer of patent application right | ||
| CB02 | Change of applicant information |
Address after: 510663 Shenzhou Road 10, Guangzhou Science City, Guangzhou economic and Technological Development Zone, Guangzhou, Guangdong Applicant after: Jingxin Network System Co.,Ltd. Address before: 510663 Shenzhou Road 10, Guangzhou Science City, Guangzhou economic and Technological Development Zone, Guangzhou, Guangdong Applicant before: COMBA TELECOM SYSTEMS (CHINA) Ltd. |
|
| CB02 | Change of applicant information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |