SYMBOLIC DYNAMICAL MODEL OF AVERAGE QUEUE SIZE OF RANDOM EARLY DETECTION ALGORITHM
2010 ◽
Vol 20
(05)
◽
pp. 1415-1437
◽
Keyword(s):
In this paper, a symbolic dynamical model of the average queue size of the random early detection (RED) algorithm is proposed. The conditions for both the system parameters and the initial conditions that the average queue size of the RED algorithm would converge to a fixed point are derived. These results are useful for network engineers to design both the system parameters and the initial conditions so that internet networks can achieve a good performance.
2008 ◽
Vol 4
(1)
◽
2005 ◽
Vol 7
(3)
◽
pp. 337-352
◽
2015 ◽
Vol 122
(17)
◽
pp. 27-31
2010 ◽
Vol 2010
◽
pp. 1-14
◽
Keyword(s):
2015 ◽
Vol 08
(07)
◽
pp. 282-294
◽