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

Controlling Network Latency in Mixed Hadoop Clusters: Do We Need Active Queue Management?

With the advent of big data, data center applications are processing vast amounts of unstructured and semi-structured data, in parallel on large clusters, across hundreds to thousands of nodes. The highest performance for these batch big data workloads is achieved using expensive network equipment with large buffers, which accommodate bursts in network traffic and allocate bandwidth fairly even when the network is congested. Throughput-sensitive big data applications are, however, often executed in the same data center as latency-sensitive workloads. For both workloads to be supported well, the network must provide both maximum throughput and low latency. Progress has been made in this direction, as modern network switches support Active Queue Management (AQM) and Explicit Congestion Notifications (ECN), both mechanisms to control the level of queue occupancy, reducing the total network latency. This paper is the first study of the effect of Active Queue Management on both throughput and latency, in the context of Hadoop and the MapReduce programming model. We give a quantitative comparison of four different approaches for controlling buffer occupancy and latency: RED and CoDel, both standalone and also combined with ECN and DCTCP network protocol, and identify the AQM configurations that maintain Hadoop execution time gains from larger buffers within 5%, while reducing network packet latency caused by bufferbloat by up to 85%. Finally, we provide recommendations to administrators of Hadoop clusters as to how to improve latency without degrading the throughput of batch big data workloads.The research leading to these results has received funding from the European Unions Seventh Framework Programme (FP7/2007–2013) under grant agreement number 610456 (Euroserver). The research was also supported by the Ministry of Economy and Competitiveness of Spain under the contracts TIN2012-34557 and TIN2015-65316-P, Generalitat de Catalunya (contracts 2014-SGR-1051 and 2014-SGR-1272), HiPEAC-3 Network of Excellence (ICT- 287759), and the Severo Ochoa Program (SEV-2011-00067) of the Spanish Government.Peer ReviewedPostprint (author's final draft

Comparative Study Of Congestion Control Techniques In High Speed Networks

Congestion in network occurs due to exceed in aggregate demand as compared to the accessible capacity of the resources. Network congestion will increase as network speed increases and new effective congestion control methods are needed, especially to handle bursty traffic of todays very high speed networks. Since late 90s numerous schemes i.e. [1]...[10] etc. have been proposed. This paper concentrates on comparative study of the different congestion control schemes based on some key performance metrics. An effort has been made to judge the performance of Maximum Entropy (ME) based solution for a steady state GE/GE/1/N censored queues with partial buffer sharing scheme against these key performance metrics.Comment: 10 pages IEEE format, International Journal of Computer Science and Information Security, IJCSIS November 2009, ISSN 1947 5500, http://sites.google.com/site/ijcsis

Evaluation of the Impact of Packet Drops due to AQM over Capacity Limited Paths

Postprin

Dynamic weight parameter for the Random Early Detection (RED) in TCP networks

This paper presents the Weighted Random Early Detection (WTRED) strategy for congestion handling in TCP networks. WTRED provides an adjustable weight parameter to increase the sensitivity of the average queue size in RED gateways to the changes in the actual queue size. This modification, over the original RED proposal, helps gateways minimize the mismatch between average and actual queue sizes in router buffers. WTRED is compared with RED and FRED strategies using the NS-2 simulator. The results suggest that WTRED outperforms RED and FRED. Network performance has been measured using throughput, link utilization, packet loss and delay