CN104012048B - For providing the apparatus and method of random early check in a packet switched network - Google Patents
For providing the apparatus and method of random early check in a packet switched network Download PDFInfo
- Publication number
- CN104012048B CN104012048B CN201280057717.9A CN201280057717A CN104012048B CN 104012048 B CN104012048 B CN 104012048B CN 201280057717 A CN201280057717 A CN 201280057717A CN 104012048 B CN104012048 B CN 104012048B
- Authority
- CN
- China
- Prior art keywords
- queue
- aqs
- packet
- queue length
- enumerator
- 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
- 238000001514 detection method Methods 0.000 description 10
- 230000003139 buffering Effects 0.000 description 3
- 230000005540 biological transmission Effects 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000000034 method Methods 0.000 description 1
Abstract
A kind of for providing device (1) and the method for random early check RED in a packet switched network, described device (1) including: goes out group enumerator (2), and each packet is when queue Q goes out group, and it is incremented by；Every time packet join the team described queue Q time, it resets；Coefficient storage table CMT, which stores M attenuation quotient C of predetermined number；And computing unit (4), when each packet joins the team described queue Q, according to attenuation quotient C calculate described queue Q average queue length AQS, wherein said attenuation quotient from described go out group enumerator (2) reset before its point to described coefficient storage table CMT storage address read.
Description
Background technology
Random early check (random early detection, RED be one in a packet switched network
Avoid the mechanism of flow congestion.Tradition random early check mechanism, also referred to as Random early detection
(random early discard/random early drop) mechanism, is that a kind of active queue management is calculated
Method.Use random early check mechanism, can before congested generation random drop data.Along with number
Uprising according to congested, the probability of data packet discarding increases.Random early check mechanism can monitor average team
Row length (average queue size, AQS) based on statistical probability method (statistical probabilities)
Packet discard.Such as, if buffering almost sky, all incoming packets are accepted.When in buffering
Packet queue Q increase time, the probability abandoning incoming packet also increases.If buffering the fullest,
So probability becomes 100% and abandons all incoming packets.For each reception packet again
Calculate average queue length AQS.But, in traditional random early check mechanism of packet switching network
In, the calculating of average queue length AQS only considers the input function of the data received, and does not has
Consider output function, i.e. tradition random early check mechanism only considers the team that joins the team of incoming packet
Row Q, and do not account for packet and go out team from each queue.Therefore, use in a packet switched network
Traditional random early check method really illustrate only prediction data congested and avoid in network this
Plant the limited capability of data congestion.
Accordingly, it is desirable to provide one can the most exactly prediction data congested also
The apparatus and method preferably avoiding data congestion are provided.
Summary of the invention
The invention provides a kind of device for providing random early check in a packet switched network
As first aspect, described device includes:
Going out group enumerator, each packet is when queue Q goes out group, and it is incremented by；Packet is joined the team every time
During to described queue Q, it resets；
Coefficient storage table (coefficient memory table, CMT), which stores multiple decay system
Number (decay coefficient) C；And
Computing unit, when each packet joins the team described queue Q, according to attenuation quotient C
Calculate the average queue length AQS of described queue Q, wherein said attenuation quotient from described go out team meter
Number think highly of put before described in go out in the storage address of the described coefficient storage table CMT that group enumerator points to
Read.
In the first possible embodiment of device according to the first aspect of the invention, described calculating is single
Unit is for by the average queue length AQS of calculated described queue Q and max-thresholds and minimum
Threshold ratio is relatively.
In the second embodiment of the first embodiment of device according to the first aspect of the invention,
If described computing unit exceedes described max-thresholds for described average queue length AQS, abandon
The packet received.
Examining for the random early stage of offer in a packet switched network according to the first aspect of the invention
In 3rd embodiment of the first or second embodiment of the device surveyed, described computing unit is for such as
The most described average queue length AQS is less than described minimum threshold, is joined the team by the packet of described reception.
Examining for the random early stage of offer in a packet switched network according to the first aspect of the invention
In first to the 3rd embodiment of the device surveyed in the 4th embodiment of any one, described calculating is single
If unit for described calculated average queue length AQS between described minimum threshold and described
Between max-thresholds, the packet received described in random drop.
Examining for the random early stage of offer in a packet switched network according to the first aspect of the invention
In 5th embodiment of the 4th embodiment of the device surveyed, if described calculated average team
Row length AQS between described minimum threshold and described max-thresholds, random drop receive number
According to bag, the drop probability of the most each traffic prioritization is different.
Examining for the random early stage of offer in a packet switched network according to the first aspect of the invention
In 6th embodiment of the first to the 5th embodiment of the device surveyed, described computing unit is for such as
Lower calculating described average queue length AQS:
[Curr AQS–Queue Size Diff]x C+Queue Size Diff,
Wherein Curr AQS is current average queue length AQS,
Queue Size Diff is that queue length is poor,
Queue Size Diff=(Prev Queue Size Curr Queue Size)/2,
Wherein Prev Queue Size is the queue length of the described queue Q being previously calculated,
Curr Queue Size is the queue length of current calculated described queue Q,
C goes out the described pointer value of group enumerator according to described queue Q and stores from described coefficient
The described attenuation quotient read in table CMT.
Examining for the random early stage of offer in a packet switched network according to the first aspect of the invention
In 7th embodiment of the 6th embodiment of the device surveyed, described attenuation quotient C is decay system
Number.
Examining for the random early stage of offer in a packet switched network according to the first aspect of the invention
In 8th embodiment of the 7th embodiment of the device surveyed, described precalculated attenuation quotient is
The coefficient of the decaying exponential function of storage in described coefficient storage table CMT.
Examining for the random early stage of offer in a packet switched network according to the first aspect of the invention
In 7th or the 8th embodiment of the device surveyed in any one the 9th possible embodiment, described meter
Calculate unit for calculating the described attenuation function C of described decaying exponential function as follows in advance:
X [i+1]=x [i] x (N W)/N
C [i+1]=(x [i+1] x [0])/x [0]
Wherein x [0] is Arbitrary Digit, N and W is Arbitrary Digit (W < N), and i is variable.
Examining for the random early stage of offer in a packet switched network according to the first aspect of the invention
In the possible embodiment of the tenth of 9th embodiment of the device surveyed,
X [0] is set to 100,
W is set to 1,
N is set to 256.
Invention further provides a kind of for providing random early check in a packet switched network
Method as second aspect, said method comprising the steps of:
Every time packet is when queue Q goes out group, is incremented by and group enumerator；Every time packet is joined the team institute
When stating queue Q, reset out group enumerator；And
Every time packet join the team described queue Q time, calculate described queue Q according to attenuation quotient C
Average queue length AQS, described attenuation quotient from described go out group enumerator reset before described in go out team
The storage address of the coefficient storage table CMT that enumerator points to is read.
Examining for the random early stage of offer in a packet switched network according to the second aspect of the invention
In the possible embodiment of the first of the method surveyed, described method farther includes described calculated
The average queue length AQS of described queue Q compares with max-thresholds and minimum threshold.
Examining for the random early stage of offer in a packet switched network according to the second aspect of the invention
The second of first embodiment of the method surveyed may in embodiment, described method farther include as
The most described calculated average queue length AQS exceedes described max-thresholds, abandons the number of reception
According to bag.
Examining for the random early stage of offer in a packet switched network according to the second aspect of the invention
In the possible embodiment of the 3rd of first or second embodiment of the method surveyed, described method is further
If including described calculated average queue length AQS less than described minimum threshold, by described
The packet received is joined the team.
Examining for the random early stage of offer in a packet switched network according to the second aspect of the invention
In first to the 3rd embodiment of the method surveyed in any one the 4th possible embodiment, described side
If method farther includes described calculated average queue length AQS between described minimum threshold
And between described max-thresholds, the packet received described in random drop.
Examining for the random early stage of offer in a packet switched network according to the second aspect of the invention
In the possible embodiment of the 5th of the method surveyed, the packet bag of random drop (S10) described reception
Include the packet (S10) received described in random drop, the drop probability of the most each traffic prioritization
Different.
Examining for the random early stage of offer in a packet switched network according to the second aspect of the invention
In the possible embodiment of the 6th of the method surveyed, described method farther includes according to attenuation quotient C such as
The described average queue length AQS of lower calculating described queue Q:
[Curr AQS–Queue Size Diff]x C+Queue Size Diff,
Wherein Curr AQS is current average queue length AQS,
Queue Size Diff is that described queue length is poor,
Queue Size Diff=(Prev Queue Size Curr Queue Size)/2,
Wherein Prev Queue Size is the queue length of the described queue Q being previously calculated,
Curr Queue Size is current calculated queue length, and
C goes out the described pointer value of group enumerator according to described queue Q and stores from described coefficient
The attenuation quotient read in table CMT.
Examining for the random early stage of offer in a packet switched network according to the second aspect of the invention
In first to the 6th embodiment of the method surveyed any one the 7th may in embodiment, described in decline
Subtracting coefficient C is precalculated attenuation quotient.
Examining for the random early stage of offer in a packet switched network according to the second aspect of the invention
In the possible embodiment of the 8th of 7th embodiment of the method surveyed, described precalculated decay system
Number is the coefficient of the decaying exponential function of storage in described coefficient storage table CMT.
Examining for the random early stage of offer in a packet switched network according to the second aspect of the invention
In the possible embodiment of the 9th of the method surveyed, it is described that described method farther includes following calculating the most in advance
The described attenuation quotient C of decaying exponential function:
X [i+1]=x [i] x (N W)/N
C [i+1]=(x [i+1] x [0])/x [0]
Wherein x [0] is Arbitrary Digit,
N and W is Arbitrary Digit (W < N), and i is variable.
According to the third aspect of the invention we, it is provided that a kind of for providing random in a packet switched network
The substituted device of detection in early days.Described device includes for performing according to second aspect or second aspect
The processor of the method for any one in aforementioned first to the 9th form of implementation.
Invention further provides include according to the first aspect of the invention, according to first aspect before
State in the first to the tenth form of implementation any one or the packet of device according to the third aspect of the invention we
Exchange network is as fourth aspect.
In the possible embodiment of packet switching network according to the fourth aspect of the invention, described net
Network includes the Internet.
According to the 5th aspect, the present invention can in Fundamental Digital Circuit or computer hardware, firmware,
In computer software or implement in combinations thereof.Described computer software includes for performing according to second
Aspect or according to the program of the method for any one in aforementioned first to the 9th form of implementation of second aspect
Code.
These and other aspects of the present invention are apparent from embodiments discussed below.
Accompanying drawing explanation
Describe according to the use in terms of the first, second, third and fourth of the present invention below with reference to accompanying drawing
Possible embodiment in the apparatus and method providing random early check in a packet switched network.
Fig. 1 show the possible embodiment party of random early check device according to the first aspect of the invention
The block diagram of formula；
Fig. 2 show according to the second aspect of the invention for providing random in a packet switched network
The flow chart of the possible embodiment of the method for detection in early days；
Fig. 3 show show by tradition random early check mechanism contrast according to assembly of the invention and
The queue under random data traffic average that the random early check mechanism that method provides provides
The figure of queue length AQS.
Detailed description of the invention
Fig. 1 show for providing random early check (random early in a packet switched network
Detection, RED) the possible embodiment of device 1.In the embodiment shown, device 1
Including queue Q, packet can join the team (ENQ) go out team (DEQ) to queue Q with from queue Q.
For providing the device 1 of random early check to farther include out group enumerator in a packet switched network
2, each packet, when queue Q goes out group, goes out group enumerator 2 and is incremented by；Packet is joined the team every time
During queue Q, go out group enumerator 2 and reset.
Queue is a kind of certain types of abstract data type or a kind of set, and the entity in this set is pressed
Sequence arranges.As a example by fifo queue, main (or unique) operation to set is to be increased by entity
To rear end position, it is referred to as joining the team, and entity is removed from anterior terminal position, be referred to as team.
This makes queue become FIFO (FIFO) data structure.
It can be seen from figure 1 that in the embodiment shown, for providing random in a packet switched network
The device 1 of detection includes the coefficient storage table CMT of storage, wherein this coefficient in memorizer 3 in early days
Storage table CMT stores M attenuation quotient C of predetermined number, as shown in Figure 1.
For providing the device 1 of random early check RED to farther include in a packet switched network
Computing unit 4.Computing unit 4 is when each packet joins the team queue Q, according to attenuation quotient
C calculates the average queue length AQS of each queue Q, and this attenuation quotient C is from going out group enumerator 2
Go out before replacement in the storage address of the coefficient storage table CMT that group enumerator 2 points to and read.Queue
The storage size of Q, i.e. can join the team the number of data packets in each queue of device 1 can basis
The application of device 1 and change.Further, in the queue Q of device 1, the packet of storage is all right
There is different data package sizes and different types of packet and/or data protocol can be included.
For providing the device 1 of random early check RED can form one more in a packet switched network
Router in complicated device or the part of machine, such as packet switching network.This router
Each port can have different queue Q, wherein in possible embodiment, can give each team
Row distribution is such as from the input traffic of client.This client can be connected to respectively by link
The port of individual router, each router include shown in Fig. 1 for providing in a packet switched network
The device 1 of random early check RED.In possible embodiment, each client can be at device
The queue Q of oneself is had in 1.In possible embodiment, computing unit 4 can export and calculate
The average queue length AQS of each queue Q arrived is for processing further.
For providing the another possible embodiment party of the device 1 of random early check in a packet switched network
In formula, computing unit 4 is further used for the average queue length of calculated each queue Q
AQS compares with predetermined maximum threshold and predetermined minimum threshold.In possible embodiment, for device
For the different application of 1, max-thresholds and minimum threshold are revisable.At possible embodiment
In, if calculated average queue length AQS exceedes max-thresholds, computing unit 4 is permissible
The packet of reception is abandoned for each queue Q.On the contrary, if calculated average queue length
AQS is less than minimum threshold, and the packet of reception is joined the team each queue Q by computing unit.Another
In possible embodiment, if computing unit for calculated average queue length AQS between
Between minimum threshold and max-thresholds, the packet that random drop receives.First according to the present invention
The possible particular implementation of the device 1 for providing random early check in a packet switched network of aspect
In mode, computing unit 4, for average queue length AQS calculated as below, is also referred to as next average team
Row length NEXT AQS:
NEXT AQS=[Curr AQS Queue Size Diff] x C+Queue Size Diff,
Wherein Curr AQS is current average queue length AQS,
Queue Size Diff is that described queue length is poor,
Queue Size Diff=(Prev Queue Size Curr Queue Size)/2,
Wherein Prev Queue Size is the queue length of each queue Q being previously calculated,
Curr Queue Size is the queue length of the most calculated each queue Q,
C is that the pointer value going out group enumerator 2 according to each queue Q is from described coefficient storage table CMT
The attenuation quotient of middle reading.
In possible embodiment, in memorizer 3, the attenuation quotient C of storage can be coefficient storage table
The precalculated attenuation quotient of the decaying exponential function of storage in CMT.In possible embodiment,
In coefficient storage table CMT built-in storage 3, the attenuation function C of storage is precalculated and is can
Configuration.In possible embodiment, the computing unit 4 of device 1 calculates device 1 the most in advance for following
Memorizer 3 in the attenuation quotient C of decaying exponential function of storage:
X [i+1]=x [i] x (N W)/N
C [i+1]=(x [i+1] x [0])/x [0]
Wherein x [0] is Arbitrary Digit, N and W is Arbitrary Digit (W < N), and i is variable.
In possible illustrative embodiments, it is worth as follows:
X [0] is set to 100,
W is set to 1,
N is set to 256.
Fig. 2 show according to the second aspect of the invention for providing random in a packet switched network
The flow chart of the possible embodiment of the method for detection RED in early days.
As it is clear from fig. 2 that in step S1, next packet will be by each queue Q process.?
Further step S2, determination data bag the need of join the team each queue Q or need from each
Queue Q goes out team.If packet is dequeued, RED device 1 go out group enumerator 2 in Fig. 2 institute
Step S3 shown is incremented by.On the other hand, each queue Q if packet is joined the team, according to Fig. 2
The address going out the instruction of group Counter Value in shown step S4 is read from coefficient storage table CMT and is declined
Subtract coefficient (also referred to as attenuation function coefficient) C.Read from coefficient storage table CMT in step 4
After attenuation quotient, in step s 5 reset apparatus 1 go out group enumerator 2.In step S6, meter
Calculate the average queue length AQS of each queue Q.Further, in possible embodiment, meter
Calculation equation is as follows:
NEXT AQS=[Curr AQS Queue Size Diff] x C+Queue Size Diff,
Wherein NEXT AQS is the average queue length AQS currently calculated,
Curr AQS is current average queue length AQS,
Queue Size Diff is that described queue length is poor,
Queue Size Diff=(Prev Queue Size Curr Queue Size)/2,
Wherein Prev Queue Size is the queue length of each queue Q being previously calculated,
Curr Queue Size is current calculated queue length, and
C is that in step S4, the pointer value going out group enumerator 2 according to each queue Q stores from coefficient
The attenuation quotient read in table CMT.
The execution requirement out of order of step S5 and S6, they can perform with executed in parallel or successively.Example
As, in fig. 2, before step S6, perform step S5.
At further step S7, relatively calculated average queue length AQS and predetermined maximum
Threshold value THMAXIf average queue length AQS exceedes predetermined maximum threshold, in step S8, lose
Abandon packet.If the average queue length AQS of calculated each queue Q is less than maximum threshold
Value THmax, in step S9, relatively calculated average queue length AQS and minimum threshold
THmin.If calculated average queue length AQS exceedes minimum threshold THmin, i.e. between
Between minimum threshold and max-thresholds, in step S10, abandon the packet of reception.On the contrary, if
Calculated average queue length AQS is also below minimum threshold THmin, in the step shown in Fig. 2
In S11, packet is joined the team.
Computing mechanism shown in the embodiment of Fig. 2 not only performs the iteration joined the team, and i.e. inputs data
Bag, it is also contemplated that packet go out team's (output packet).Correspondingly, the computing mechanism shown in Fig. 2
It not the iteration simply increasing out team, thus double calculating number and to read current average queue long
Bandwidth needed for degree and queue length value.In order to avoid this unfavorable (penalty), the enforcement of Fig. 2
Computational methods shown in mode only calculate joining the team, but can store table CMT with coefficient of utilization
Estimation (approximate) goes out the impact of group number.The method according to the invention uses out group enumerator
2, go out group enumerator 2 and be incremented by when going out group every time；When run into join the team time, reset out in step s 5
Team's enumerator 2.Go out group enumerator 2 to represent that packet is joined the team for the last time and go out team after queue Q
Number.If running into team, from coefficient storage table CMT, read coefficient C.Coefficient storage table CMT
Can be based on decaying exponential function, wherein attenuation quotient C is precalculated, calculates the most in advance.
Each attenuation quotient C is stored at the storage address of memorizer 3, as shown in Figure 1.Go out group enumerator
The value of 2 is as selecting to store the pointer of the storage address of attenuation function coefficient.Memorizer 3 stores
The number M of attenuation quotient C variable.Such as, the number of the attenuation quotient C of storage in memorizer 3
Mesh M can include 1000 exponential damping coefficient C.Carry out group enumerator the most every time
2 when resetting, and goes out group enumerator 2 and arranges in the coefficient storage table CMT restoring reservoir 3 the of storage
One coefficient C1.Every time packet is when each queue Q goes out group, goes out group enumerator 2 in step s3
It is incremented by and points to next the storage address storing next coefficient C.Such as, if in row (row)
Run into 10 dequeue operation, go out group enumerator 2 and be incremented by and directivity factor storage table CMT with 10 times
10th coefficient C of middle storage10.The method shown in Fig. 2 of use, carries out random early check RED
Avoid data on flows congested.The calculating of the average queue length AQS of the method according to the invention,
As shown in the embodiments of figure 2, it is contemplated that the input function of data and output function.Work as consideration
When input and output function, generally speaking, the more preferable average queue of the method according to the invention generation is long
Degree.Keep low computing cost and only carry out calculating and can realize on the packet received by continuing
This point.The average queue length AQS determined improves the energy that the prediction data of device 1 is congested really
Power, and the most preferably avoid data congestion.
According to another embodiment, the method shown in Fig. 2 can be in Fundamental Digital Circuit or at computer
In hardware, firmware, computer software or implement in combinations thereof.Computer software includes for performing
The program code of the method shown in Fig. 2.
According to another embodiment of the present invention, it is provided that a kind of for provide in a packet switched network with
The substituted device of machine detection in early days.This device includes the processor for performing the method shown in Fig. 2.
Fig. 3 shows change calculated average queue under random data traffic over time
The figure of length AQS.It can be seen from figure 3 that according to the present invention for providing in a packet switched network
The method of random early check really show average queue length AQS higher accuracy and
Preferably follow the tracks of.Curve I shows tradition RED mechanism, and calculating average queue of the most only joining the team is long
Degree AQS.Second curve II is the method according to the invention calculated average queue length AQS.
The method calculates the average queue length joined the team and goes out the approximation (approximation) of team.The
Three curve III show joining the team and going out the optimal computed of team of packet.It can be seen from figure 3 that by this
The ratio that calculates of the average queue length that bright (curve II) is carried out uses the tradition for random early check
Being accurately calculated of the average queue length that method (curve I) is carried out because curve II closer to
Best curve III.
Horizontal line represents the time period do not joined the team, and therefore average queue length AQS keeps upper one
Join the team value.Even during the cycle only going out team, average queue length AQS value can continue to rise,
Because queue length is more than average queue length AQS.Even during the cycle only joined the team, averagely
Queue length AQS can continue to decline, because queue length is less than average queue length AQS.
In the possible embodiment of the method according to the invention, if calculated average queue is long
Degree AQS between minimum threshold and max-thresholds, random drop receive packet, the most often
The drop probability of individual traffic prioritization is different.In this embodiment, it is weighted random early check
(weighted random early detection, WRED).For being abandoned by this mechanism
Packet for, the probability of the data traffic with high flow priority is less.
In another possible embodiment, for the response of data packet discarding, agreement, such as Transmission Control Protocol
Transfer rate can be increased, this avoid traffic congestion.For providing random morning in a packet switched network
The method of phase detection RED can use in multiple application and network, is especially combining Transmission Control Protocol
In the Internet.The improvement side for providing random early check in a packet switched network according to the present invention
Method can avoid congested attribute to increase the bandwidth efficiency of network by holding.For at the packet switching network
Network provides random early check method can by any router or use random early check other
Communication equipment makes the performance for improving each router or communication equipment.
Claims (15)
1. the device (1) for offer random early check RED in a packet switched network,
It is characterized in that, described device (1) including:
Going out group enumerator (2), each packet, when queue Q goes out group, goes out group enumerator (2) and passs
Increase；Every time packet join the team described queue Q time, go out group enumerator (2) and reset；
Coefficient storage table CMT, stores multiple attenuation quotient C；And
Computing unit (4), when each packet joins the team described queue Q, according to decay system
Number C calculate described queue Q average queue length AQS, wherein said attenuation quotient from described go out
Go out, described in before team's enumerator (2) replacement, the described coefficient storage table CMT that group enumerator (2) points to
Storage address in read.
Device the most according to claim 1, it is characterised in that
Described computing unit (4) is for by the average queue length AQS of calculated described queue Q
Compare with max-thresholds and minimum threshold；If described average queue length AQS exceedes described maximum
Threshold value, abandons the packet of reception；If described average queue length AQS is less than described Minimum Threshold
Value, joins the team the packet of described reception；And if described calculated average queue length
AQS between described minimum threshold and described max-thresholds, described in random drop receive data
Bag.
Device the most according to claim 2, it is characterised in that
If described calculated average queue length AQS between described minimum threshold and described
Between big threshold value, the packet received described in random drop, abandoning of the most each traffic prioritization is general
Rate is different.
Device the most according to claim 1, it is characterised in that
Described computing unit (4) is for the described average queue length of described queue Q calculated as below:
[Curr AQS–Queue Size Diff]xC+Queue Size Diff,
Wherein Curr AQS is current average queue length AQS,
Queue Size Diff is that queue length is poor,
Queue Size Diff=(Prev Queue Size Curr Queue Size)/2,
Wherein Prev Queue Size is the queue length of the described queue Q being previously calculated,
Curr Queue Size is the queue length of current calculated described queue Q,
C goes out the pointer value of group enumerator from described coefficient storage table according to described queue Q
The described attenuation quotient read in CMT.
Device the most according to claim 1, it is characterised in that
Described attenuation quotient C is the declining of decaying exponential function of storage in described coefficient storage table CMT
Subtract coefficient.
Device the most according to claim 5, it is characterised in that
Described computing unit (4) is for calculating the described decay of described decaying exponential function as follows in advance
Coefficient C:
X [i+1]=x [i] x (N W)/N
C [i+1]=(x [i+1] x [0])/x [0]
Wherein x [0] is Arbitrary Digit, N and W is Arbitrary Digit (W < N), and i is variable.
Device the most according to claim 6, it is characterised in that
X [0] is set to 100,
W is set to 1,
N is set to 256.
8., for the method providing random early check RED in a packet switched network, it is special
Levy and be, said method comprising the steps of:
Every time packet is when queue Q goes out group, is incremented by (S3) and goes out group enumerator (2)；Every number of times
According to when wrapping into team to described queue Q, described in replacement, go out group enumerator (2)；And
Every time packet join the team described queue Q time, calculate (S6) according to attenuation quotient C described
The average queue length AQS of queue Q, wherein said attenuation quotient from described go out group enumerator (2)
Go out described in before replacement in the storage address of the coefficient storage table CMT that group enumerator (2) points to and read
(S4)。
Method the most according to claim 8, it is characterised in that described method farther includes
By the average queue length AQS of described calculated described queue Q and max-thresholds and Minimum Threshold
Value compares (S7, S9)；
If described calculated average queue length AQS exceedes described max-thresholds, abandon (S8)
The packet received,
If described calculated average queue length AQS is less than described minimum threshold, by described
The packet received is joined the team (S11), and
If described calculated average queue length AQS between described minimum threshold and described
Between big threshold value, the packet of random drop (S10) described reception.
Method the most according to claim 9, it is characterised in that random drop (S10) institute
The packet stating reception includes the packet (S10) of reception, the most each flow described in random drop
The drop probability of priority is different.
11. according to Claim 8 to the method described in any claim in 10, it is characterised in that
Described average queue length AQS according to attenuation quotient C (S6) calculated as below described queue Q:
[Curr AQS–Queue Size Diff]xC+Queue Size Diff,
Wherein Curr AQS is current average queue length AQS,
Queue Size Diff is that described queue length is poor,
Queue Size Diff=(Prev Queue Size Curr Queue Size)/2,
Wherein Prev Queue Size is the queue length of the described queue Q being previously calculated,
Curr Queue Size is current calculated queue length, and
C goes out the pointer value of group enumerator (2) according to described queue Q and deposits from described coefficient
The described attenuation quotient read in storage table CMT.
12. according to Claim 8 to the method described in any claim in 10, it is characterised in that
Described attenuation quotient C is the declining of decaying exponential function of storage in described coefficient storage table CMT
Subtract coefficient.
13. according to the method described in claim 12, it is characterised in that described method farther includes
The following described attenuation quotient C calculating described decaying exponential function in advance:
X [i+1]=x [i] x (N W)/N
C [i+1]=(x [i+1] x [0])/x [0]
Wherein x [0] is Arbitrary Digit,
N and W is Arbitrary Digit (W < N), and i is variable.
14. 1 kinds of devices for offer random early check RED in a packet switched network, its
Being characterised by, described device includes performing according to Claim 8 to the place of the method for any one in 13
Reason device.
15. 1 kinds include according in aforementioned claim 1 to 7 and 14 device of any one point
Group exchange network.
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| PCT/EP2012/076641 WO2014094873A1 (en) | 2012-12-21 | 2012-12-21 | An apparatus and a method for providing a random early detection in a packet switched network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104012048A CN104012048A (en) | 2014-08-27 |
| CN104012048B true CN104012048B (en) | 2016-11-30 |
Family
ID=
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6842429B1 (en) * | 2000-02-22 | 2005-01-11 | Ikanos Communications, Inc | Method and apparatus for synchronizing a packet based modem supporting multiple X-DSL protocols |
| CN1801778A (en) * | 2005-12-29 | 2006-07-12 | 中山大学 | Multidimensional queue dispatching and managing system for network data stream |
| CN101116292A (en) * | 2005-02-07 | 2008-01-30 | 英国电讯有限公司 | Policing networks |
| US7558197B1 (en) * | 2002-01-17 | 2009-07-07 | Juniper Networks, Inc. | Dequeuing and congestion control systems and methods |
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6842429B1 (en) * | 2000-02-22 | 2005-01-11 | Ikanos Communications, Inc | Method and apparatus for synchronizing a packet based modem supporting multiple X-DSL protocols |
| US7558197B1 (en) * | 2002-01-17 | 2009-07-07 | Juniper Networks, Inc. | Dequeuing and congestion control systems and methods |
| CN101116292A (en) * | 2005-02-07 | 2008-01-30 | 英国电讯有限公司 | Policing networks |
| CN1801778A (en) * | 2005-12-29 | 2006-07-12 | 中山大学 | Multidimensional queue dispatching and managing system for network data stream |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Kandula et al. | Dynamic load balancing without packet reordering | |
| US8355328B2 (en) | Dynamic load balancing | |
| La et al. | Charge-sensitive TCP and rate control in the Internet | |
| Azar et al. | Management of multi-queue switches in QoS networks | |
| US9042252B2 (en) | Inter-packet interval prediction learning algorithm | |
| Gelenbe | A sensor node with energy harvesting | |
| CN110166367A (en) | The method and device of flow is controlled in a kind of packet network | |
| CN103023806B (en) | The cache resources control method of shared buffer memory formula Ethernet switch and device | |
| CN105978821B (en) | The method and device that network congestion avoids | |
| Akhtar | CONGESTION CONTROL, IN A FAST PACKET | |
| Crisan et al. | Short and fat: TCP performance in CEE datacenter networks | |
| Salah et al. | Performance analysis and comparison of interrupt-handling schemes in gigabit networks | |
| US9344384B2 (en) | Inter-packet interval prediction operating algorithm | |
| CN101707789B (en) | Method and system for controlling flow | |
| CN101094188B (en) | Random test device in advance, and hardware implementation method | |
| CN104012048B (en) | For providing the apparatus and method of random early check in a packet switched network | |
| CN108989233A (en) | Congestion management and device | |
| Hanay et al. | High-performance implementation of in-network traffic pacing | |
| Wang et al. | Performance modelling and analysis of unreliable links with retransmissions using network calculus | |
| CN104012048A (en) | An apparatus and a method for providing a random early detection in a packet switched network | |
| JP4724004B2 (en) | DRR band distribution method and apparatus | |
| Balogh et al. | Mean bandwidth allocation model of WRR for IP networks | |
| WO2017196616A1 (en) | Active probing for troubleshooting links and devices | |
| Lee et al. | A two-phase scheduling algorithm for efficient collective communications of MPICH-G2 | |
| WO2017032401A1 (en) | Counter with reduced memory access |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant |