CN102271088B - Data packet processing method and equipment - Google Patents
Data packet processing method and equipment Download PDFInfo
- Publication number
- CN102271088B CN102271088B CN201110234450.3A CN201110234450A CN102271088B CN 102271088 B CN102271088 B CN 102271088B CN 201110234450 A CN201110234450 A CN 201110234450A CN 102271088 B CN102271088 B CN 102271088B
- Authority
- CN
- China
- Prior art keywords
- packet
- value
- token
- parameter value
- tcnew
- 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.)
- Active
Links
Images
Abstract
The embodiment of the invention discloses a data packet processing method and equipment relating to the technical field of wireless communication. The data packet processing method and equipment are used for solving the problem for carrying out flow reformation on a data stream. In the invention, when the data packet arrives, the equipment confirms whether the data packet is forwarded or the data packet is discarded according to a single-rate single-token bucket SRTCM algorithm; and the data packet is forwarded or the data packet is discarded according to the firmed result. By adopting the data packet processing method and equipment, the problem for carrying out flow reformation on the data stream can be solved.
Description
Technical field
The present invention relates to wireless communication field, relate in particular to a kind of data package processing method and equipment.
Background technology
In TS23.203 agreement, other quality of service of carrying level (Quality of Service has been described, QoS) parameter, specifically comprise QoS classification logotype (QoS Class Identifier, QCI), priority (the Allocation and Retention Priority that distributes and keep, ARP), guarantee bit rate (Guaranteed Bit Rate, GBR), maximum bit rate (Maximum Bit Rate, MBR), Aggregate Maximum Bit Rate (Aggregate Maximum Bit Rate, AMBR) etc.
Evolved packet system (Evolved Packet System, EPS) carrying comprises GBR carrying and non-GBR (Non-GBR) carrying.Each EPS carrying and QCI parameter correlation connection.QCI is a quantity grade, is used for representing an access point parameters of controlling the else bag transmission process of carrying level.
In addition, each GBR carrying also joins with GBR and MBR parameter correlation.The bit rate that can be provided by GBR carrying of expection has been provided GBR.MBR has limited the bit rate that GBR carrying can provide.
It is that AMBR is associated with other qos parameter of IP-CAN session level that each Packet Data Network (Packet Data Network, PDN) connects.A plurality of EPS carryings that identical PDN connects can share identical AMBR value.When other EPS carrying does not transmit any business, each carrying in these EPS carryings can utilize whole AMBR potentially.All EPS that AMBR has limited shared AMBR carry the gross bit rate that can be provided.AMBR is applied to all Non-GBR carryings that identical PDN connects, and in base station, (eNB) completes AMBR control to uplink service, and downlink business completes AMBR at packet data gateway (PDN GW, P-GW) and controls.
GBR, MBR and AMBR parameter are partly comprised of uplink and downlink respectively.
Evolved packet system signing service quality in subscription data is described (EPS subscribed QoS profile) and is directed to each Access Point Name (the Access Point Name to contracted user's license, APN), the QCI and the ARP parameter that specifically comprise the default bearer of this APN, and the AMBR parameter of this APN.
An IP connects Access Network session (IP-Connectivity Access Network session, IP-CANsession) be exactly that a PDN connects, a PDN connects can comprise a default bearing and a plurality of dedicated bearer, a UE can be connected to one or more APN, an APN can access a plurality of UE, a UE has at most 11 carryings, and each carrying has at most 16 server data stream (SDF).
The qos parameter of business-level comprises QCI, ARP, GBR and MBR.Only with one QCI of each SDF is associated.A plurality of SDFs corresponding with identical IP-CAN session, if having identical QCI and ARP value, can be used as an incompatible processing of independent services sets, SDF set that Here it is.Following table has illustrated the corresponding relation between standard feature and standard QCI value.
These characteristic descriptions SDF gather corresponding bag and transmit disposition, specific as follows:
Resource class (Resource Type) has determined that can the proprietary network resource relevant to business or other GBR value of carrying level be distributed consistently.The SDF set of GBR needs dynamic strategy and charging to control, and the SDF of Non GBR set can only be controlled by static strategy and charging.
Each QCI and a priority level (Priority) are associated.Priority level 1 is the highest priority level.Priority level is used for distinguishing the SDF set of identical UE, is also used for distinguishing the SDF set of different UEs.
Packet postpones expection (Packet Delay Budget, PDB) and has represented the time that packet may be delayed between user terminal (UE) and P-GW.For some QCI, the value of PDB is identical in uplink and downlink direction.The object of PDB is to support the configuration of sequential and link layer functionality.
Use the business of Non-GBR QCI should be able to experience the congested packet loss causing; If use the business transmission rate of GBR QCI to be less than or equal to GBR, generally can suppose that the congested packet loss causing will can not occur.The congested packet abandoning that causes do not have because still may suffer the packet loss (seeing the PLR the following describes) under non-congestion situation.
Packet loss (Packet Loss Rate, PLR) has defined and has been sent out end link layer process but does not have receiving end to be successfully sent to the upper limit of ratio of the service data unit (Service Data Unit, SDU) of last layer.PLR has illustrated the higher limit of data-bag lost speed under non-congestion situation.The object of PLR is to consider suitable link layer protocol configuration.For some QCI, the value of PLR is identical in uplink and downlink direction.
In realizing process of the present invention, inventor finds to exist in prior art following technical problem:
In transfer of data, need upstream or downstream data flow to carry out traffic shaping, adjust the output speed of data flow, to meet the throughput requirement of equipment, but the current specific implementation that also there is no traffic shaping.
Summary of the invention
The embodiment of the present invention provides a kind of data package processing method and equipment, for solving the problem of how data stream being carried out traffic shaping.
, the method comprises:
When packet arrives, according to single-rate list token bucket SRTCM algorithm, determine and forward described packet or abandon described packet;
According to definite result, forward described packet or abandon described packet.
, this device comprises:
Determining unit, for when packet arrives, determines and forwards described packet or abandon described packet according to single-rate list token bucket SRTCM algorithm;
Processing unit, for forwarding described packet or abandon described packet according to definite result.
A PGW equipment, this PGW equipment comprises described data packet processing.
In this programme, when packet arrives, according to SRTCM algorithm, determine and forward described packet or abandon described packet, and forward described packet or abandon described packet according to definite result.This programme is determined the packet that forwards or abandon arrival according to SRTCM algorithm, therefore can adjust the probability that packet is forwarded or abandons by adjusting parameter value in SRTCM algorithm, thereby adjust the output speed of data flow, the probability that packet is forwarded is larger, the output speed of data flow is larger, the probability that packet is forwarded is less, and the output speed of data flow is less, and then has reached the object of data stream being carried out to traffic shaping.
Accompanying drawing explanation
The method flow schematic diagram that Fig. 1 provides for the embodiment of the present invention;
Fig. 2 A is the schematic flow sheet of the embodiment of the present invention one;
Fig. 2 B is the schematic flow sheet of the embodiment of the present invention two;
Fig. 2 C is the schematic flow sheet of the embodiment of the present invention three;
Fig. 2 D is a token bucket schematic diagram in the embodiment of the present invention three;
Fig. 2 E is another token bucket schematic diagram in the embodiment of the present invention three;
Fig. 2 F is another token bucket schematic diagram in the embodiment of the present invention three;
The device structure intention that Fig. 3 provides for the embodiment of the present invention.
Embodiment
In order to realize the scheme of data stream being carried out to traffic shaping, the embodiment of the present invention provides a kind of data package processing method, in this method, uses single-rate list token bucket (SRTCM) algorithm to carry out traffic shaping.
Referring to Fig. 1, the data package processing method that the embodiment of the present invention provides, comprises the following steps:
Step 10: when packet arrives, determine and forward described packet or abandon described packet according to SRTCM algorithm;
Step 11: forward described packet or abandon described packet according to definite result.Concrete, if determine, result, for forwarding described packet, forwards this packet, if determine, result, for abandoning described packet, abandons this packet.
In step 10, according to SRTCM algorithm, determine and forward described packet or abandon described packet, specific implementation can be adopted with the following method:
First, according to the length of described packet, determine the number B of the token of described packets need; According to time difference and predefined guarantee information speed (CIR) parameter value of nearest twice packet time of advent, determining need to be to the token number Ts increasing in token bucket; CIR is for representing the parameter of the maximum data rate that current bandwidth condition allows, and the value of CIR can preset according to actual needs.
Then, determine the token number Tc sum in Ts and current token bucket, whether be greater than predefined assurance burst sizes (CBS) parameter value, and according to the value of determining result parameters Tcnew; The initial value of Tc is CBS; CBS is for representing the total number of bits of all packets that burst arrives, and the value of CBS can preset according to actual needs, and in general the value of CBS can be greater than the value of CIR; Tcnew is the needed intermediate parameters of algorithm;
Finally, determine whether B is greater than the value of Tcnew, if so, abandon described packet, and upgrade Tc, the Tc after renewal equals Tc and the Ts sum before renewal; Otherwise, determining and forward described packet, and upgrade Tc, the Tc after renewal equals the difference of Tcnew and B.
The specific implementation of the value of above-mentioned parameters Tcnew can adopt following three kinds of methods:
The first, when described packet is the packet in non-GBR carrying, described CIR parameter value equals this non-GBR and carries corresponding APN-AMBR; The time difference of described nearest twice packet time of advent is: the time difference of current PDN connects lower all non-GBR in carrying nearest twice packet time of advent; For example, on connecting, current PDN exist 3 non-GBR carryings to be connected with 1 GBR, the packet 1, the packet 2 in non-GBR carrying 2, the packet 3 in GBR carrying, the non-GBR that according to order from morning to night, have arrived successively in following 4 packet: non-GBR carrying 1 carry the packet 4 on 3, so, in all non-GBR carryings under current PDN connects, the packet of nearest twice arrival is packet 4, packet 2, and the described time difference is the poor of the time of advent of packet 4 and the time of advent of packet 3.
If the token number Tc sum in Ts and current token bucket, is less than or equal to predefined CBS parameter value, the value of parameters Tcnew equals Ts and Tc sum;
If the token number Tc sum in Ts and current token bucket, is greater than predefined CBS parameter value, the value of parameters Tcnew equals CBS.
The second, when described packet is the packet in GBR carrying, described CIR parameter value equals this GBR and carries corresponding MBR; The time difference of described nearest twice packet time of advent is: the time difference of nearest twice packet time of advent in this GBR carrying; For example, this GBR is carried as carrying 1, also there is carrying 2 simultaneously, carry 3, according to order from morning to night, following 4 packets have been arrived successively: carry packet 1 on 1, carry packet 2 on 2, carry the packet 3 on 1, the packet 4 in GBR carrying 3, so, in carrying 1, the packet of nearest twice arrival is packet 3, packet 1, and the described time difference is the poor of the time of advent of packet 3 and the time of advent of packet 1.
If the token number Tc sum in Ts and current token bucket, is less than or equal to predefined CBS parameter value, the value of parameters Tcnew equals Ts and Tc sum;
If the token number Tc sum in Ts and current token bucket, is greater than predefined CBS parameter value, the value of parameters Tcnew equals CBS.
The third, described CIR parameter value and described CBS parameter value equal current available bandwidth value, i.e. current remaining bandwidth value; The time difference of described nearest twice packet time of advent is: the time difference of nearest twice packet time of advent in all carryings in current PDN connection; For example, in current PDN connection, there is carrying 1, carrying 2 and carrying 3, according to order from morning to night, following 4 packets have been arrived successively: carry packet 1 on 1, carry packet 2 on 2, carry the packet 3 on 1, the packet 4 in GBR carrying 3, so, in all carryings in current PDN connection, the packet of nearest twice arrival is packet 4, packet 4, and the described time difference is the poor of the time of advent of packet 4 and the time of advent of packet 3.
If the token number Tc sum in Ts and current token bucket, is less than or equal to predefined CBS parameter value, the value of parameters Tcnew equals the summed result of Ts and Tc and distributes the difference of bandwidth value, the described bandwidth value that distributed equals priority in current PDN connection higher than shaping parameter value sum of each carrying of carrying corresponding to described packet, and for non-GBR carrying, this shaping parameter value is APN-AMBR, and for GBR carrying, this shaping parameter value is MBR, for example, the non-GBR that is carried as that described packet is corresponding carries 1, in current PDN connection, also there is non-GBR carrying 2 simultaneously, non-GBR carrying 3, GBR carrying 4, according to priority order from high to low, arranging above-mentioned 4 is carried as: GBR carrying 4, non-GBR carrying 3, non-GBR carrying 2, non-GBR carrying 1, so, describedly distributed bandwidth value to equal the MBR that GBR carries 4 correspondences to carry 2 corresponding APN-AMBR with non-GBR, non-GBR carries the APN-AMBR sum of 3 correspondences, also be, Tcnew=Ts+Tc-(APN-AMBR+non-GBR that the MBR+non-GBR that GBR carries 4 correspondences carries 2 correspondences carries the APN-AMBR of 3 correspondences),
If the token number Tc sum in Ts and current token bucket, is greater than predefined CBS parameter value, the value of parameters Tcnew equals CBS.
The above-mentioned number B that determines the token of described packets need, its specific implementation can be as follows: the number B that the bit length value of described packet is defined as to the token of described packets need.
It is above-mentioned that determine need to be to the token number Ts increasing in token bucket, its specific implementation can be as follows: by described, according to the time difference of nearest twice packet time of advent and the product of predefined CIR parameter value, being defined as need to be to the token number Ts increasing in token bucket.
In this method, described packet is upstream data bag or downlink data packet.The executive agent of the method can be packet data gateway (PDN GW, PGW), can certainly be other any main bodys that need to carry out traffic shaping.
Below in conjunction with specific embodiment, the present invention will be described:
Embodiment mono-:
The present embodiment is the traffic shaping for non-GBR carrying, has applied the SRTCM algorithm after improving.
APN-AMBR is the CAMEL-Subscription-Information that is stored in each APN in home signature user server (HSS).Upper at S58 interface (interface between PGW and SGW), while carrying out the traffic shaping based on carrying level, non-GBR carrying is carried out shaping according to APN-AMBR.
In TS23.401, stipulate, all non-GBR carryings that connect for the same PDN of same UE, adopt sharing A PN-AMBR mechanism to realize the utilization of resource.When this PDN has a plurality of non-GBR carryings to exist under connecting, if when some of them non-GBR carries not transport service, other movable non-GBR carrying can be shared whole APN-AMBR bandwidth resources.Because default bearing is all generally non-GBR carrying, so the non-GBR under same PDN connection carries corresponding shaping template, be generally to create when default bearing is set up.According to the data model of token bucket algorithm, do following setting:
The APN-AMBR that CIR (Committed Information Rate): PDN connects, unit is bit.
CBS (Committed Burst Size): the token number while piling token in token bucket.
Tc: the token number in token bucket, initial value is CBS.
B: the token number that data message needs, calculates according to data packet length.
Ts: need to add toward the token number in token bucket, the time difference and the CIR that connect nearest twice data message arrival in lower all non-GBR according to this PDN calculate.
As shown in Figure 2 A, idiographic flow is as follows:
Step 1:PGW determines that the downlink data packet of non-GBR carrying arrives S58 interface;
Step 2:PGW determines the token number B of this packets need according to the length of downlink data packet, in order to improve the accuracy of shaping, token number is that bit (bit) converts according to the least unit of packet, if packet is N bit, B equals N;
Step 3:PGW determines the time difference of nearest twice packet time of advent in all non-GBR carrying in current PDN connection;
Step 4:PGW determines the token number Ts that need to add toward in token bucket according to described time difference and CIR, for example, and time difference * CIR described in Ts=;
Step 5: judge whether Ts+Tc is greater than CBS, if so, arrive step 6; Otherwise, to step 7;
Step 6: new Tcnew=CBS is set; To step 8;
Step 7: new Tcnew=Ts+Tc is set; To step 8;
Step 8: judge whether B is greater than Tcnew, if so, arrive step 10; Otherwise, to step 9;
Step 9: normal converting downlink packet, to step 11.
Step 10: downlink data packet is abandoned, to step 11;
Step 11: upgrade Tc and timestamp in corresponding shaping template; Concrete, the in the situation that of normal converting downlink packet, Tc=Tcnew-B; In the situation that downlink data packet is abandoned, Tc=Ts+Tc.
Embodiment bis-:
The present embodiment is for the traffic shaping of GBR carrying, has applied SRTCM algorithm.
For each GBR carrying, all two parameters of corresponding GBR and MBR.GBR represents the bit rate that this carrying can provide.MBR represents the maximum bit rate that this carrying can provide.On S58 interface, while carrying out the traffic shaping based on carrying level, for GBR, carrying is carried out traffic shaping according to MBR.
When GBR load creating, according to this bearer QoS parameters, configure a corresponding sizing die buttress according to the data model of token bucket algorithm simultaneously, do following setting:
The MBR， unit of CIR (Committed Information Rate): GBR carrying is bit.
CBS (Committed Burst Size): the token number while piling token in token bucket.
Tc: the token number in token bucket, initial value is CBS.
B: the token number that data message needs, calculates according to data packet length.
Ts: need to add toward the token number in token bucket, calculate according to time difference and CIR that in this GBR carrying, nearest twice data message arrives.
As shown in Figure 2 B, idiographic flow is as follows:
Step 1:PGW determines that the downlink data packet of GBR carrying arrives S58 interface;
Step 2:PGW determines the token number B of this packets need according to the length of downlink data packet, in order to improve the accuracy of shaping, token number is that bit (bit) converts according to the least unit of packet, if packet is N bit, B equals N;
Step 3:PGW determines the time difference of nearest twice packet time of advent in GBR carrying;
Step 4:PGW determines the token number Ts that need to add toward in token bucket according to described time difference and CIR, for example, and time difference * CIR described in Ts=;
Step 5: judge whether Ts+Tc is greater than CBS, if so, arrive step 6; Otherwise, to step 7;
Step 6: new Tcnew=CBS is set; To step 8;
Step 7: new Tcnew=Ts+Tc is set; To step 8;
Step 8: judge whether B is greater than Tcnew, if so, arrive step 10; Otherwise, to step 9;
Step 9: normal converting downlink packet, to step 11.
Step 10: downlink data packet is abandoned, to step 11;
Step 11: upgrade Tc and timestamp in corresponding shaping template; Concrete, the in the situation that of normal converting downlink packet, Tc=Tcnew-B; In the situation that downlink data packet is abandoned, Tc=Ts+Tc.
Embodiment tri-:
The present embodiment is for the traffic shaping in the limited situation of traffic handing capacity of PGW, has applied SRTCM algorithm.To each business shared token bucket, bucket size is set to remaining bandwidth, carries out bandwidth seize according to service priority.
Agreement present situation: stipulate in TS23.203, the carrying of the bit rate guaranteeing is that to carry corresponding QCI value be 1 to 4 to GBR, the Service Processing Unit of PGW will guarantee for the GBR value of this carrying when bearing tunnel is set up, relative, the carrying of the bit rate of non-assurance is that to carry corresponding QCI value be 5 to 9 to non-GBR, the all non-GBR carryings that connect for same PDN, in order to improve the statistic multiplexing effect of bearing resource, adopt sharing A PN-AMBR mechanism to realize the utilization of resource, now Service Processing Unit need to not guarantee for the APN-AMBR bandwidth of this carrying when bearing tunnel is set up.
Configuring condition: Service Processing Unit resource is carried and first can be reserved resource for non-GBR, to all GBR carrying distribution according to need resources, along with access GBR carrying quantity increases, the in the situation that of resource-constrained, Service Processing Unit can reduce the bandwidth reserved of non-GBR carrying, until non-GBR carries not occupied bandwidth.
Business Processing situation: when the bandwidth reserved carrying for non-GBR on Service Processing Unit reduces, Service Processing Unit can not guarantee to access this non-GBR carrying bandwidth (APN-AMBR) of this APN, and now Service Processing Unit may also not used for GBR carrying leaves bandwidth.
In above situation, guaranteeing in the resource distribution basis of GBR, non-GBR carrying, the more effective resource of utilizing, now Service Processing Unit is arranged to a token bucket by remaining bandwidth, CBS is set to Service Processing Unit remaining bandwidth, and CIR speed is arranged to CBS/s, according to priority, carry out shaping algorithm on this basis.Suppose to have in current PDN connection the non-GBR carrying that non-GBR, QCI that following four carrying: GBR carrying, QCI are 5 are 8, the non-GBR carrying that QCI is 9.
As shown in Figure 2 C, idiographic flow is as follows:
Step 1:PGW determines that downlink data packet arrives S58 interface;
Step 2:PGW determines the token number B of this packets need according to the length of downlink data packet, in order to improve the accuracy of shaping, token number is that bit (bit) converts according to the least unit of packet, if packet is N bit, B equals N;
Step 3:PGW determines the time difference of nearest twice packet time of advent in all carryings in current PDN connection;
Step 4:PGW determines the token number Ts that need to add toward in token bucket according to described time difference and CIR, for example, and time difference * CIR described in Ts=;
Step 5: judge whether Ts+Tc is greater than CBS, if so, arrive step 6; Otherwise, to step 7;
Step 6: new Tcnew=CBS is set; To step 8;
Step 7: new Tcnew=Ts+Tc-is set and has distributed bandwidth value; To step 8;
Due to the priority of the GBR carrying priority higher than all non-GBR carryings, the priority of the carrying that corresponding QCI is less is higher, therefore, the packet that the downlink data packet of S58 interface is GBR carrying if arrive, this to have distributed bandwidth value be 0; If arrive the downlink data packet of S58 interface and be QCI and be the packet of 5 non-GBR carrying, this to have distributed bandwidth value be that GBR carries corresponding MBR; If arrive the downlink data packet of S58 interface and be QCI and be the packet of 8 non-GBR carrying, this to have distributed bandwidth value be that GBR carries the non-GBR that corresponding MBR is 5 with QCI and carries corresponding APN-AMBR sum; If arrive the downlink data packet of S58 interface and be QCI and be the packet of 9 non-GBR carrying, this to have distributed bandwidth value be that GBR carries non-GBR that corresponding MBR is 5 with QCI and carries the non-GBR that corresponding APN-AMBR and QCI are 8 and carry corresponding APN-AMBR sum
Step 8: judge whether B is greater than Tcnew, if so, arrive step 10; Otherwise, to step 9;
Step 9: normal converting downlink packet, to step 11.
Step 10: downlink data packet is abandoned, to step 11;
Step 11: upgrade Tc and timestamp in corresponding shaping template; Concrete, the in the situation that of normal converting downlink packet, Tc=Tcnew-B; In the situation that downlink data packet is abandoned, Tc=Ts+Tc.
The present embodiment can relate to following three kinds of situations:
One, just having started each, to carry corresponding token bucket identical, and a token bucket is seen in the carrying of different priorities, as shown in Figure 2 D:
Two, Service Processing Unit has been GBR carrying Resources allocation, the MBR value that the operable bucket size of GBR carrying is carrying configuration, because token bucket CBS is set to Service Processing Unit remaining bandwidth, and Service Processing Unit to be GBR carrying leave bandwidth, therefore in the situation that all GBR carryings do not have complete utilized bandwidth, Service Processing Unit still has remaining bandwidth to carry for non-GBR, now all non-GBR carrying is according to the priority preempting resources that takes the lead in, the non-GBR carrying that priority is identical adopts first the first scheme of service, if Service Processing Unit resource also exists, the token bucket situation that the carrying of different priorities is seen is as shown in Figure 2 E:
If three Service Processing Unit resources are used up, now guaranteeing under the prerequisite of GBR carrying bandwidth, the non-GBR carrying of higher priority takies remaining bandwidth, the non-GBR carrying of lower priority possibly cannot take Service Processing Unit and process resource, to the scheme of seizing based on priority bandwidth, this scheme is distributed according to the resource of Service Processing Unit, is guaranteeing, under the prerequisite of GBR carrying bandwidth, to have guaranteed that to greatest extent the resource of non-GBR carrying is used.Concrete condition is described as shown in Figure 2 F.
Referring to Fig. 3, the embodiment of the present invention provides a kind of data packet processing, and this device comprises:
Determining unit 30, for when packet arrives, determines and forwards described packet or abandon described packet according to single-rate list token bucket SRTCM algorithm;
Processing unit 31, for forwarding described packet or abandon described packet according to definite result.
Described determining unit 30 for:
According to the length of described packet, determine the number B of the token of described packets need; According to time difference and the predefined guarantee information speed CIR parameter value of nearest twice packet time of advent, determining need to be to the token number Ts increasing in token bucket;
Determine the token number Tc sum in Ts and current token bucket, whether be greater than predefined assurance burst sizes CBS parameter value, and according to the value of determining result parameters Tcnew; The initial value of Tc is CBS;
Determine whether B is greater than the value of Tcnew, if so, abandon described packet, and upgrade Tc, the Tc after renewal equals Tc and the Ts sum before renewal; Otherwise, determining and forward described packet, and upgrade Tc, the Tc after renewal equals the difference of Tcnew and B.
Described determining unit 30 for:
When described packet is the packet in non-assurance bit rate non-GBR carrying, described CIR parameter value equals this non-GBR and carries corresponding Access Point Name Aggregate Maximum Bit Rate APN-AMBR; The time difference of described nearest twice packet time of advent is: the time difference of current grouped data network PDN connects lower all non-GBR in carrying nearest twice packet time of advent; And the value of parameters Tcnew as follows:
If the token number Tc sum in Ts and current token bucket, is less than or equal to predefined CBS parameter value, the value of parameters Tcnew equals Ts and Tc sum;
If the token number Tc sum in Ts and current token bucket, is greater than predefined CBS parameter value, the value of parameters Tcnew equals CBS.
Described determining unit 30 for:
When described packet is the packet guaranteeing in bit rate GBR carrying, described CIR parameter value equals this GBR and carries corresponding maximum bit rate MBR; The time difference of described nearest twice packet time of advent is: the time difference of nearest twice packet time of advent in this GBR carrying; And the value of parameters Tcnew as follows:
If the token number Tc sum in Ts and current token bucket, is less than or equal to predefined CBS parameter value, the value of parameters Tcnew equals Ts and Tc sum;
If the token number Tc sum in Ts and current token bucket, is greater than predefined CBS parameter value, the value of parameters Tcnew equals CBS.
Described determining unit 30 for:
Described CIR parameter value and described CBS parameter value equal current available bandwidth value; The time difference of described nearest twice packet time of advent is: the time difference of nearest twice packet time of advent in all carryings in current PDN connection; The value of parameters Tcnew as follows:
If the token number Tc sum in Ts and current token bucket, is less than or equal to predefined CBS parameter value, the value of parameters Tcnew equals the summed result of Ts and Tc and distributes the difference of bandwidth value; The described bandwidth value that distributed equals priority in current PDN connection higher than shaping parameter value sum of each carrying of carrying corresponding to described packet, and for non-GBR carrying, this shaping parameter value is APN-AMBR, and for GBR carrying, this shaping parameter value is MBR;
If the token number Tc sum in Ts and current token bucket, is greater than predefined CBS parameter value, the value of parameters Tcnew equals CBS.
Described determining unit 30 is for the number B that determines as follows the token of described packets need: the number B that the bit length value of described packet is defined as to the token of described packets need.
Described determining unit 30 for: determine as follows the token number Ts need to increasing to token bucket: according to the time difference of nearest twice packet time of advent and the product of predefined CIR parameter value, being defined as need to be to the token number Ts increasing in token bucket by described.
Described packet is upstream data bag or downlink data packet.
The embodiment of the present invention also provides a kind of PGW equipment, and this PGW equipment comprises above-mentioned data packet processing.
To sum up, beneficial effect of the present invention comprises:
In the scheme that the embodiment of the present invention provides, when packet arrives, according to SRTCM algorithm, determine and forward described packet or abandon described packet, and forward described packet or abandon described packet according to definite result.This programme is determined the packet that forwards or abandon arrival according to SRTCM algorithm, therefore can adjust the probability that packet is forwarded or abandons by adjusting parameter value in SRTCM algorithm, thereby adjust the output speed of data flow, the probability that packet is forwarded is larger, the output speed of data flow is larger, the probability that packet is forwarded is less, and the output speed of data flow is less, and then has reached the object of data stream being carried out to traffic shaping.
The present invention is with reference to describing according to flow chart and/or the block diagram of the method for the embodiment of the present invention, equipment (system) and computer program.Should understand can be in computer program instructions realization flow figure and/or block diagram each flow process and/or the flow process in square frame and flow chart and/or block diagram and/or the combination of square frame.Can provide these computer program instructions to the processor of all-purpose computer, special-purpose computer, Embedded Processor or other programmable data processing device to produce a machine, the instruction of carrying out by the processor of computer or other programmable data processing device is produced for realizing the device in the function of flow process of flow chart or a plurality of flow process and/or square frame of block diagram or a plurality of square frame appointments.
These computer program instructions also can be stored in energy vectoring computer or the computer-readable memory of other programmable data processing device with ad hoc fashion work, the instruction that makes to be stored in this computer-readable memory produces the manufacture that comprises command device, and this command device is realized the function of appointment in flow process of flow chart or a plurality of flow process and/or square frame of block diagram or a plurality of square frame.
These computer program instructions also can be loaded in computer or other programmable data processing device, make to carry out sequence of operations step to produce computer implemented processing on computer or other programmable devices, thereby the instruction of carrying out is provided for realizing the step of the function of appointment in flow process of flow chart or a plurality of flow process and/or square frame of block diagram or a plurality of square frame on computer or other programmable devices.
Although described the preferred embodiments of the present invention, once those skilled in the art obtain the basic creative concept of cicada, can make other change and modification to these embodiment.So claims are intended to all changes and the modification that are interpreted as comprising preferred embodiment and fall into the scope of the invention.
Obviously, those skilled in the art can carry out various changes and modification and not depart from the spirit and scope of the present invention the present invention.Like this, if within of the present invention these are revised and modification belongs to the scope of the claims in the present invention and equivalent technologies thereof, the present invention is also intended to comprise these changes and modification interior.
Claims (10)
1. a data package processing method, is characterized in that, the method comprises:
When packet arrives, according to the length of described packet, determine the number B of the token of described packets need; According to time difference and the predefined guarantee information speed CIR parameter value of nearest twice packet time of advent, determining need to be to the token number Ts increasing in token bucket; Determine the token number Tc sum in Ts and current token bucket, whether be greater than predefined assurance burst sizes CBS parameter value, and according to the value of determining result parameters Tcnew; The initial value of Tc is CBS; Determine whether B is greater than the value of Tcnew, if so, abandon described packet, and upgrade Tc, the Tc after renewal equals Tc and the Ts sum before renewal; Otherwise, determining and forward described packet, and upgrade Tc, the Tc after renewal equals the difference of Tcnew and B;
According to definite result, forward described packet or abandon described packet;
Wherein, described CIR parameter value and described CBS parameter value equal current available bandwidth value; The time difference of described nearest twice packet time of advent is: the time difference of nearest twice packet time of advent in all carryings in current PDN connection; Described basis determines that the value of result parameters Tcnew comprises: if the token number Tc sum in Ts and current token bucket, be less than or equal to predefined CBS parameter value, the value of parameters Tcnew equals the summed result of Ts and Tc and distributes the difference of bandwidth value; The described bandwidth value that distributed equals priority in current PDN connection higher than shaping parameter value sum of each carrying of carrying corresponding to described packet, and for non-GBR carrying, this shaping parameter value is APN-AMBR, and for GBR carrying, this shaping parameter value is MBR; If the token number Tc sum in Ts and current token bucket, is greater than predefined CBS parameter value, the value of parameters Tcnew equals CBS.
2. the method for claim 1, is characterized in that, the described length according to described packet determines that the number B of the token of described packets need comprises:
The bit length value of described packet is defined as to the number B of the token of described packets need.
3. the method for claim 1, is characterized in that, described according to time difference and the predefined CIR parameter value of nearest twice packet time of advent, determines and need to comprise to the token number Ts increasing in token bucket:
By described, according to the time difference of nearest twice packet time of advent and the product of predefined CIR parameter value, being defined as need to be to the token number Ts increasing in token bucket.
4. the method for claim 1, is characterized in that, described packet is upstream data bag or downlink data packet.
5. the method for claim 1, is characterized in that, the executive agent of the method is packet data gateway PGW.
6. a data packet processing, is characterized in that, this device comprises:
Determining unit, for when packet arrives, determines the number B of the token of described packets need according to the length of described packet; According to time difference and the predefined guarantee information speed CIR parameter value of nearest twice packet time of advent, determining need to be to the token number Ts increasing in token bucket; Determine the token number Tc sum in Ts and current token bucket, whether be greater than predefined assurance burst sizes CBS parameter value, and according to the value of determining result parameters Tcnew; The initial value of Tc is CBS; Determine whether B is greater than the value of Tcnew, if so, abandon described packet, and upgrade Tc, the Tc after renewal equals Tc and the Ts sum before renewal; Otherwise, determining and forward described packet, and upgrade Tc, the Tc after renewal equals the difference of Tcnew and B;
Processing unit, for forwarding described packet or abandon described packet according to definite result;
Wherein, described determining unit also for: described CIR parameter value and described CBS parameter value equal current available bandwidth value; The time difference of described nearest twice packet time of advent is: the time difference of nearest twice packet time of advent in all carryings in current PDN connection; The value of parameters Tcnew as follows: if the token number Tc sum in Ts and current token bucket, be less than or equal to predefined CBS parameter value, the value of parameters Tcnew equals the summed result of Ts and Tc and distributes the difference of bandwidth value; The described bandwidth value that distributed equals priority in current PDN connection higher than shaping parameter value sum of each carrying of carrying corresponding to described packet, and for non-GBR carrying, this shaping parameter value is APN-AMBR, and for GBR carrying, this shaping parameter value is MBR; If the token number Tc sum in Ts and current token bucket, is greater than predefined CBS parameter value, the value of parameters Tcnew equals CBS.
7. device as claimed in claim 6, is characterized in that, described determining unit is used for: the number B that determines as follows the token of described packets need:
The bit length value of described packet is defined as to the number B of the token of described packets need.
8. device as claimed in claim 6, is characterized in that, described determining unit is used for: determine as follows the token number Ts that need to increase to token bucket:
By described, according to the time difference of nearest twice packet time of advent and the product of predefined CIR parameter value, being defined as need to be to the token number Ts increasing in token bucket.
9. device as claimed in claim 6, is characterized in that, described packet is upstream data bag or downlink data packet.
10. a packet data gateway PGW equipment, is characterized in that, this PGW equipment comprises as arbitrary device in claim 6-9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110234450.3A CN102271088B (en) | 2011-08-16 | 2011-08-16 | Data packet processing method and equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110234450.3A CN102271088B (en) | 2011-08-16 | 2011-08-16 | Data packet processing method and equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102271088A CN102271088A (en) | 2011-12-07 |
| CN102271088B true CN102271088B (en) | 2014-02-12 |
Family
ID=45053255
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110234450.3A Active CN102271088B (en) | 2011-08-16 | 2011-08-16 | Data packet processing method and equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102271088B (en) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102932272B (en) * | 2012-11-23 | 2016-05-11 | 迈普通信技术股份有限公司 | Message forwarding method based on uninterrupted and forwarding unit |
| CN104852864B (en) * | 2014-02-13 | 2018-12-14 | 中兴通讯股份有限公司 | A kind of message forwarding method, device and network forwarding equipment |
| CN104270794B (en) * | 2014-09-23 | 2018-01-12 | 中国联合网络通信集团有限公司 | Resource allocation methods and device |
| CN104980779B (en) * | 2015-04-10 | 2018-04-20 | 腾讯科技(成都)有限公司 | The transfer control method and device of video data |
| US10721178B2 (en) * | 2016-01-22 | 2020-07-21 | Medtronic, Inc. | Systems, apparatus and methods facilitating data buffering and removal |
| CN107579877B (en) * | 2017-09-18 | 2020-09-25 | 南京国电南自电网自动化有限公司 | FPGA-based power switch flow monitoring system and monitoring method |
| CN110475286B (en) * | 2018-05-09 | 2023-04-21 | 大唐移动通信设备有限公司 | Data packet discarding management method, device and apparatus, and medium |
| CN112559405B (en) * | 2020-12-11 | 2023-12-01 | 中国电子科技集团公司第四十七研究所 | Control method and device for multi-channel DMA (direct memory access) with token bucket structure |
| CN117579564A (en) * | 2024-01-19 | 2024-02-20 | 成都智明达电子股份有限公司 | Multi-path flow scheduling system and method based on FPGA and token bucket algorithm |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101667940A (en) * | 2009-09-25 | 2010-03-10 | 中兴通讯股份有限公司 | System and method for policing on message |
| CN102014075A (en) * | 2010-12-21 | 2011-04-13 | 杭州华三通信技术有限公司 | Traffic policing method and device |
| CN102082693A (en) * | 2011-02-15 | 2011-06-01 | 中兴通讯股份有限公司 | Method and device for monitoring network traffic |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7698412B2 (en) * | 2003-12-31 | 2010-04-13 | Alcatel Lucent | Parallel data link layer controllers in a network switching device |
| US7719968B2 (en) * | 2005-12-30 | 2010-05-18 | Extreme Networks, Inc. | Multi-priority multi-color markers for traffic metering |
-
2011
- 2011-08-16 CN CN201110234450.3A patent/CN102271088B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101667940A (en) * | 2009-09-25 | 2010-03-10 | 中兴通讯股份有限公司 | System and method for policing on message |
| CN102014075A (en) * | 2010-12-21 | 2011-04-13 | 杭州华三通信技术有限公司 | Traffic policing method and device |
| CN102082693A (en) * | 2011-02-15 | 2011-06-01 | 中兴通讯股份有限公司 | Method and device for monitoring network traffic |
Non-Patent Citations (2)
| Title |
|---|
| 《一种基于srTCM的令牌桶改进算法及其在FRTS中的应用》;黄霞等;《黑龙江科技信息》;20090430(第4期);第63-64页 * |
| 黄霞等.《一种基于srTCM的令牌桶改进算法及其在FRTS中的应用》.《黑龙江科技信息》.2009,(第4期), |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102271088A (en) | 2011-12-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102271088B (en) | Data packet processing method and equipment | |
| US10869324B2 (en) | Communication method based on a CU-DU architecture | |
| EP3541114B1 (en) | Sending data rate information to a wireless access network node | |
| JP5531110B2 (en) | Energy control in mobile communication networks | |
| US8755405B2 (en) | Burst packet scheduler for improved ran efficiency in UMTS/HSPA networks | |
| US8223758B2 (en) | System and method of load dependent rate policing | |
| US7031254B2 (en) | Rate control system and method for a link within a wireless communications system | |
| CN106664597A (en) | Communication system | |
| EP2824963B1 (en) | Method and device for controlling radio access network traffic in radio communication system | |
| CN110809293B (en) | Resource scheduling method and equipment for wireless backhaul path | |
| WO2021088977A1 (en) | Data transmission method and related device | |
| CN107426823B (en) | Method and system for multiplexing media access control layer | |
| CN116406033A (en) | Bearer mapping method of wireless backhaul node, wireless backhaul node and donor base station | |
| CN101547511B (en) | Uplink resource allocating method and user equipment | |
| US20050052997A1 (en) | Packet scheduling of real time packet data | |
| JP2003529291A (en) | Transmission of packet data | |
| WO2004064424A1 (en) | Packet service system and method for controlling packet transmission | |
| CN114390593A (en) | Communication method and device in IAB network | |
| CN103414654B (en) | One kind realizes bandwidth shunt method and system | |
| CN104244328A (en) | Combined service dispatching method and device | |
| CN112235833B (en) | Dynamic configuration method of data flow parameters and session management functional entity | |
| CN101932003A (en) | Method and equipment for processing congestion control | |
| WO2014040487A1 (en) | Optimization method, system and device for multi-stream of high-speed downlink packet access | |
| EP1919230A1 (en) | A method for capacity allocation for packet transfer of streaming traffic in a radio access network | |
| WO2014205744A1 (en) | Mvno resource control method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |