Random Early Detection Queue Research Articles

Analisis Unjuk Kerja TCP Sack Menggunakan Antrian Random Early Detection

As time goes by, the current technology is also developing very rapidly, the rapid development of technology, especially on the internet network is also developing so that it is expected to continue to provide the best quality to meet the growing and fast information needs. An internet network is highly demanded of its best quality, one of which is in the spotlight to be developed, namely TCP Transmission Control Protocol. The efficiency and smoothness of the data transmission process is the most important thing in a communication network. TCP is one aspect that supports today’s fast internet, with TCP we can exchange information accurately, quickly, and well. In this study, researchers are interested in analyzing the performance of TCP Sack using the Random Early Detection queue. By doing this research is expected to know the performance of TCP Sack by looking at the parameter values of packet delivery ratio, throughput, end to end delay, and packet drop. Based on the results of the analysis, it can be concluded that end-to-end delay parameter testing on the TCP Sack still has poor performance, while for testing the packet delivery ratio, throughput, and packet drop TCP Sack already has good performance.

Nonlinear performance evaluation model for throughput of AQM scheme using full factorial design approach

SummaryThe performance of active queue management (AQM) is measured in terms of throughput, delay, queue size, and loss rate. We have carried out the optimized performance measure of throughput for AQM scheme random early detection (RED) using full factorial design (FDD) technique that is a new approach of performance analysis particularly for congestion control algorithms. We have considered the input factors, viz, buffer size, maximum threshold, and the number of file transfer protocol (FTP) sources for the evaluation of RED that can be used for other AQM schemes, viz, adaptive RED, three‐section RED (TRED), and adaptive queue management with random dropping (AQMRD). The effect of each input factor as well as their interactions are evaluated using factorial design technique that results to obtain the nonlinear equation for performance measure in terms of input factors buffer size, maximum threshold, and the number of FTP sources. Finally, we show the contour plots for variation of performance measure throughput (steady state) from minimum to maximum values with respect to the different setting of input parameters.

Detecting LDoS attack bursts based on queue distribution

Low-rate denial of service (LDoS) attacks exploit the congestion control mechanism to degrade the network quality of service. As a classic active queue management algorithm, random early detection (RED) algorithm is widely used to avoid network congestion. However, RED is vulnerable to LDoS attacks. LDoS attacks with well-configured attack parameters force RED queue to fluctuate severely, thereby throttling transmission control protocol (TCP) senders' sending rate. A feedback control model is proposed to describe the process of the congestion control, by which the congestion window and queue behaviours are analysed combined. After that, a two-dimensional queue distribution model composed of the instantaneous queue and the average queue is designed to extract the attack feature. Moreover then, a combination of a simple distance-based approach and an adaptive threshold algorithm is proposed to detect every LDoS attack burst. Test results of network simulator (NS)-2 simulation and test-bed experiments indicate that the proposed detection strategy can almost completely detect LDoS attack bursts and is especially robust to legitimate short bursts.

A hybrid active queue management technique for QoS based unicasting protocols in MANETs

Mobile Ad hoc Networks (MANETs) is the interconnection of several self-energy dependent mobile nodes. It is one of the self-configured and infrastructure less network. In MANET the issues are security, Quality Of Services, Congestion etc. The major issue of MANET is to control the congestion. Congestion means the network capacity is larger than the no of packets transmitted across the network. In this paper, an effort has been made to evaluate and analyze the performance of the network by means of comparing two on-demand reactive routing protocols such as AODV [Ad-hoc On-demand Distance Vector] and DSR [Dynamic Source Routing] with each other along with also by comparing with DSDV [Destination Sequenced Distance Vector], which is a proactive routing protocol. The comparison is also being made under the light of two queue management techniques such as RED (Random Early Detection) and Droptail. A gateway discovery algorithm is being used by both AODV and DSR routing protocols, which uses the mechanism of connecting mobile nodes through gateway, however Bellman-Ford algorithm is being used by DSDV which uses the concept of including freedom from loops in the routing table. By means of simulation through NS-2 network simulator by varying the number of nodes, we observe that the performance differentials of AODV, DSR, and DSDV routing protocols are directed to foremost performance differentials to guarantee QoS for both of these protocols in RED and Droptail queue management techniques. There is a lot of queue management approach to minimize the congestion rate and transfer the data successfully to the destination. Two queue management techniques popularly used to manage queues in MANets are Active queue management and Passive queue management. Active queue management is widely used and RED is the most popular approach which gives low average delay, high throughput and lower packet drop rate. But RED algorithms have some drawback. So here we are using a hybrid approach, named as MRED by means of combining the features of both RED and ECN to overcome the drawbacks of RED.

