CN102271088A - Data packet processing method and equipment - Google Patents
Data packet processing method and equipment Download PDFInfo
- Publication number
- CN102271088A CN102271088A CN2011102344503A CN201110234450A CN102271088A CN 102271088 A CN102271088 A CN 102271088A CN 2011102344503 A CN2011102344503 A CN 2011102344503A CN 201110234450 A CN201110234450 A CN 201110234450A CN 102271088 A CN102271088 A CN 102271088A
- Authority
- CN
- China
- Prior art keywords
- packet
- value
- parameter
- tcnew
- token
- 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
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 the 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, EPS) carrying comprises GBR carrying and non-GBR (Non-GBR) carrying to evolved packet system.Each EPS carrying and QCI parameter correlation connection.QCI is a quantity grade, is used for representing the access point parameters of other bag transmission process of control carrying level.
In addition, each GBR carrying also joins with GBR and MBR parameter correlation.GBR has been provided by the bit rate that can be provided by the GBR carrying of expection.MBR has limited the bit rate that the GBR carrying can provide.
(Packet Data Network, PDN) connecting with other qos parameter of IP-CAN session level is that AMBR is associated in each Packet Data Network.A plurality of EPS carryings that identical PDN connects can shared identical AMBR value.When other EPS carrying did 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 (eNB) finishes AMBR control to uplink service in the base station, and (PDN GW P-GW) finishes AMBR control to downlink business at packet data gateway.
GBR, MBR and AMBR parameter partly are made up of uplink and downlink respectively.
Evolved packet system signing service quality in the subscription data is described (EPS subscribed QoS profile) and is directed to each Access Point Name (Access Point Name that the contracted user is permitted, 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 insert a plurality of UE, a UE has 11 carryings at most, and each carrying has 16 server data stream (SDF) at most.
The qos parameter of business-level comprises QCI, ARP, GBR and MBR.Each SDF only is associated with a QCI.The 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 the standard QCI value.
These characteristic descriptions SDF gather pairing bag and transmit disposition, specific as follows:
Can resource class (Resource Type) have determined to be distributed consistently with proprietary network resource professional or that other GBR value of carrying level is relevant.The SDF set of GBR needs the dynamic strategy and the control of chargeing, and the SDF of Non GBR set can be only by the static strategy and the control of chargeing.
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, also is used for distinguishing the SDF set of different UEs.
Packet postpones expection, and (Packet Delay Budget PDB) 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 on the uplink and downlink direction.The purpose 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 that causes; If the business transmission rate of using GBR QCI can suppose generally speaking that smaller or equal to GBR the congested packet loss that causes will can not take place.The congested packet that abandons that causes do not have because still may suffer the packet loss (PLR of face description as follows) under the non-congestion situation.
(Packet Loss Rate PLR) has defined and has been sent out end link layer process but be not received service data unit (Service Data Unit, the upper limit of ratio SDU) that end successfully is sent to last layer packet loss.PLR has illustrated the higher limit of data-bag lost speed under the non-congestion situation.The purpose of PLR is to consider suitable link layer protocol configuration.For some QCI, the value of PLR is identical on the uplink and downlink direction.
In realizing process of the present invention, the inventor finds to exist in the prior art following technical problem:
In transfer of data, need upstream or downstream data flow are carried out traffic shaping, promptly adjust the output speed of data flow, satisfying the throughput requirement of equipment, but also do not have the specific implementation of traffic shaping at present.
Summary of the invention
The embodiment of the invention provides a kind of data package processing method and equipment, is used to solve the problem of how data stream being carried out traffic shaping.
A kind of data package processing method, this method comprises:
When packet arrives, determine to transmit described packet or abandon described packet according to the single token bucket SRTCM of single-rate algorithm;
Transmit described packet or abandon described packet according to definite result.
A kind of data packet processing, this device comprises:
Determining unit is used for when packet arrives, and determines to transmit described packet or abandon described packet according to the single token bucket SRTCM of single-rate algorithm;
Processing unit is used for according to determining that the result transmits described packet or abandons described packet.
A kind of packet data gateway PGW equipment, this PGW equipment comprises described data packet processing.
In this programme, when packet arrives, determine to transmit described packet or abandon described packet according to the SRTCM algorithm, and transmit described packet or abandon described packet according to definite result.This programme determines to transmit or abandon the packet of arrival according to the SRTCM algorithm, therefore can adjust the probability that packet is forwarded or abandons by parameter value in the adjustment SRTCM algorithm, thereby adjust the output speed of data flow, the probability that packet is forwarded is big more, the output speed of data flow is big more, the probability that packet is forwarded is more little, and the output speed of data flow is more little, and then has reached the purpose of data stream being carried out traffic shaping.
Description of drawings
The method flow schematic diagram that Fig. 1 provides for the embodiment of the invention;
Fig. 2 A is the schematic flow sheet of the embodiment of the invention one;
Fig. 2 B is the schematic flow sheet of the embodiment of the invention two;
Fig. 2 C is the schematic flow sheet of the embodiment of the invention three;
Fig. 2 D is a token bucket schematic diagram in the embodiment of the invention three;
Fig. 2 E is another token bucket schematic diagram in the embodiment of the invention three;
Fig. 2 F is another token bucket schematic diagram in the embodiment of the invention three;
The device structure intention that Fig. 3 provides for the embodiment of the invention.
Embodiment
In order to realize data stream is carried out the scheme of traffic shaping, the embodiment of the invention provides a kind of data package processing method, in this method, uses single token bucket (SRTCM) algorithm of single-rate to carry out traffic shaping.
Referring to Fig. 1, the data package processing method that the embodiment of the invention provides may further comprise the steps:
Step 10: when packet arrives, determine to transmit described packet or abandon described packet according to the SRTCM algorithm;
Step 11: transmit described packet or abandon described packet according to definite result.Concrete, if determine that the result for transmitting described packet, then transmits this packet, if determine that the result for abandoning described packet, then abandons this packet.
In the step 10, determine to transmit described packet or abandon described packet according to the SRTCM algorithm, specific implementation can adopt following method:
At first, determine the number B of the token of described packets need according to described length of data package; According to time difference and predefined guarantee information speed (CIR) parameter value of nearest twice packet time of advent, determine the token number Ts that need in token bucket, increase; CIR is for representing the parameter of the maximum data rate that the current bandwidth condition is allowed, and the value of CIR can preestablish according to actual needs.
Then, determine the token number Tc sum in Ts and the current token bucket, whether greater than predefined assurance burst sizes (CBS) parameter value, and according to determining that the result is provided with the value of parameter Tcnew; The initial value of Tc is CBS; CBS is the total number of bits of all packets of expression burst arrival, and the value of CBS can preestablish 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;
At last, determine that B is whether greater than the value of Tcnew, if then abandon described packet, and upgrade Tc, Tc and Ts sum before the Tc after the renewal equals to upgrade; Otherwise, determining to transmit described packet, and upgrade Tc, the Tc after the renewal equals the difference of Tcnew and B.
The above-mentioned specific implementation that the value of parameter Tcnew is set can adopt following three kinds of methods:
First kind, when described packet was packet in the non-GBR carrying, described CIR parameter value equaled the corresponding APN-AMBR of this non-GBR carrying; The time difference of described nearest twice packet time of advent is: the time difference of current PDN connects following all non-GBR in carrying nearest twice packet time of advent; For example, in current PDN connection, exist 3 non-GBR carryings to be connected with 1 GBR, the packet 1, the packet 2 in the non-GBR carrying 2, the packet 3 in the GBR carrying, the non-GBR that have arrived successively in following 4 packet: non-GBR carrying 1 according to from morning to night order carry the packet 4 on 3, so, current PDN connect following all non-GBR carry in the packet of nearest twice arrival be packet 4, packet 2, the time of advent that the then described time difference is a packet 4 and the time of advent of packet 3 poor.
If the token number Tc sum in Ts and the current token bucket is less than or equal to predefined CBS parameter value, the value that parameter Tcnew then is set equals Ts and Tc sum;
If the token number Tc sum in Ts and the current token bucket, greater than predefined CBS parameter value, the value that parameter Tcnew then is set equals CBS.
Second kind, when described packet was packet in the GBR carrying, described CIR parameter value equaled the corresponding MBR of this GBR carrying; 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 are carrying 2, carrying 3 simultaneously, following 4 packets have been arrived successively according to from morning to night order: the packet 4 in the packet 2 in the packet 1 in the carrying 1, the carrying 2, the packet 3 in the carrying 1, the GBR carrying 3, so, the packet of nearest twice arrival is packet 3, packet 1 in the carrying 1, the time of advent that the then described time difference is a packet 3 and the time of advent of packet 1 poor.
If the token number Tc sum in Ts and the current token bucket is less than or equal to predefined CBS parameter value, the value that parameter Tcnew then is set equals Ts and Tc sum;
If the token number Tc sum in Ts and the current token bucket, greater than predefined CBS parameter value, the value that parameter Tcnew then is set equals CBS.
The third, described CIR parameter value and described CBS parameter value equal current available bandwidth value, promptly 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 the current PDN connection; For example, there is carrying 1 in the current PDN connection, carrying 2 and carrying 3, following 4 packets have been arrived successively according to from morning to night order: the packet 4 in the packet 2 in the packet 1 in the carrying 1, the carrying 2, the packet 3 in the carrying 1, the GBR carrying 3, so, the packet of nearest twice arrival is packet 4, packet 4 in all carryings in the current PDN connection, the time of advent that the then described time difference is a packet 4 and the time of advent of packet 3 poor.
If the token number Tc sum in Ts and the current token bucket is less than or equal to predefined CBS parameter value, the value that parameter Tcnew then is set equals the summed result of Ts and Tc and the difference of distributing bandwidth value; The described bandwidth value that distributed equals shaping parameter value sum of each carrying that priority in the current PDN connection is higher than the carrying of described packet correspondence, and for the non-GBR carrying, this shaping parameter value is APN-AMBR, and for the GBR carrying, this shaping parameter value is MBR; For example, the non-GBR that is carried as of described packet correspondence carries 1, also there is non-GBR carrying 2 in the current PDN connection simultaneously, non-GBR carrying 3, GBR carrying 4, be carried as according to above-mentioned 4 of priority sequence arrangement from high to low: 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 promptly, 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 the current token bucket, greater than predefined CBS parameter value, the value that parameter Tcnew then is set 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 the token of described packets need.
Above-mentioned definite token number Ts that need in token bucket, increase, its specific implementation can be as follows: according to the time difference of nearest twice packet time of advent and the product of predefined CIR parameter value, be defined as the token number Ts that need increase with described in token bucket.
In this method, described packet is upstream data bag or downlink data packet.The executive agent of this method can (PDN GW PGW), can certainly be the main body that other any needs carry out traffic shaping for packet data gateway.
The present invention will be described below in conjunction with specific embodiment:
Embodiment one:
Present embodiment is the traffic shaping at the non-GBR carrying, has used the SRTCM algorithm after improving.
APN-AMBR is the CAMEL-Subscription-Information that is stored in each APN in the home signature user server (HSS).On S58 interface (interface between PGW and the SGW), when carrying out the traffic shaping based on the carrying level, the non-GBR carrying is carried out shaping according to APN-AMBR.
Stipulate among the TS23.401,, adopt sharing A PN-AMBR mechanism to realize the utilization of resource for all non-GBR carryings that the same PDN of same UE connects.Promptly this PDN connects when having a plurality of non-GBR carryings to exist down, if when some of them non-GBR carries not transport service, other movable non-GBR carries can share whole APN-AMBR bandwidth resources.Because default bearing generally all is the non-GBR carrying, so the corresponding shaping template of non-GBR carrying under the same PDN connection generally is 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 a bit.
CBS (Committed Burst Size): the token number when piling token in the token bucket.
Tc: the token number in the token bucket, initial value are CBS.
B: the token number that data message needs calculates according to data packet length.
Ts: need add the token number in the token bucket, the time difference and the CIR that connect nearest twice data message arrival among all non-GBR down according to this PDN calculate.
Shown in Fig. 2 A, idiographic flow is as follows:
Step 1:PGW determines that the downlink data packet of non-GBR carrying arrives the 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, the token number is that bit (bit) converts according to the least unit of packet, if packet is a N bit, then B equals N;
Step 3:PGW determines the time difference of nearest twice packet time of advent in all non-GBR carrying in the current PDN connection;
Step 4:PGW determines needs according to described time difference and CIR and adds token number Ts in the token bucket, for example, and the described time difference * of Ts=CIR;
Step 5: whether judge Ts+Tc greater than CBS, if then 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: whether judge B greater than Tcnew, if then 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 the corresponding shaping template; Concrete, under the situation of normal converting downlink packet, Tc=Tcnew-B; Under the situation that downlink data packet is abandoned, Tc=Ts+Tc.
Embodiment two:
Present embodiment is at the traffic shaping of GBR carrying, has used the SRTCM algorithm.
For each GBR carrying, two parameters of all 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 the S58 interface, when carrying out the traffic shaping based on the carrying level, carrying is carried out traffic shaping according to MBR for GBR.
When the GBR load creating, according to the data model of corresponding sizing die buttress of this bearer QoS parameters configuration, do following setting simultaneously according to token bucket algorithm:
The MBR of CIR (Committed Information Rate): GBR carrying, unit is a bit.
CBS (Committed Burst Size): the token number when piling token in the token bucket.
Tc: the token number in the token bucket, initial value are CBS.
B: the token number that data message needs calculates according to data packet length.
Ts: need add the token number in the token bucket, the time difference and the CIR that arrive according to nearest twice data message in this GBR carrying calculate.
Shown in Fig. 2 B, idiographic flow is as follows:
Step 1:PGW determines that the downlink data packet of GBR carrying arrives the 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, the token number is that bit (bit) converts according to the least unit of packet, if packet is a N bit, then B equals N;
Step 3:PGW determines the time difference of nearest twice packet time of advent in the GBR carrying;
Step 4:PGW determines needs according to described time difference and CIR and adds token number Ts in the token bucket, for example, and the described time difference * of Ts=CIR;
Step 5: whether judge Ts+Tc greater than CBS, if then 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: whether judge B greater than Tcnew, if then 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 the corresponding shaping template; Concrete, under the situation of normal converting downlink packet, Tc=Tcnew-B; Under the situation that downlink data packet is abandoned, Tc=Ts+Tc.
Embodiment three:
Present embodiment is at the traffic shaping under the limited situation of the traffic handing capacity of PGW, has used the SRTCM algorithm.To each professional shared token bucket, the bucket size is set to remaining bandwidth, carries out bandwidth according to service priority and seizes.
Agreement present situation: stipulate among the TS23.203, the carrying of the bit rate that guarantees is that the corresponding QCI value of GBR carrying is 1 to 4, 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 the corresponding QCI value of non-GBR carrying is 5 to 9, the all non-GBR that connect for same PDN carry, in order to improve the statistic multiplexing effect of bearing resource, adopt sharing A PN-AMBR mechanism to realize the utilization of resource, this moment, Service Processing Unit need not guarantee for the APN-AMBR bandwidth of this carrying when bearing tunnel is set up.
Configuring condition: the Service Processing Unit resource at first can reserved resource for non-GBR carrying, to all GBR carrying distribution according to need resources, increase along with inserting GBR carrying quantity, under the situation of resource-constrained, Service Processing Unit can reduce the bandwidth reserved of non-GBR carrying, carries not occupied bandwidth up to non-GBR.
Business Processing situation: when the bandwidth reserved that carries for non-GBR on the Service Processing Unit reduces, Service Processing Unit can not guarantee to insert this non-GBR carrying bandwidth (APN-AMBR) of this APN, and this moment, Service Processing Unit may also not use for the GBR carrying leaves bandwidth.
Under above situation, on the resource allocation basis that guarantees GBR, non-GBR carrying, the more efficient use resource, this moment, Service Processing Unit was arranged to a token bucket with remaining bandwidth, CBS is set to the Service Processing Unit remaining bandwidth, and CIR speed is provided with CBS/s, carry out shaping algorithm according to priority on this basis.Supposing to have in the current PDN connection following four carrying: GBR carrying, QCI is that 5 non-GBR, QCI are that 8 non-GBR carrying, QCI are 9 non-GBR carrying.
Shown in Fig. 2 C, idiographic flow is as follows:
Step 1:PGW determines that downlink data packet arrives the 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, the token number is that bit (bit) converts according to the least unit of packet, if packet is a N bit, then B equals N;
Step 3:PGW determines the time difference of nearest twice packet time of advent in all carryings in the current PDN connection;
Step 4:PGW determines needs according to described time difference and CIR and adds token number Ts in the token bucket, for example, and the described time difference * of Ts=CIR;
Step 5: whether judge Ts+Tc greater than CBS, if then 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 has distributed bandwidth value; To step 8;
Because the priority of GBR carrying is higher than the priority of all non-GBR carryings, the priority of the carrying that corresponding QCI is more little is high more, therefore, is the GBR data packet loaded if arrive the downlink data packet of S58 interface, then this to have distributed bandwidth value be 0; If arriving the downlink data packet of S58 interface is that QCI is 5 non-GBR data packet loaded, then this to have distributed bandwidth value be the corresponding MBR of GBR carrying; If arriving the downlink data packet of S58 interface is that QCI is 8 non-GBR data packet loaded, then this to have distributed bandwidth value be the corresponding MBR of GBR carrying with QCI is that 5 non-GBR carries corresponding APN-AMBR sum; If arriving the downlink data packet of S58 interface is that QCI is 9 non-GBR data packet loaded, then this to have distributed bandwidth value be the corresponding MBR of GBR carrying with QCI is that corresponding APN-AMBR of 5 non-GBR carrying and QCI are that 8 non-GBR carries corresponding APN-AMBR sum
Step 8: whether judge B greater than Tcnew, if then 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 the corresponding shaping template; Concrete, under the situation of normal converting downlink packet, Tc=Tcnew-B; Under the situation that downlink data packet is abandoned, Tc=Ts+Tc.
Present embodiment can relate to following three kinds of situations:
One, it is identical just to have begun each carrying corresponding token bucket, and a token bucket is seen in the carrying of different priorities, shown in Fig. 2 D:
Two, Service Processing Unit has been GBR carrying Resources allocation, the operable bucket size of GBR carrying is the MBR value of carrying configuration, because token bucket CBS is set to the Service Processing Unit remaining bandwidth, and Service Processing Unit to be GBR carrying leave bandwidth, so do not have under the situation of complete utilized bandwidth in all GBR carryings, Service Processing Unit still has remaining bandwidth to use for the non-GBR carrying, all non-GBR carrying this moment is according to the priority preempting resources that takes the lead in, the scheme of service is earlier adopted first in the non-GBR carrying that priority is identical, if the Service Processing Unit resource also exists, the token bucket situation that the carrying of different priorities is seen is shown in Fig. 2 E:
If three Service Processing Unit resources are used up, this moment is under the prerequisite that has guaranteed GBR carrying bandwidth, the non-GBR carrying of higher priority takies remaining bandwidth, the non-GBR carrying of lower priority possibly can't take Service Processing Unit and handle resource, i.e. scheme to seizing based on the priority bandwidth, this scheme under the prerequisite that has guaranteed GBR carrying bandwidth, has guaranteed that the resource of non-GBR carrying is used according to the resource allocation of Service Processing Unit to greatest extent.Concrete condition is described shown in Fig. 2 F.
Referring to Fig. 3, the embodiment of the invention provides a kind of data packet processing, and this device comprises:
Determining unit 30 is used for when packet arrives, and determines to transmit described packet or abandon described packet according to the single token bucket SRTCM of single-rate algorithm;
Processing unit 31 is used for according to determining that the result transmits described packet or abandons described packet.
Described determining unit 30 is used for:
Determine the number B of the token of described packets need according to described length of data package; According to time difference and the predefined guarantee information speed CIR parameter value of nearest twice packet time of advent, determine the token number Ts that need in token bucket, increase;
Determine the token number Tc sum in Ts and the current token bucket, whether greater than predefined assurance burst sizes CBS parameter value, and according to determining that the result is provided with the value of parameter Tcnew; The initial value of Tc is CBS;
Determine that B is whether greater than the value of Tcnew, if then abandon described packet, and upgrade Tc, Tc and Ts sum before the Tc after the renewal equals to upgrade; Otherwise, determining to transmit described packet, and upgrade Tc, the Tc after the renewal equals the difference of Tcnew and B.
Described determining unit 30 is used for:
When described packet was packet in the non-assurance bit rate non-GBR carrying, described CIR parameter value equaled the corresponding Access Point Name Aggregate Maximum Bit Rate APN-AMBR of this non-GBR carrying; The time difference of described nearest twice packet time of advent is: the time difference of the current grouped data network PDN connects following all non-GBR in carrying nearest twice packet time of advent; And the value of parameter Tcnew is set as follows:
If the token number Tc sum in Ts and the current token bucket is less than or equal to predefined CBS parameter value, the value that parameter Tcnew then is set equals Ts and Tc sum;
If the token number Tc sum in Ts and the current token bucket, greater than predefined CBS parameter value, the value that parameter Tcnew then is set equals CBS.
Described determining unit 30 is used for:
When described packet was the packet that guarantees in the bit rate GBR carrying, described CIR parameter value equaled the corresponding maximum bit rate MBR of this GBR carrying; 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 parameter Tcnew is set as follows:
If the token number Tc sum in Ts and the current token bucket is less than or equal to predefined CBS parameter value, the value that parameter Tcnew then is set equals Ts and Tc sum;
If the token number Tc sum in Ts and the current token bucket, greater than predefined CBS parameter value, the value that parameter Tcnew then is set equals CBS.
Described determining unit 30 is used 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 the current PDN connection; The value of parameter Tcnew is set as follows:
If the token number Tc sum in Ts and the current token bucket is less than or equal to predefined CBS parameter value, the value that parameter Tcnew then is set equals the summed result of Ts and Tc and the difference of distributing bandwidth value; The described bandwidth value that distributed equals shaping parameter value sum of each carrying that priority in the current PDN connection is higher than the carrying of described packet correspondence, and for the non-GBR carrying, this shaping parameter value is APN-AMBR, and for the GBR carrying, this shaping parameter value is MBR;
If the token number Tc sum in Ts and the current token bucket, greater than predefined CBS parameter value, the value that parameter Tcnew then is set equals CBS.
Described determining unit 30 is used for: the number B that determines the token of described packets need as follows: the number B that the bit length value of described packet is defined as the token of described packets need.
Described determining unit 30 is used for: determine the token number Ts that need increase to token bucket as follows: according to the time difference of nearest twice packet time of advent and the product of predefined CIR parameter value, be defined as the token number Ts that need increase with described in token bucket.
Described packet is upstream data bag or downlink data packet.
The embodiment of the 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 invention provides, when packet arrives, determine to transmit described packet or abandon described packet according to the SRTCM algorithm, and transmit described packet or abandon described packet according to definite result.This programme determines to transmit or abandon the packet of arrival according to the SRTCM algorithm, therefore can adjust the probability that packet is forwarded or abandons by parameter value in the adjustment SRTCM algorithm, thereby adjust the output speed of data flow, the probability that packet is forwarded is big more, the output speed of data flow is big more, the probability that packet is forwarded is more little, and the output speed of data flow is more little, and then has reached the purpose of data stream being carried out traffic shaping.
The present invention is that reference is described according to the flow chart and/or the block diagram of method, equipment (system) and the computer program of the embodiment of the invention.Should understand can be by the flow process in each flow process in computer program instructions realization flow figure and/or the block diagram and/or square frame and flow chart and/or the 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, make the instruction of carrying out by the processor of computer or other programmable data processing device produce to be used for the device of the function that is implemented 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 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, make the instruction that is stored in this computer-readable memory produce the manufacture that comprises command device, this command device is implemented in 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 on computer or other programmable data processing device, make on computer or other programmable devices and to carry out the sequence of operations step producing computer implemented processing, thereby the instruction of carrying out on computer or other programmable devices is provided for being implemented in 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.
Although described the preferred embodiments of the present invention, in a single day those skilled in the art get the basic creative notion of cicada, then 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 to the present invention and not break away from the spirit and scope of the present invention.Like this, if of the present invention these are revised and modification belongs within the scope of claim of the present invention and equivalent technologies thereof, then the present invention also is intended to comprise these changes and modification interior.
Claims (18)
1. a data package processing method is characterized in that, this method comprises:
When packet arrives, determine to transmit described packet or abandon described packet according to the single token bucket SRTCM of single-rate algorithm;
Transmit described packet or abandon described packet according to definite result.
2. the method for claim 1 is characterized in that, describedly determine to transmit described packet or abandoning described packet comprises according to the SRTCM algorithm:
Determine the number B of the token of described packets need according to described length of data package; According to time difference and the predefined guarantee information speed CIR parameter value of nearest twice packet time of advent, determine the token number Ts that need in token bucket, increase;
Determine the token number Tc sum in Ts and the current token bucket, whether greater than predefined assurance burst sizes CBS parameter value, and according to determining that the result is provided with the value of parameter Tcnew; The initial value of Tc is CBS;
Determine that B is whether greater than the value of Tcnew, if then abandon described packet, and upgrade Tc, Tc and Ts sum before the Tc after the renewal equals to upgrade; Otherwise, determining to transmit described packet, and upgrade Tc, the Tc after the renewal equals the difference of Tcnew and B.
3. method as claimed in claim 2 is characterized in that, when described packet was packet in the non-assurance bit rate non-GBR carrying, described CIR parameter value equaled the corresponding Access Point Name Aggregate Maximum Bit Rate APN-AMBR of this non-GBR carrying; The time difference of described nearest twice packet time of advent is: the time difference of the current grouped data network PDN connects following all non-GBR in carrying nearest twice packet time of advent; Described basis determines that the value that the result is provided with parameter Tcnew comprises:
If the token number Tc sum in Ts and the current token bucket is less than or equal to predefined CBS parameter value, the value that parameter Tcnew then is set equals Ts and Tc sum;
If the token number Tc sum in Ts and the current token bucket, greater than predefined CBS parameter value, the value that parameter Tcnew then is set equals CBS.
4. method as claimed in claim 2 is characterized in that, when described packet was the packet that guarantees in the bit rate GBR carrying, described CIR parameter value equaled the corresponding maximum bit rate MBR of this GBR carrying; 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; Described basis determines that the value that the result is provided with parameter Tcnew comprises:
If the token number Tc sum in Ts and the current token bucket is less than or equal to predefined CBS parameter value, the value that parameter Tcnew then is set equals Ts and Tc sum;
If the token number Tc sum in Ts and the current token bucket, greater than predefined CBS parameter value, the value that parameter Tcnew then is set equals CBS.
5. method as claimed in claim 2 is characterized in that, 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 the current PDN connection; Described basis determines that the value that the result is provided with parameter Tcnew comprises:
If the token number Tc sum in Ts and the current token bucket is less than or equal to predefined CBS parameter value, the value that parameter Tcnew then is set equals the summed result of Ts and Tc and the difference of distributing bandwidth value; The described bandwidth value that distributed equals shaping parameter value sum of each carrying that priority in the current PDN connection is higher than the carrying of described packet correspondence, and for the non-GBR carrying, this shaping parameter value is APN-AMBR, and for the GBR carrying, this shaping parameter value is MBR;
If the token number Tc sum in Ts and the current token bucket, greater than predefined CBS parameter value, the value that parameter Tcnew then is set equals CBS.
6. as arbitrary described method among the claim 2-5, it is characterized in that, describedly determine that according to described length of data package the number B of the token of described packets need comprises:
The bit length value of described packet is defined as the number B of the token of described packets need.
7. as arbitrary described method among the claim 2-5, it is characterized in that described time difference and predefined CIR parameter value according to nearest twice packet time of advent determine that the token number Ts that need increase comprises in token bucket:
According to the time difference of nearest twice packet time of advent and the product of predefined CIR parameter value, be defined as the token number Ts that need in token bucket, increase with described.
8. as arbitrary described method among the claim 1-5, it is characterized in that described packet is upstream data bag or downlink data packet.
9. as arbitrary described method among the claim 1-5, it is characterized in that the executive agent of this method is packet data gateway PGW.
10. a data packet processing is characterized in that, this device comprises:
Determining unit is used for when packet arrives, and determines to transmit described packet or abandon described packet according to the single token bucket SRTCM of single-rate algorithm;
Processing unit is used for according to determining that the result transmits described packet or abandons described packet.
11. device as claimed in claim 10 is characterized in that, described determining unit is used for:
Determine the number B of the token of described packets need according to described length of data package; According to time difference and the predefined guarantee information speed CIR parameter value of nearest twice packet time of advent, determine the token number Ts that need in token bucket, increase;
Determine the token number Tc sum in Ts and the current token bucket, whether greater than predefined assurance burst sizes CBS parameter value, and according to determining that the result is provided with the value of parameter Tcnew; The initial value of Tc is CBS;
Determine that B is whether greater than the value of Tcnew, if then abandon described packet, and upgrade Tc, Tc and Ts sum before the Tc after the renewal equals to upgrade; Otherwise, determining to transmit described packet, and upgrade Tc, the Tc after the renewal equals the difference of Tcnew and B.
12. device as claimed in claim 11 is characterized in that, described determining unit is used for:
When described packet was packet in the non-assurance bit rate non-GBR carrying, described CIR parameter value equaled the corresponding Access Point Name Aggregate Maximum Bit Rate APN-AMBR of this non-GBR carrying; The time difference of described nearest twice packet time of advent is: the time difference of the current grouped data network PDN connects following all non-GBR in carrying nearest twice packet time of advent; And the value of parameter Tcnew is set as follows:
If the token number Tc sum in Ts and the current token bucket is less than or equal to predefined CBS parameter value, the value that parameter Tcnew then is set equals Ts and Tc sum;
If the token number Tc sum in Ts and the current token bucket, greater than predefined CBS parameter value, the value that parameter Tcnew then is set equals CBS.
13. device as claimed in claim 11 is characterized in that, described determining unit is used for:
When described packet was the packet that guarantees in the bit rate GBR carrying, described CIR parameter value equaled the corresponding maximum bit rate MBR of this GBR carrying; 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 parameter Tcnew is set as follows:
If the token number Tc sum in Ts and the current token bucket is less than or equal to predefined CBS parameter value, the value that parameter Tcnew then is set equals Ts and Tc sum;
If the token number Tc sum in Ts and the current token bucket, greater than predefined CBS parameter value, the value that parameter Tcnew then is set equals CBS.
14. device as claimed in claim 11 is characterized in that, described determining unit is used 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 the current PDN connection; The value of parameter Tcnew is set as follows:
If the token number Tc sum in Ts and the current token bucket is less than or equal to predefined CBS parameter value, the value that parameter Tcnew then is set equals the summed result of Ts and Tc and the difference of distributing bandwidth value; The described bandwidth value that distributed equals shaping parameter value sum of each carrying that priority in the current PDN connection is higher than the carrying of described packet correspondence, and for the non-GBR carrying, this shaping parameter value is APN-AMBR, and for the GBR carrying, this shaping parameter value is MBR;
If the token number Tc sum in Ts and the current token bucket, greater than predefined CBS parameter value, the value that parameter Tcnew then is set equals CBS.
15., it is characterized in that described determining unit is used for: the number B that determines the token of described packets need as follows as arbitrary described device among the claim 11-14:
The bit length value of described packet is defined as the number B of the token of described packets need.
16., it is characterized in that described determining unit is used for: determine the token number Ts that need increase to token bucket as follows as arbitrary described device among the claim 11-14:
According to the time difference of nearest twice packet time of advent and the product of predefined CIR parameter value, be defined as the token number Ts that need in token bucket, increase with described.
17., it is characterized in that described packet is upstream data bag or downlink data packet as arbitrary described device among the claim 10-14.
18. a packet data gateway PGW equipment is characterized in that, this PGW equipment comprises as arbitrary described device among the claim 10-17.
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 true CN102271088A (en) | 2011-12-07 |
| CN102271088B 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) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102932272A (en) * | 2012-11-23 | 2013-02-13 | 迈普通信技术股份有限公司 | Message forwarding method and forwarding device based on flow capacity |
| CN104270794A (en) * | 2014-09-23 | 2015-01-07 | 中国联合网络通信集团有限公司 | Resource allocation method and device |
| WO2015120699A1 (en) * | 2014-02-13 | 2015-08-20 | 中兴通讯股份有限公司 | Packet forwarding method and device, and network forwarding device |
| CN104980779A (en) * | 2015-04-10 | 2015-10-14 | 腾讯科技(成都)有限公司 | Transmission control method and device of video data |
| CN107579877A (en) * | 2017-09-18 | 2018-01-12 | 南京国电南自电网自动化有限公司 | A kind of exchange of electric power machine flux monitoring system and monitoring method based on FPGA |
| CN108883280A (en) * | 2016-01-22 | 2018-11-23 | 美敦力公司 | Promote the systems, devices and methods of data buffering and removal |
| CN110475286A (en) * | 2018-05-09 | 2019-11-19 | 电信科学技术研究院有限公司 | A kind of data packet discarding management method, equipment and device, medium |
| CN112559405A (en) * | 2020-12-11 | 2021-03-26 | 中国电子科技集团公司第四十七研究所 | Control method and device of multichannel 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 (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050198258A1 (en) * | 2003-12-31 | 2005-09-08 | Anees Narsinh | Parallel data link layer controllers in a network switching device |
| US20070153682A1 (en) * | 2005-12-30 | 2007-07-05 | Erik Swenson | Multi-priority multi-color markers for traffic metering |
| 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 |
-
2011
- 2011-08-16 CN CN201110234450.3A patent/CN102271088B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050198258A1 (en) * | 2003-12-31 | 2005-09-08 | Anees Narsinh | Parallel data link layer controllers in a network switching device |
| US20070153682A1 (en) * | 2005-12-30 | 2007-07-05 | Erik Swenson | Multi-priority multi-color markers for traffic metering |
| 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 (1)
| Title |
|---|
| 黄霞等: "《一种基于srTCM的令牌桶改进算法及其在FRTS中的应用》", 《黑龙江科技信息》 * |
Cited By (15)
| 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 |
| CN102932272A (en) * | 2012-11-23 | 2013-02-13 | 迈普通信技术股份有限公司 | Message forwarding method and forwarding device based on flow capacity |
| WO2015120699A1 (en) * | 2014-02-13 | 2015-08-20 | 中兴通讯股份有限公司 | Packet forwarding method and device, and network forwarding device |
| CN104270794A (en) * | 2014-09-23 | 2015-01-07 | 中国联合网络通信集团有限公司 | Resource allocation method and device |
| CN104270794B (en) * | 2014-09-23 | 2018-01-12 | 中国联合网络通信集团有限公司 | Resource allocation methods and device |
| CN104980779A (en) * | 2015-04-10 | 2015-10-14 | 腾讯科技(成都)有限公司 | Transmission control method and device of video data |
| CN104980779B (en) * | 2015-04-10 | 2018-04-20 | 腾讯科技(成都)有限公司 | The transfer control method and device of video data |
| CN108883280B (en) * | 2016-01-22 | 2022-06-03 | 美敦力公司 | System, apparatus, and method for facilitating data buffering and removal |
| CN108883280A (en) * | 2016-01-22 | 2018-11-23 | 美敦力公司 | Promote the systems, devices and methods of data buffering and removal |
| CN107579877A (en) * | 2017-09-18 | 2018-01-12 | 南京国电南自电网自动化有限公司 | A kind of exchange of electric power machine flux monitoring system and monitoring method based on FPGA |
| CN107579877B (en) * | 2017-09-18 | 2020-09-25 | 南京国电南自电网自动化有限公司 | FPGA-based power switch flow monitoring system and monitoring method |
| CN110475286A (en) * | 2018-05-09 | 2019-11-19 | 电信科学技术研究院有限公司 | A kind of data packet discarding management method, equipment and device, medium |
| CN112559405A (en) * | 2020-12-11 | 2021-03-26 | 中国电子科技集团公司第四十七研究所 | Control method and device of multichannel DMA (direct memory access) with token bucket structure |
| 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102271088B (en) | 2014-02-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102271088B (en) | Data packet processing method and equipment | |
| EP3541114B1 (en) | Sending data rate information to a wireless access network node | |
| US7031254B2 (en) | Rate control system and method for a link within a wireless communications system | |
| EP3582544A1 (en) | Communication method, base station, and terminal device | |
| CN106664597B (en) | Communication system | |
| JP5531110B2 (en) | Energy control in mobile communication networks | |
| EP3447978A1 (en) | Data transmission method and device | |
| US20110116460A1 (en) | Burst packet scheduler for improved ran efficiency in umts/hspa networks | |
| EP2854446B1 (en) | Access control method and device | |
| CN110809293B (en) | Resource scheduling method and equipment for wireless backhaul path | |
| WO2021088977A1 (en) | Data transmission method and related device | |
| JP2013515420A (en) | Control of service quality in relays | |
| CN106658719B (en) | Data distribution method and device | |
| CN101389113A (en) | Method for allocating radio resource to relays | |
| CA2404523C (en) | Transmitting packet data | |
| CN107426823B (en) | Method and system for multiplexing media access control layer | |
| CN106162685A (en) | A kind of obtain the method and system of propagation delay time between inserting technology networks | |
| US8355732B2 (en) | Method of dimensioning a transport network for a radio access network of a mobile radio network | |
| EP2730064A2 (en) | Rlc data transmission control based on ue memory capacity | |
| CN101547511B (en) | Uplink resource allocating method and user equipment | |
| CN116406033A (en) | Bearer mapping method of wireless backhaul node, wireless backhaul node and donor base station | |
| EP4061051A1 (en) | Data transmission method and apparatus | |
| US20050052997A1 (en) | Packet scheduling of real time packet data | |
| WO2004064424A1 (en) | Packet service system and method for controlling packet transmission | |
| CN112235833B (en) | Dynamic configuration method of data flow parameters and session management functional entity |
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 |