Location of Repository

Symbolic dynamical model of average queue size of random early detection algorithm

By Charlotte Yuk-Fan Ho, Bingo Wing-Kuen Ling and Herbert Ho-Ching Iu

Abstract

In this paper, a symbolic dynamical model of the average queue size of the random early detection (RED) algorithm is proposed. The conditions on 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 would achieve a good performance

Topics: H310 Dynamics
Publisher: SPIE
Year: 2010
DOI identifier: 10.1142/S0218127410026575
OAI identifier: oai:eprints.lincoln.ac.uk:2677

Suggested articles

Preview

Citations

  1. (2008). Analysis and control of bifurcation and chaos in average queue length in TCP/RED model,” doi
  2. (2003). Controlling bifurcation and chaos in internet congestion doi
  3. Impulsive control bifurcation and chaos in internet TCP-RED congestion control system,” doi
  4. (2002). Nonlinear instabilities doi
  5. (2004). Nonlinear instabilities in TCP-RED,” doi
  6. (2007). Sunil Samtani, Aristides Staikos, Mitesh Patel and Jeffrey Bowcock, “Network layer congestion control to ensure quality of service (QOS) doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.