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

Ho, Charlotte Yuk-Fan and Ling, Bingo Wing-Kuen and Iu, Herbert Ho-Ching (2010) Symbolic dynamical model of average queue size of random early detection algorithm. International Journal of Bifurcation and Chaos, 20 (5). pp. 1415-1437. ISSN 0218-1274

Documents
symbolic_dynamical_model_of_average_queue_size_of_randon_early_detection.pdf
[img]
[Download]
[img]
Preview
PDF
symbolic_dynamical_model_of_average_queue_size_of_randon_early_detection.pdf - Whole Document

659Kb

Official URL: http://dx.doi.org/10.1142/S0218127410026575

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.

Item Type:Article
Additional Information: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.
Keywords:Transmission control protocol, random early detection algorithm, internet congestion problem, symbolic dynamics, Lyapunov stability.
Subjects:H Engineering > H310 Dynamics
Divisions:College of Science > School of Engineering
ID Code:2677
Deposited By: Rosaline Smith
Deposited On:11 Jun 2010 19:42
Last Modified:13 Mar 2013 08:39

Repository Staff Only: item control page