Analysis of Performance Improvement on TCP / IP Network with Active Queue Management Controlled Delay

As we all know, the internet is the biggest source of information where we can get information and share information to others. There are many applications in the internet where each application is increasingly increasing its needs in the scope of performance in order to be satisfied by internet users satisfactorily. The higher level of performance required for each application it automatically also leads to increased traffic in the internet network when internet users access this application online. This causes the utilization of internet network is not optimal. The issue of a full buffer is persistent by a queue of data packets that flood the internet network waiting to be served. The buffer trend is always full-hold by the queue of data packets known as Bufferbloat. Initially, all routers on the internet network use the PQM (Passive Queue Management) DropTail mechanism to against Bufferbloat. Therefore in 1998, the IETF (Internet Engineering Task Force) recommended AQM (Active Queue Management) mechanism to be implemented on next-generation Internet routers. Then in 2012, Van Jacobson created an innovative method to become the current Internet service solution that is CoDel. CoDel is an algorithm designed to overcome bufferbloat on network links by setting limits on packet delays in the network. In this research we mainly focus to the influence of traffic load variation on Packetloss, Mean Delay, Mean Jitter and Throughput in TCP / IP network using Passive Queue Management Droptail mechanism using mechanism Active Queue Management Controlled Delay. The concentration is preferred in Active Queue Management Controlled Delay mechanism analysis with variation of traffic load on Packetloss ratio, Average Delay, Average Jitter and Throughput in TCP / IP network. Based on the simulation results obtained, we discuss the advantages Active Queue Management CoDel in improving QoS TCP / IP network. CoDel\u27s performance in improving QoS TCP / IP network for packet loss ratio is better at 26.288%; for average delay is better at 97.755%; for average jitter is better at 69.284% and for throughput is better at 4.448%. This percentage is obtained by packet flow variation from 1 Mbyte to 1 Gbyte. Keywords : Bufferbloat, PQM, AQM, DropTail, CoDe

Analysis of RED-Family Active Queue Management

RED is an Active Queue Management (AQM) technique that is intended to achieve high link utilization with a low queuing delay. Recent studies show that RED is difficult to configure for some rapidly changing traffic mixes and loads [1]. Other studies show that under some conditions, the performance gains of RED and its variants over traditional drop-tail queue management is not significant given the additional complexity required for proper configuration [2], [3]. Recent variants of RED, such as Adaptive- RED [4], are designed to provide more robust RED performance under a wider-range of traffic conditions. This paper develops a general queue law for TCP-RED control systems that use packet dropping and/or Explicit Congestion Notification (ECN) marking as congestion signaling methods, and illustrates the impact of TCP traffic on the behavior of congested router queue. Furthermore, this paper provides additional analysis of RED and newer variants of RED including Adaptive-RED [4] that is designed to provide more robust RED performance under a wider-range of traffic conditions. Through careful simulation designs using the queue law and analysis, 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 ECN marking, the performance gains of AQM in terms of goodput and delay can be significant over that of drop-tail queue management

CA-AQM: Channel-Aware Active Queue Management for Wireless Networks

In a wireless network, data transmission suffers from varied signal strengths and channel bit error rates. To ensure successful packet reception under different channel conditions, automatic bit rate control schemes are implemented to adjust the transmission bit rates based on the perceived channel conditions. This leads to a wireless network with diverse bit rates. On the other hand, TCP is unaware of such {\em rate diversity} when it performs flow rate control in wireless networks. Experiments show that the throughput of flows in a wireless network are driven by the one with the lowest bit rate, (i.e., the one with the worst channel condition). This does not only lead to low channel utilization, but also fluctuated performance for all flows independent of their individual channel conditions. To address this problem, we conduct an optimization-based analytical study of such behavior of TCP. Based on this optimization framework, we present a joint flow control and active queue management solution. The presented channel-aware active queue management (CA-AQM) provides congestion signals for flow control not only based on the queue length but also the channel condition and the transmission bit rate. Theoretical analysis shows that our solution isolates the performance of individual flows with diverse bit rates. Further, it stabilizes the queue lengths and provides a time-fair channel allocation. Test-bed experiments validate our theoretical claims over a multi-rate wireless network testbed

An Improved Link Model for Window Flow Control and Its Application to FAST TCP

This paper presents a link model which captures the queue dynamics in response to a change in a transmission control protocol (TCP) source's congestion window. By considering both self-clocking and the link integrator effect, the model generalizes existing models and is shown to be more accurate by both open loop and closed loop packet level simulations. It reduces to the known static link model when flows' round trip delays are identical, and approximates the standard integrator link model when there is significant cross traffic. We apply this model to the stability analysis of fast active queue management scalable TCP (FAST TCP) including its filter dynamics. Under this model, the FAST control law is linearly stable for a single bottleneck link with an arbitrary distribution of round trip delays. This result resolves the notable discrepancy between empirical observations and previous theoretical predictions. The analysis highlights the critical role of self-clocking in TCP stability, and the proof technique is new and less conservative than existing ones

A hysteretic model of queuing system with fuzzy logic active queue management

We consider a data transmitting system with an active queue management designed to prevent overloading, where fuzzy logic controller is used.We developed a mathematical model that takes into account the features of the data transfer system with an active queue management, which keeps the queue length in the range of values close to a given reference value of the queue length. The method of hysteretic control for incoming load with two thresholds was used as a basis of the model. The mathematical model is a queuing system with a threshold control, which is designed for the analysis of the possibility of hysteresis in modeling of systems with active queue management. The model was described by a Markov process, for which the numerical solution of the equilibrium equations was obtained, steady state probabilities were calculated. The main probabilistic measures are the following: the mean value and the standard deviation of a queue length, and the probability for the queue length of being within the specified limits from the reference value. The numerical analysis in the load range, which includes a system overload, indicated the adequacy of the constructed mathematical model with hysteretic control and system with an active queue management based on fuzzy logic controller. The proposed fuzzy logic method was implemented for Linux kernel and the test results show better quality of service parameters than other tested methods

