In order to achieve high throughput and low average delay in computer network, it is necessary to stabilize the queue length and avoid oscillation or chaos phenomenon. In this paper, based on Adaptive Random Early Detection ARED , an improved algorithm is proposed, which dynamically changes the range of maximum drop probability pmax according to different network scenarios and adjusts pmax to l...

Random Early Detection (RED) can stabilize the queue within a given target range and thus achieve high throughput in the routers. However, the average queue size is quite sensitive to network scenarios and it is difficult to adapt RED parameters to changing network traffic. In this paper we use a previously developed dynamic model of TCP behavior and linear feedback model of TCP/RED to analyze ...

Active buffer management can improve the performance of Transmission Control Protocol/Internet Protocol-based networks. Random early detection (RED), an active queue management scheme, has been proposed by the Internet Engineering Task Force for next-generation Internet routers. RED uses a number of parameters, such as buffer thresholds, a packet drop probability and a weight parameter. RED suf...

We address the deployment of Random Early Detection (RED) on class-based queues (CBQs) with shared buffer by deriving novel RED algorithms for the complete sharing and sharing with minimum allocation schemes and comparing their performance with RED under complete partitioning that is equivalent to using a dedicated buffer for each CBQ. In our novel RED algorithms, packet drop decision is based ...

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 cond...

|Multimedia ows are inherently inhomogenous, i.e. packets within a ow are of di erent importance for actual user perception. When transmitting such ows with real-time constraints in networks like the Internet which o er no reliability of transmission, some packet loss is inevitable. The perceptual impact of these losses is then ampli ed by the arbitrary distribution of packet losses within the ...

A Combined Input and Output Queued (CIOQ) switch with a certain speedup of S (1<S<N) can achieve 100% throughput and offer QoS guarantees. In this paper, we present the deployment of Random Early Detection (RED) on a CIOQ switch that has priority queues with shared buffer (class based switch). We first give an estimated model to concrete that one RED controller per output port is sufficient for...

The main objective of this research is to analyze the bifurcation phenomenon in Internet congestion model for Transmission Control Protocol (TCP) with Random Early Detection (RED). This problem can be divided to many categories considering different viewpoints. Different approaches of modeling (continuous and discrete models) and various system structures (control in end node or routers) are so...

Pricing-based Active Queue Management (AQM), such as Random Exponential Marking (REM), outperforms other probabilistic counterpart techniques, like Random Early Detection (RED), in terms of both high utilization and negligible loss and delay. However, the pricing-based protocols do not take account of unresponsive flows that can significantly alter the subsequent rate allocation. This letter pr...

This work documents the implementation of the BLUE Active Queue Management algorithm for the Linux Operating System and its evaluation by measurements. The issues of Active Queue Management (AQM), and the search for the most adequate AQM algorithms are important in these days because of the changing traffic dynamics – mostly congestion – on the Internet, and the rising quality expectations held...