scholarly journals Fairness analysis of TCP variants in asymmetric network

2018 ◽  
Vol 7 (2.12) ◽  
pp. 231
Author(s):  
Sukantkishoro Bisoy ◽  
Pradeep Kumar Mallick ◽  
Anjana Mishra
Keyword(s):  
Simulation Experiment ◽  
Queue Management ◽  
Random Early Detection ◽  
Fair Share ◽  
Management Techniques ◽  
Tcp Vegas ◽  
Different Characteristics ◽  
Reverse Path ◽  
Tcp Reno ◽  
Fairness Analysis

Conservative nature of Vegas creates less opportunity to get fair share of bandwidth then Reno in wired network. On the other hand, aggressive nature of Reno helps to achieve more share of bandwidth. Both Reno and Vegas assumes that congestion occurs in the forward rather than in reverse path. In asymmetric network the path characteristics of forward and backward is different.In this work, we propose a network model and analyzed the Inter-protocol fairness between TCP Reno and TCP Vegas with some queue management techniques such as Droptail and random early detection (RED) in asymmetric network where the forward and backward path has different characteristics. The simulation experiment results using NS2 indicates that use of RED can achieve better fairness than Droptail in asymmetric network.  

Throughput and Compatibility Analysis of TCP Variants in Heterogeneous Environment

2017 ◽  
pp. 254-287
Author(s):  
Sukant Kishoro Bisoy ◽  
Prasant Kumar Pattnaik ◽  
Narendra Kumar Kamila
Keyword(s):  
Wireless Network ◽  
Ad Hoc ◽  
Queue Management ◽  
Ad Hoc Routing ◽  
On Demand ◽  
Compatibility Analysis ◽  
Distance Vector ◽  
Simulation Results ◽  
Tcp Vegas ◽  
Tcp Reno

When TCP Reno and TCP Vegas connections share a link, TCP Reno generally steals more bandwidth and dominates TCP Vegas because of its aggressive nature. This is the major reason why TCP Vegas has not gained much popularity and deployment in the Internet despite its excellent standalone performance. This work systematically examines compatibility between Reno and Vegas in wired as well as in wireless networks. Popular Active Queue Management (AQM) technique named as Random Early Detection (RED) to minimize the incompatibility between Reno and Vegas in wired network. For wireless network two ad hoc routing protocols such as Ad Hoc On-Demand Distance Vector (AODV) and Destination-Sequenced Distance Vector (DSDV) are considered. Simulation results show that the incompatibility between Reno and Vegas in wired network is minimized using popular RED techniques. But in wireless ad hoc network environment Reno's aggressive behavior gets deteriorated while sharing with Vegas. Moreover, Reno and Vegas are more compatible in wireless network than wired network when both coexist in same time.

scholarly journals Comparative analysis of the performance of various active queue management techniques to varying wireless network conditions

2019 ◽  
Vol 9 (1) ◽  
pp. 359 ◽  
Author(s):  
Okokpujie Kennedy ◽  
Emmanuel Chukwu ◽  
Olamilekan Shobayo ◽  
Etinosa Noma-Osaghae ◽  
Imhade Okokpujie ◽  
...  
Keyword(s):  
Wireless Network ◽  
Transmission Control Protocol ◽  
Active Queue Management ◽  
Propagation Delay ◽  
Queue Management ◽  
Link Capacity ◽  
Congestion Control Algorithm ◽  
Fixed Parameter ◽  
Self Tuning ◽  
Management Techniques

This paper demonstrates the robustness of active queue management techniques to varying load, link capacity and propagation delay in a wireless environment. The performances of four standard   controllers used in Transmission Control Protocol/Active Queue Management (TCP/AQM) systems were compared. The active queue management controllers were the Fixed-Parameter Proportional Integral (PI), Random Early Detection (RED), Self-Tuning Regulator (STR) and the Model Predictive Control (MPC). The robustness of the congestion control algorithm of each technique was documented by simulating the varying conditions using MATLAB® and Simulink® software. From the results obtained, the MPC controller gives the best result in terms of response time and controllability in a wireless network with varying link capacity and propagation delay. Thus, the MPC controller is the best bet when adaptive algorithms are to be employed in a wireless network environment. The MPC controller can also be recommended for heterogeneous networks where the network load cannot be estimated.

scholarly journals Active Queue Management (AQM) Performance Analysis Based On Controled Delay (CoDel) Against Bufferbloat On Real-Time Aplication

2017 ◽  
Vol 2 (1) ◽  
pp. 119
Author(s):  
Muhammad Noer Iskandar
Keyword(s):  
Performance Analysis ◽  
Early Detection ◽  
Real Time ◽  
Video Streaming ◽  
Packet Loss ◽  
Active Queue Management ◽  
Queue Management ◽  
Random Early Detection

<span><em>Bufferbloat </em><span>merupakan salah satu kondisi buffer dengan ukuran besar yang cenderung<br /><span>selalu penuh dan menyebabkan antrian panjang didalam buffer, jika hal ini terjadi secara<br /><span>terus-menerus maka dapat menyebabkan jeda transmisi yang tinggi. <span><em>Bufferbloat </em><span>sering<br /><span>terjadi pada aplikasi berbasis real-time. <span><em>Active Queue Management </em><span>(AQM) merupakan<br /><span>salah satu cara untuk menangani terjadinya <span><em>bufferbloat., </em><span>AQM umumnya menggunakan<br /><span>algoritma Drop Tail untuk menangani kondisi antrian panjang dalam buffer router di<br /><span>jaringan. Namun demikian, performansi AQM berbasis Drop Tail kurang dapat<br /><span>diandalkan karena jeda transmisi dalam keadaan <span><em>bufferbloat </em><span>masih tinggi. Telah banyak<br /><span>studi dilakukan untuk menangani <span><em>bufferbloat</em><span>, seperti Drop Tail, Random Early Detection<br /><span>(RED) dan Controlled Delay (CoDel). Dari riset yang telah dilakukan tersebut masih sulit<br /><span>ditemukan performasi algoritma terbaik dalam menangani <span><em>bufferbloat</em><span>. Untuk hal tersebut,<br /><span>paper ini menyajikan studi performansi penanganan bufferbloat menggunakan ketiga<br /><span>algoritma diatas. Dalam studi ini, video streaming digunakan sebagai <span><em>traffic </em><span>uji untuk<br /><span>menentukan performansi algoritma terbaik dalam mengatasi <span><em>bufferbloat</em><span>. Sedangkan<br /><span>metriks uji yang digunakan dalam riset ini adalah <span><em>latency</em><span>, <span><em>throughput </em><span>dan <span><em>packet-loss</em><span>.<br /><span>Analisa hasil pengujian mengambil 3 hasil terbaik dalam setiap percobaan. Hasil<br /><span>pengujian menunjukan performansi algoritma CoDel jauh lebih baik dalam menangani<br /><span><em>latency </em><span>yang tinggi pada kondisi bufferbloat dibandingkan RED dan Drop Tail. Namun<br /><span>untuk <span><em>packet-loss </em><span>dan <span><em>throughput </em><span>performansi RED dan Drop Tail masih unggul<br /><span>dibanding algoritma CoDel</span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span><br /></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span>

Sign in / Sign up

Export Citation Format

Share Document