Performance Measurement of TCP and UDP Using Different Queuing Algorithm in High Speed Local Area Network

In the current high speed networks, it is increasingly important to have mechanisms that keep throughput high but average queue sizes low. The queue management algorithm, which is applied to a router, plays an important role in providing Quality of Service (QoS). This paper present a Simulation-based performance Evaluation of two well known transport layer protocol TCP and UDP using two popular queue management methods; Random Early Detection (RED) and Drop Tail, in terms of throughput, queuing delay, packet drop rate and bandwidth utilization. In this paper we study the effect of buffer behavior on each one of these QoS measurements. TCP, UDP and shared topology scenarios are simulated by considering varying number of client case topologies and also the effect of performance in TCP and UDP with increasing the number of client. This simulation report is useful for implementing the queue management algorithm in router based on the traffic type and bandwidth. Index Terms—TCP, UDP, drop tail, RED queue, bandwidth delay product, throughput and end-to-end delay.

Easing Congestion in Computer Networks using the Receiver-Window Modification (RWM) Scheme

Random Early Detection (RED), Adaptive RED (ARED), BLUE and other Active Queue Management (AQM) queues have been proposed to replace drop-tail queues for Transmission Control Protocol/Internet Protocol (TCP/IP) networks to ease network congestion. Together with the Exp licit Congestion Notification (ECN) scheme, they had shown some pro mise over the drop tail queues. However, the timeout mechanism or the duration of the reception of three duplicate acknowledgements (ACKs), due to early-dropped packets, delays the response time of TCP in reducing the network congestion. Moreover, using ECN has its downsides: i) its messages may get lost; and ii) TCP implementations at the source, router and the destination have to be ECN-co mpliant (which presents a significant problem in today's implementations). To minimize these problems, this paper presents a novel AQM modification scheme called Receiver-W indow Modification (RWM), wh ich can be used together with any AQM queue for congestion avoidance in packet switched networks, especially at ingress and gateway routers. RWM improves on the average queue sizes, one-way end-to-end packet delays, delay jitter, throughput and number of dropped packets. It also overcomes the dependency of these AQM queues on the queues of downstream routers since ECN messages may get dropped or delayed due to congestion at these routers. We carry out extensive NS2 simulat ions to show our results and to support our claims.

Bounds estimation and practical stability of AIMD/RED systems with time delays

The Additive Increase and Multiplicative Decrease (AIMD) congestion control algorithm of TCP deployed in the end systems and the Random Early Detection (RED) queue management scheme deployed in the intermediate systems contribute to Internet stability and integrity. Previous research based on the fluid-flow model analysis indicated that, with feedback delays, the TCP/RED system may not be asymptotically stable when the time delays or the bottleneck link capacity becomes large [3]. However, as long as the system operates near its desired equilibrium, small oscillations around the equilibrium are acceptable, and the network performance (in terms of efficiency, loss rate, and delay) is still satisfactory. In this paper, we study the practical stability of AIMD/RED system with feedback delays and with both homogeneous and heterogeneous flows. We obtain theoretical bounds of the flow window size and the RED queue length, as functions of the number of flows, link capacity, RED queue parameters, and AIMD parameters. Numerical results with Matlab and simulation results with NS-2 are given to validate the correctness and demonstrate the tightness of the derived bounds. The analytical and simulation results provide important insights on which system parameters contribute to higher system oscillations and how to set parameters (such as buffer size and queue management parameters) to ensure system efficiency with bounded delay and loss. Our results can also help to predict and control the system performance for Internet with higher data rate links multiplexed with heterogeneous flows with different parameters.

A stochastic dynamic controller for random early detection queues using a Kalman filter algorithm

AbstractThe stabilizing random early detection (RED) congestion control algorithm in transmission control protocol (TCP)/IP networks is a control theory problem. Significant attention has been drawn to this problem in the networking and control theory research communities. In this paper, we use a nonlinear dynamic model of the TCP RED congestion control algorithm to analyze and design active queue management (AQM) control systems. A linearized model of RED behavior around its nominal operating point which implicitly includes the delay in the control signal is derived. It is assumed that the system model is corrupted at the input and output by zero mean white Gaussian noise signals. An optimal state feedback stochastic controller is designed for the linearized model of the system in conjunction with a Kalman filter for state estimation. To illustrate the proposed design methodology, simulations results are presented and discussed. The proposed stochastic controller is applied to the nonlinear model of the system; Simulation results indicate that the proposed controller keeps the queue length bounded in an appropriate stochastic sense. Copyright © 2009 John Wiley & Sons, Ltd.

OSCILLATION AND PERIOD DOUBLING IN TCP/RED SYSTEM: ANALYSIS AND VERIFICATION

It has been known that a bottleneck RED (Random Early Detection) gateway can become oscillatory when regulating multiple identical TCP (Transmission Control Protocol) flows. However, a systematic explanation of such oscillatory behavior is not available. In this paper, we first use the fluid-flow model to derive the system characteristic frequency, and then compare with the frequencies of the RED queue length waveforms observed from "ns-2" simulations. The "ns-2" simulator is the only viable simulation tool accepted by industry for verification purposes. Analysis of the TCP source frequency distribution reveals the occurrence of period doubling when the system enters the instability region as the filter resolution varies. Since random events and a large number of TCP flows are involved in the process of generating the average system dynamics, a statistical viewpoint is taken in the analysis. Our results reflect the true system behavior as they are based on data from "ns-2" simulations rather than numerical simulations of analytical models. The physical mechanism of oscillation is explained in terms of the difference in the TCP source frequency and the TCP-RED system characteristic frequency.

A framework to determine bounds of maximum loss rate parameter of RED queue for next generation routers

Random early detection (RED) is expected to eliminate global synchronization by random active packet drop. Its packet drop probability is decided by the maximum packet drop probability in its drop function, buffer thresholds, and average queue length. It has been observed that for a large number of connections, a small value of the maximum packet drop probability may not eliminate global synchronization. Furthermore, since RED uses four parameters to regulate its performance, it is necessary to relate its maximum drop probability with those parameters. The objective of this paper is to develop a framework for the bounds of the maximum drop probability of RED, based on TCP channel model and traffic characteristics. The value of the maximum drop probability obtained by our model will make RED queue achieve its targeted goals.

Dynamics analysis of TCP Veno with RED

This paper studies the dynamics of TCP Veno with the queue management of RED (Random Early Detection). We develop a fluid-flow model to describe the behaviors of TCP Veno in wired/wireless networks. This model is further linearized to study TCP Veno’s stability issue through the linear feedback control theory. The analysis points out how the RED queue oscillates under different network parameters such as link capacity, round-trip time. Simulations are carried to validate our theoretical analysis. Furthermore, based on the analysis results obtained in this paper, we are able to provide guidelines for tuning RED parameters to stabilize the router queue, and improve the co-existence between TCP Veno and TFRC (TCP-friendly Rate Control) flows.

Towards fully automated adaptation of RED parameters to optimise TCP performance

Active queue management mechanisms, such as random early detection (RED), aim to optimise TCP/IP behaviour through probabilistic congestion notification. Increasing the drop probability with the mean queue state can provide both high throughput and low delay; however, RED's effectiveness depends on tuning parameters to the specific traffic scenario. Various adaptive schemes maintain the queue length within a target range by adjusting the notification (i.e. drop) profile. But even this target range depends on the variability of the traffic. A new scheme is presented that uses the first two moments of the measured arrival rate distribution to adapt RED's queue thresholds and its maximum drop probability. Simulation results demonstrate that the scheme can simultaneously maintain low delay and high throughput.

Transient analysis of RED queues: A quantitative analysis of buffer-occupancy fluctuations and relevant time-scales

This paper presents an analytic model for the transient behavior of the buffer occupancy in Random Early Detection (RED) queues under temporarily constant input traffic. The model shows that depending on the parameter choice, two types of qualitatively different behavior can be observed: (1) attenuated oscillation and (2) exponential convergence. The conditions for the occurrence of this behavior are derived as well as quantitative parameters in particular relaxation times, that allow to quantify the time-scales on which that transient behavior is observed. The model is subsequently applied to investigate an example scenario based on RED queues in a DiffServ QoS concept in which traffic changes are caused by mobility events.

A new TCP-friendly prioritized video multicast protocol using SPLIT protocol

Multicast distribution of video is one of the most important emerging Internet applications. The heterogeneity and scalability of the Internet makes video multicast a challenging problem. In particular, with IP-based networks, there are some shortcomings for real-time video transmission. The ability to transmit live video, such as video conferencing and telecommuting will open up new opportunities for the Internet technologies. In this paper, we engineered a new TCP-friendly video protocol called ‘SPLIT’. SPLIT protocol uses existing priority mechanisms to prioritise packets at the router using modified RED (Random Early Detection) queue. Our work shows how prioritised SPLIT works in TCP-friendly environment, with a view to minimizing the number of packet losses. We find that the proposed mechanism is best suitable to video traffic with base layer having the highest priority.

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 extended to include a class of RED queues that provides differentiated services for flows with multiple classes. Finally, the analysis is validated against ns simulations for a variety of RED network configurations where it is shown that the analytical results match with those of the simulations within a mean error of 5%. Several new analytical results are obtained; TCP throughput formula for a RED queue; TCP timeout formula for a RED queue and the fairness index for RED and tail drop.