Computer Science – Networking and Internet Architecture
Scientific paper
2008-08-28
Computer Science
Networking and Internet Architecture
7 pages, 2 figure, technical report
Scientific paper
This paper proposes an adaptive variant of Random Early Detection (RED) gateway queue management for packet-switched networks via a discrete state analog of the non-stationary Master Equation i.e. Markov process. The computation of average queue size, which appeared in the original RED algorithm, is altered by introducing a probability $P(l,t)$, which defines the probability of having $l$ number of packets in the queue at the given time $t$, and depends upon the previous state of the queue. This brings the advantage of eliminating a free parameter: queue weight, completely. Computation of transition rates and probabilities are carried out on the fly, and determined by the algorithm automatically. Simulations with unstructured packets illustrate the method, the performance of the adaptive variant of RED algorithm, and the comparison with the standard RED.
Süzen Mehmet
Süzen Ziya
No associations
LandOfFree
Adaptive Dynamic Congestion Avoidance with Master Equation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Adaptive Dynamic Congestion Avoidance with Master Equation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adaptive Dynamic Congestion Avoidance with Master Equation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-541785