«Random Early Detection (RED)»
۶۴۱ نتیجهan improvement over random early detection algorithm: a self-tuning approach
random early detection (red) is one of the most commonly used active queue management (aqm) algorithms that is recommended by ietf for deployment in the network. although red provides low average queuing delay and high throughput at the same time, but effectiveness of red is high
An Improvement over Random Early Detection Algorithm: A Self-Tuning Approach
Random Early Detection (RED) is one of the most commonly used Active Queue Management (AQM) algorithms that is recommended by IETF for deployment in the network. Although RED provides low average queuing delay and high throughput at the same time, but effectiveness of RED is high
Random Early Detection Gateways for Gongestion Avoidance
The paper presents an active queue management technique of preventing congestion in packet-switch networks called Random Early Detection (RED) gateways. RED is based on the observation that congestion can most accurately be understood at the gateway, since it can distinguish high
Self-Tuning Random Early Detection Algorithm to Improve Performance of Network Transmission
We use a discrete-time dynamical feedback system model of TCP/RED to study the performance of Random Early Detection RED for different values of control parameters. Our analysis shows that the queue length is able to keep stable at a given target if the maximum probability pmax a
Refined Design of Random Early Detection Gateways
Random Early Detection (RED) was proposed as an active gateway queue-management mechanism. This paper proposes to alter the RED design guideline that unconditionally allows transient congestion, and evaluates its impacts. This unconditional allowance of transient congestion is sh
Modeling and Performance Analysis of Dynamic Random Early Detection (DRED) Gateway for Congestion Avoidance
One of the most prominent congestion avoidance schemes in the Internet architecture is the Random Early Detection (RED) algorithm. Several modifications and enhancements have been made to the original RED so as to make it more responsive to congestion avoidance at the gateways. I
Modeling random early detection in a differentiated services network
An analytical framework for modeling a network of Random Early Detection (RED) queues with mixed traffic types (e.g. TCP and UDP) is developed. Expressions for the steady state goodput for each flow and the average queuing delay at each queue are derived. The framework is extende
Title of Dissertation: DYNAMICS OF RANDOM EARLY DETECTION GATEWAY UNDER A LARGE NUMBER OF TCP FLOWS
Title of Dissertation: DYNAMICS OF RANDOM EARLY DETECTION GATEWAY UNDER A LARGE NUMBER OF TCP FLOWS Peerapol Tinnakornsrisuphap, Doctor of Philosophy, 2004 Dissertation directed by: Professor Armand M. Makowski Department of Electrical and Computer Engineering While active queue
Symbolic Dynamical Model of Average Queue Size of Random Early Detection Algorithm
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
Open shortest path first routing under random early detection
In this paper we consider a variant of Open Shortest Path First (OSPF) routing that accounts for Random Early Detection (RED), an Active Queue Management method for backbone networks. In the version of OSPF we consider in this paper we only require a single network path be availa