PERFORMANCE ANALYSIS OF THE RANDOM EARLY DETECTION ALGORITHM

Authors:
V. Sharma;J. Virtamo;P. Lassila
Affiliations:
Department of Electrical Communication Engineering, Indian Institute of Science, Bangalore, 560012, India, E-mail: vinod@ece.iisc.ernet.in;Networking Laboratory, Helsinki University of Technology, FIN-02015 HUT, Finland, E-mail: Jorma.Virtamo;Networking Laboratory, Helsinki University of Technology, FIN-02015 HUT, Finland, E-mail: Pasi.Lassila@hut.fi
Venue:
Probability in the Engineering and Informational Sciences
Year:
2002

Citing 7
Cited 6

Adaptive algorithms and stochastic approximations

Adaptive algorithms and stochastic approximations
Random early detection gateways for congestion avoidance

IEEE/ACM Transactions on Networking (TON)
Stochastic Approximation Methods for Systems Over an InfiniteHorizon

SIAM Journal on Control and Optimization
Dynamics of random early detection

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
High-speed networks: TCP/IP and ATM design principles

High-speed networks: TCP/IP and ATM design principles
Explicit allocation of best-effort packet delivery service

IEEE/ACM Transactions on Networking (TON)
Some limit theorems for regenerative queues

Queueing Systems: Theory and Applications

Analyzing the Impact of TCP Connections Variation on Transient Behavior of RED Gateway

ICOIN '02 Revised Papers from the International Conference on Information Networking, Wireless Communications Technologies and Network Applications-Part I
Stability and Analysis of TCP Connections with RED Control and Exogenous Traffic

Queueing Systems: Theory and Applications
Achieving 100% throughput in TCP/AQM under aggressive packet marking with small buffer

IEEE/ACM Transactions on Networking (TON)
Per-stream loss behavior of ΣMAP/M/1/K queuing system with a random early detection mechanism

Information Sciences: an International Journal
A proof of convergence of the B-RED and P-RED algorithms for random early detection

IEEE Communications Letters
Elucidating the short term loss behavior of a DMAP process in random early detection queue with background DBMAP

Proceedings of the 6th International Conference on Queueing Theory and Network Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this article we consider a finite queue with its arrivals controlled by the random early detection algorithm. This is one of the most prominent congestion avoidance schemes in the Internet routers. The aggregate arrival stream from the population of transmission control protocol sources is locally considered stationary renewal or Markov modulated Poisson process with general packet length distribution. We study the exact dynamics of this queue and provide the stability and the rates of convergence to the stationary distribution and obtain the packet loss probability and the waiting time distribution. Then we extend these results to a two traffic class case with each arrival stream renewal. However, computing the performance indices for this system becomes computationally prohibitive. Thus, in the latter half of the article, we approximate the dynamics of the average queue length process asymptotically via an ordinary differential equation. We estimate the error term via a diffusion approximation. We use these results to obtain approximate transient and stationary performance of the system. Finally, we provide some computational examples to show the accuracy of these approximations.