Random Early Detection Mechanism Research Articles

Survey on Random Early Detection Mechanism and Its Variants

Active Queue Management (AQM) algorithms are an Implementing schemes, So that packets are transmitted with higher priority than others. Random Early Detection (RED) is the first active queue management algorithm proposed for deployment in TCP/IP networks. RED has some parameter tuning issues that need to be carefully addressed for it to give good performance under different network scenarios. Various algorithms come from RED such as Stabilized RED (SRED), Dynamic RED (DRED), Adaptive RED (ARED) and Flow RED (FRED) these algorithms control congestion by discarding packets with a load dependent probability whenever a queue in the network appear to be congested, this paper will introduced some features about RED and its variants.

Scalable voice over Internet protocol service-level agreement guarantees in converged transmission control protocol/Internet protocol networks

Increasing complexity of the recent introduced quality of service (QoS) provisioning tools in packet-switched networks becomes a major obstacle for Internet service providers to practically deploy and manage these mechanisms to guarantee a range of transparent real-time service-level agreements. The authors revisit the existing Internet protocol (IP) QoS approaches and present a cost-effective solution to provide voice over Internet protocol (VoIP) service guarantees in converged IP networks by combining open shortest-path first traffic engineering with new insights for the configuration of standard active queue management random early detection mechanism. Extensive simulation studies are carried out, and the service quality is explicitly quantified using international telecommunication union E-model for a range of scenarios representing different types of network uncertainties. The direct representation of VoIP service quality well demonstrate that such a simple, coordinated approach, in keeping with the Internet paradigm, can achieve increased load for a given quality level and greater resilience under degraded network conditions.

Per-stream loss behavior of ∑MAP/M/1/K queuing system with a random early detection mechanism

In this paper, the matrix-analytic approach is applied to explore the per-stream loss behavior of the multimedia traffic under RED scheme. We constructed a ∑MAP/M/1/K queuing model for the RED mechanism with multimedia traffic which follows a continuous-time Markovian arrival process (MAP). In addition to evaluating the long-term per-stream packet drop probabilities, we examine the bursty nature of per-stream packet drops by means of conditional statistics with respect to dropped periods and the probability that the queuing system stays in the dropped period. The dropped period corresponds to having more than a certain number of packets in router buffer; non-dropped period corresponds to the opposite. These performance measures describe the quality of service provided by the router to particular multimedia traffic streams in the presence of background multimedia traffic.

On model-driven self-engineering of inter-domain traffic

Realizing autonomic networking is possible with the clear understanding of required control mechanisms under multiplexing. Attempting such understanding ecosystem is motivated as a novel unit of design, exemplified by the two extreme cases – micro-ecosystem of a single buffer with random early detection mechanism, and macro-ecosystem of a path of autonomous systems sharing traffic handling to the same destination prefix. Both problems are formalised as model-driven information coupling of distributed controllers, implicit for the micro, and explicit for the macro-ecosystems. The main contributions are ecosystem examples and their driving models; the geometry based route view diagram driving self-engineering of traffic is original, while linear bound of packet loss ratio driving the micro-ecosystem is borrowed from the literature and adapted.

AIMD-based online MPLS traffic engineering for TCP flows via distributed multi-path routing

With this paper, we propose a distributed online traffic engineering architecture formpls networks. In this architecture, a primary and secondarympls lsp are established from an ingresslsr to every other egresslsr. We propose to split thetcp traffic between the primary and secondary paths using a distributed mechanism based onecn marking andaimd-based rate control. Inspired by the random early detection mechanism for active queue management, we propose a random early reroute scheme to adaptively control the delay difference between the primary and secondarylsps. Considering the adverse effect of packet reordering ontcp performance for packet-based load balancing schemes, we propose that thetcp splitting mechanism operates on a per-flow basis. Using flow-based models developed for Internet traffic and simulations, we show that flow-based distributed multi-path traffic engineering outperforms on a consistent basis the case of a single path in terms of per-flow goodputs. Due to the elimination of out-of-order packet arrivals, flow-based splitting also enhancestcp performance with respect to packet-based splitting especially for longtcp flows that are hit hard by packet reordering. We also compare and contrast two queuing architectures for differential treatment of data packets routed over primary and secondarylsps in thempls data plane, namely first-in-first-out and strict priority queuing. We show through simulations that strict priority queuing is more effective and relatively more robust with respect to the changes in the traffic demand matrix than first-in-first-out queuing in the context of distributed multi-path routing.

A Comprehensive Performance Analysis of Random Early Detection Mechanism

One of the most promising active queue management schemes being proposed for deployment in the Internet is the Random Early Detection (RED) scheme. However, research results on RED performance are highly mixed, especially in the field of tuning its parameters. In this paper, a comprehensive performance analysis of RED is presented. We revisit some features in RED and study them in greater detail. We point out that RED, in general, does not possess proportional loss between flows as claimed and widely adopted in previous research. We suggest the generalization of the PASTA property and give a proof for TCP flows. We also evaluate the performance of the Exponential Weighted Moving Average (EWMA) algorithm in RED. We find that EWMA in RED is an unbiased estimator of the average queue-length, regardless of the weighting value w q . We also point out the theoretical and practical limits of EWMA in RED. Finally, we propose the use of fuzzy EWMA to RED (fuzzy RED) to alleviate the inflexibility of RED tuning. We use simulations to evaluate the performance of fuzzy RED and compare it with other versions of RED. Our simulations show that, in the case of a high workload and a high level of variation, fuzzy RED, by tracking system variation in an on-line manner, improves RED performance in a number of important router-based metrics like packet loss rate, average queueing delay, link utilization, and global power.