ANALISA PERFORMANSI TSAQM (TRAFFIC SENSITIVE ACTIVE QUEUE MANAGEMENT) SEBAGAI MANAJEMEN ANTRIAN AKTIF PADA JARINGAN TCP/UDP

ABSTRAKSI: Baru-baru ini, berbagai layanan multimedia seperti IPTV dan video conference muncul menjadi sumber lalu lintas utama di jaringan internet. Pada jaringan Transmission Control Protokol (TCP) kongesti merupakan salah satu penyebab dalam penurunan performansi. Fungsi kontrolnya yang terlalu komplex memungkinkan terjadinya delay yang tidak bisa ditolerir dalam memenuhi layanan aplikasi multimedia. Padahal pada layanan multimedia diharapkan mempunyai delay pengiriman paket yang rendah. Kontrol kongesti menggunakan queue management dengan First In First Out (FIFO) menyebabkan buffer penuh dan memperbesar delay. Kontrol kongesti dengan menggunakan active queue management diharapkan dapat memperkecil delay dengan mendeteksi kongesti sejak dini sebelum buffer penuh.Pada tugas akhir ini, dibahas mengenai sebuah algoritma baru dari management antrian aktif yaitu TSAQM (Traffic Sensitive Active Queue Management) yang dibandingkan dengan manajemen antrian aktif Adaptive RED dalam menentukan Qos yang terbaik dalam suatu jaringan. Adapun analisa perpormansi Qos yang dilakukan meliputi delay, throughput, packet loss serta pdr (packet delivery ratio) melalui beberapa skenario terhadap kedua manajemen antrian aktif dengan mengubah bit rate pada paket dan analisa terhadap perubahan kapasitas link pada perioda pengamatan tertentu, sehingga dapat dianalisa lebih jauh mengenai tingkat perfomansi yang optimal.Dari hasil simulasi menunjukkan bahwa manajemen antrian TSAQM dapat menjaga Qos lebih baik mulai dari nilai delay yang kecil, troughput yang lebih besar, packet loss yang kecil serta nilai packet delivery ratio yang besar di bandingkan dengan mekanisme ARED.Kata Kunci : Kontrol Kongesti, Active Queue Management, TSAQM, Adaptive REDABSTRACT: Recently, various multimedia services such as IPTV and video conferencing appears to be the main source of traffic in the Internet network. On the network Transmission Control Protocol (TCP) congestion is one cause of the decline in performance. Overly complex control functions allow the delay that can not be tolerated in meeting the multimedia application services. Though the multimedia services are expected to have a low packet delivery delays. Congestion control using queue management with First In First Out (FIFO) causing buffer to be full and increasing the delay. Congestion control using active queue management is expected to minimize the delay by detecting early congestion before the buffer is full.In this research, we discussed about a new algorithm of active queue management called TSAQM (Traffic Sensitive Active Queue Management) is compared with Adaptive RED active queue management in determining the best QoS in a network. The QoS performance analysis was conducted on the delay, throughput, packet loss and PDR (packet delivery ratio) through several scenarios on both the active queue management to change the bit rate of the packet and analysis of changes in link capacity at a particular observation period, so it can be analyzed further regarding the optimal performance level.The simulation results show that the queue management TSAQM can maintain better QoS from a small delay value, greater throughput, small packet loss and the large packet delivery ratio in comparison with the ARED mechanism.Keyword: Congestion control, Active Queue Management, TSAQM, Adaptive RE

Dsrem Regulator in the Tcp/ip Network

The paper presents the main parameters and describes the behavior of the active queue management (AQM) algorithm which based on random exponential marking (REM) packets in TCP/IP network. It has presented the new AQM algorithm, which has been developed by author, which is based on REM and uses dynamically splitting marking characteristic (DSREM) of network packets. The basic parameters and functional principle of DSREM algorithm have been shown. Block diagram of linearized AQM system, which is based on DSREM management law and describes its main components, is shown. Transfer characteristic for DSREM, which is based on the Laplace transform and its basic parameters, are considered. Simulation of TCP/IP network, which contains congested link for small and large sources of incoming messages using REM and DSREM regulators, is done. Log-frequency characteristics for REM and DSREM methods are obtained and their comparative analysis is performed. It is concluded that the regulator based on DSREM algorithm has better performance and stability of the system can be used in the AQM system

Characterizing and Managing Intrusion Detection System (IDS) Alerts with Multi-Server/Multi-Priority Queuing Theory

The DoD sets forth an objective to employ an active cyber defense capability to prevent intrusions onto DoD networks and systems. Intrusion Detection Systems (IDS) are a critical part of network defense architectures, but their alerts can be difficult to manage. This research applies Queuing Theory to the management of IDS alerts, seeking to answer how analysts and priority schemes effect alert processing performance. To characterize the effect of these two variables on queue wait times, a MATLAB simulation was developed to allow parametric analysis under two scenarios. The first varies the number of analysts and the second varies the number of alert priority levels. Results indicate that two analysts bring about drastic improvements (a 41% decrease) in queue wait times (from 116.1 to 49.8 minutes) compared to a single analyst, due to the reduced potential for bottlenecks, with diminishing returns thereafter. In the second scenario, it was found that three priority levels are sufficient to realize the benefits of prioritization, and that a five level priority scheme did not result in shorter wait queue times for Priority 1 alerts. Queuing models offer an effective approach to make IDS resource decisions in keeping with DoD goals for Active Cyber Defense