A Comparative Analysis of Queue Management Techniques using NS-2 Simulator (original) (raw)
Related papers
An Experimental Analysis of Random Early Discard (RED) Queue for Congestion Control
2011
Active Queue Management (AQM) is receiving wide attention as a promising technique to prevent and avoid congestion collapse in packet-switched networks. By providing advanced warning of incipient congestion, end nodes can respond to congestion before router buffer overflows and hence ensure improved performance. Random Early Discard (RED) is an IETF recommended active queue management scheme that is expected to provide several Internet performance advantages such as minimizing packet loss and router queuing delay, avoiding global synchronization of sources, guaranteeing high link utilization and fairness. It tends to drop packets from each connection in proportion to the transmission rate the flow has on the output link. It does not minimize the number of dropped packets as expected, but it manages to achieve improved performance when compared to the Tail Drop. In this paper, extensive experimental analysis has been carried out on RED using Network Simulator (NS-2) in relation to congestion control and decision has been settled where RED can perform better.
This paper work presents simulation of an active queue management in a quality of service Internet using differentiated service random early detection (DiffServ RED) algorithm for congestion avoidance in packet switched network. RED algorithm is designed to accompany a transportlayer congestion control protocol such as TCP. We explored how the algorithm, earlier designed by [8], could be used to achieve differential packet dropping required by realtime traffic in the extended TCP/IP protocol for the Internet. The queue manager operates by setting thresholds (minimum and maximum) for the average queue size to detect incipient congestion. When the average queue size is below the minimum threshold, all arriving packets are properly enqueued for dispatch to their destinations. Any time the average queue size exceeds a preset minimum thresholds, the gateway drops packets at random or marks each arriving packet with a certain probability, where the exact probability is a function of the...
Performance Comparison of Active Queue Management Techniques
Journal of Computer Science, 2008
Congestion is an important issue which researchers focus on in the Transmission Control Protocol (TCP) network environment. To keep the stability of the whole network, congestion control algorithms have been extensively studied. Queue management method employed by the routers is one of the important issues in the congestion control study. Active Queue Management (AQM) has been proposed as a router-based mechanism for early detection of congestion inside the network. In this study, we are comparing AQM two popular queue management methods, Random Early Detection (RED) and droptail, in different aspects, such as throughput and fairness Index. The comparison results indicate RED performed slightly better with higher throughput and higher fairness Index than droptail. Simulation is done by using Network Simulator (NS 2) and the graphs are drawn using X-graph.
PERFORMANCE INVESTIGATIONS OF SOME ACTIVE QUEUE MANAGEMENT TECHNIQUES USING SIMULATION
Congestion is a fundamental problem in computer networks. Congestion may occur at router buffers of networks when the number of incoming packets cannot be absorbed by the available network resources such as buffer spaces. A poor network performance can be offered due to congestion, e.g. high dropping and queueing delay for packets, low throughput and unmaintained average queue length which may not prevent the router buffers from building up, then dropping packets. Different Active Queue Management (AQM) methods have been proposed to deal with congestion such as Random Early Detection (RED) and its variants like, Gentle Random Early Detection (GRED), REDD1 (the FLC method based on RED), etc. This paper presents a comparison between three AQM methods, i.e. GRED, REDD1 and the Adaptive GRED regarding to several performance measures such as: mean queue length (mql ), throughput (T ), average queueing delay ( D), overflow packet loss probability ( L P ) and packet dropping probability before the router buffer is overflowed ( p D ). This comparison evaluates the three AQM methods performance and then decides out which method offers more satisfactory performance measure results. The decision which method produces more satisfactory performance measure results is made solely depending on the varying of packet arrival probability parameter. This comparison shows that the Adaptive GRED offers the most satisfactory mql and D results when congestion occurs. Also, in presence of congestion; REDD1 loses the fewer packets due to buffer overflow and GRED drops the smallest number of packets before the router buffer has overflowed.
Performance Analysis and Qos Assessment of Queues over Multi-Hop Networks
ipcsit.net
In the field of computer networks the implementation, management and performance analysis of queues is one of the foremost issues. The selection of the various queues is totally depends upon the need of transmission of data. Safe and Reliable propagation of data is a basic requirement of any computer network. In presents scenario, there is a strong requirement of standardization, testing, and widespread deployment of active queue management [AQM] in routers, which is further responsible for the improvement of performance of today's Internet. Queues performance assessment requires a concrete research effort in the measurement and deployment of router mechanisms, which advances to protect the Internet from flows that are not sufficiently responsive to congestion notification. In this paper, we evaluate the performance of Drop tail, DRR, RED, SFQ, and FQ by varying the number of hops. We are representing the detailed performance analysis & comparison of the various queues in terms of parameters like throughput, average delay and packet loss. These queues have been analyzed on various traffics like FTP and CBR, by varying the number of hops and the various conclusions have been drawn accordingly.
Analysis of active queue management
Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003., 2003
Active Queue Management (AQM) is intended to achieve high link utilization with a low queuing delay. Recent studies show that RED, one of the most well-known AQMs, is difficult to configure and does not provide significant performance gains given the complexity required for proper configuration. Recent variants of RED, such as Adaptive-RED are designed to provide more robust RED performance under a wider-range of traffic conditions but have not yet been evaluated. This paper presents a router queue behavior model (a queue law) for TCP-dropping and TCP-marking control systems, and uses the queue law to illustrate the impact of TCP traffic on the load and queue behavior of congested routers. Through queue law analysis and simulation, this paper confirms that RED-like AQM techniques that employ packet dropping do not significantly improve performance over that of drop-tail queue management. However, when AQM techniques use Explicit Congestion Notification (ECN) as a method to notify TCP sources of congestion rather than packet drops, the performance gains of AQM in terms of goodput and delay can be significant over that of drop-tail queue management.
International Journal of Computer Applications, 2010
A number of active queue management algorithms for TCP/IP networks such as RED, SRED, DRED and SDRED have been proposed in the past few years. This article presents a comparative study of these algorithms using simulations. The evaluation is done using the OPNET Modeler, which provides a convenient and easy-touse platform for simulating largescale networks. The performance metrics used in the study are queue size, packet drop probability, and packet loss rate. The study shows that, among the four algorithms, SRED and DRED are more effective at stabilizing the queue size and controlling the packet loss rate while maintaining high link utilization. The benefits of stabilized queues in a network are high resource utilization, bounded delays, more certain buffer provisioning, and traffic-load-independent network performance in terms of traffic intensity and number of TCP connections.
Effects of Various Queuing Algorithms for Network Services
INTERNATIONAL JOURNAL OF ENGINEERING DEVELOPMENT AND RESEARCH (IJEDR) (ISSN:2321-9939), 2014
with recent development and research, various network services like FTP (file transfer), VoIP, videoconferencing (streaming), E-mail are going to more useful in current generation. In such services some of services like email, web browsing (HTTP), FTP (file transfer) are not much sensitive to delay of transmitted data. Services like VoIP (voice), video conferencing are very sensitive to delay, jitter (delay variation), and packet losses of transmitted data. Therefore they require various traffic management systems for efficient data transmission. Queuing disciplines is such a traffic management system in various network services for efficient data transmission. Queuing algorithms FIFO(first in first out), PQ(priority queue), WFQ(weight fair queue) are implemented in OPNET and some of the parameter including end to end delay, and packet received are studied and effect of various queuing algorithms on this parameters is analysed.
Assessment of Active Queue Management algorithms by using NS2 simulator
2014
Network security has become very important and foremost issue for the personal computer users, organizations, business and military. With the advent of internet, security has become the major concern. The main objective of this research is to simulate and analyze the effect of queuing algorithms RED and DROPTAIL with CPR on the TCP targeted LDDoS attack flows. LDDoS attack is more vulnerable to the network traffic than the classic DDoS attacks as they are difficult to identify. We use network simulator ns-2 to implement the network and investigate the behaviors of queuing algorithms in the network. The performance metrics of the comparison are average delay and packet drop. CPR based approach is used to detect and filter attacks. The test-bed experiments are conducted to analyze the performance of this approach which is compared to the existing DFT approach.
Queue Management for the Heavy-Tailed Traffics
2010 International Conference on Broadband, Wireless Computing, Communication and Applications, 2010
The purpose of this research is to design a new queue management algorithm effectively controlling the heavy-tailed traffics. Among active queue managements (AQM), random early detection (RED), has been widely used to improve the TCP throughput. The heavy-tailed traffic, however, generates the large fluctuation on the queue causing the degradation of fairness in terms of throughput and jitter performance. In this paper, we proposed the stable time RED (ST-RED) to improve the fairness of throughput and jitter performance. ST-RED enables to stabilise the calculation timing for average queue length leading to suppress the queue fluctuations. We also implemented the ST-RED mechanism on the ns-2 simulator. As results of simulation, we extracted the following features. Firstly, RED improves the throughput and reduces the overall load balance leading to the improvement of its fairness with all different αs of the Pareto distribution. Secondly, ST-RED keeps the same TCP throughput performance for each traffic with different α of the Pareto distribution as RED does. Thirdly, ST-RED with 0.5 msec time interval slightly improves the throughput fairness for all traffics. In addition, our proposed method clearly improves the fairness of jitter on a large scale compared to the original RED.