Performance Evaluation of TCP using AQM Schemes for Congestion Control

Vyakaranal, Shashidhara B.; Naragund, Jayalaxmi G.

doi:10.1109/icaecc.2018.8479438

Cited by 3 publications

(5 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…CoDel shows stable behaviour in terms of RTT and goodput compared to the other two AQMs, however the assessment is limited to TCP metrics and have not been evaluated for the network layer. Similarly another testbed experiment in [33] evaluates the TCP metrics (RTT and throughput) for several AQMs including CoDel and PIE etc. The main focus of their work is to use different buffer sizes and mitigate the bufferbloat problem by leveraging CoDel algorithms and byte queue limit (BQL) solution.…”

Section: Related Workmentioning

confidence: 99%

“…To evaluate the performance of any AQM scheme it is important to test it over different TCPs and over different congestion levels. In previous studies the AQM algorithms performance is solely evaluated on transport layer [28,29,33]. Some authors, such as [30,32,39] and [35] have assessed the network layer metric, however they either used fewer metric or conducted their experiments on a single TCP which is not sufficient to explore the full capabilities of the investigated AQM schemes.…”

Section: Contributionmentioning

confidence: 99%

“…The authors in [32] have conducted a testbed experiment and evaluated the AQMs in terms of packet drop, latency and throughput. Nonetheless, their result evaluation is very shallow and they have not mapped the TCPs function with each AQM.…”

Section: Related Workmentioning

confidence: 99%

“…In previous studies the AQM algorithms performance is solely evaluated on transport layer [28, 29, 33]. Some authors, such as [30, 32, 39] and [35] have assessed the network layer metric, however they either used fewer metric or conducted their experiments on a single TCP which is not sufficient to explore the full capabilities of the investigated AQM schemes. In this paper we have conducted a detailed evaluation of popular AQMs such as CoDel and RED on network layer considering all the possible performance metric over different TCPs.…”

Section: Contributionmentioning

confidence: 99%

See 3 more Smart Citations

Study on performance of AQM schemes over TCP variants in different network environments

2020

View full text Add to dashboard Cite

Increasing the size of memory in network devices leads to the problem of a persistently full buffer (a.k.a, bufferbloat). The objective of this study is to compare the recently introduced Controlled Delay (CoDel) scheme with the traditional method of active queue management, such as Random Early Detection (RED) algorithms over TCP variants. To explore the potential of CoDel over RED, TCP variants have been assessed at three settings: variable congestion and fixed payload (VCFP), variable payload and fixed congestion (VPFC), and high congestion and high payload (HCHP). We assessed the CoDel and RED schemes for active queue management (AQM) using three performance metrics: link utilization, drop rate, and queuing delay. The analytical results show that CoDel outperformed RED in most aspects over variants of TCP because of its auto‐tuning and auto‐adjustment features. However, RED outperformed CoDel in a few cases. In the VCFP setting, RED recorded a lower drop rate overall TCP variants. Moreover, in the VPFC setting, RED with a payload of 500–1000 bytes performed better in terms of drop rate. Finally, in the HPHC setting, there were two cases where RED, over TCP NewReno and Vegas, performed well in terms of drop rate.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Contributionmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Contributionmentioning

confidence: 99%

See 2 more Smart Citations

Study on performance of AQM schemes over TCP variants in different network environments

2020

View full text Add to dashboard Cite

show abstract

“…Some studies have reported on the usefulness of RED for the congestion control of wireless networks [25][26][27]. RED controls congestion more rapidly than typical end-to-end algorithms but is also compatible with them [28]. Specifically, RED causes the average queue size to converge within a specific range and randomly discards packets to decrease the queuing delay.…”

Section: Introductionmentioning

confidence: 99%

Effects on random early detection of the packet drop probability function with an adjustable nonlinearity

Kato

Asahara

et al. 2023

NOLTA

View full text Add to dashboard Cite

This paper proposed a packet drop probability function with an adjustable nonlinearity parameter in random early detection (RED) for active queue management of a router to control network congestion. We investigated the effect of nonlinearity on the average queue size, average throughput, average retransmission rate, average round-trip time, and fairness index for two widely used loss-based congestion control algorithms: Reno and CUBIC. Simulations were performed with Tail-Drop and the original RED to clarify the effect of nonlinearity under different traffic loads. The results showed that the RED with a nonlinear function did not aggravate the network performance statistics because achieved high throughput while maintaining a low-queuing delay, such as the original RED with a linear function under the extremely heavy traffic condition. Under the light and the heavy traffic conditions, increasing the bending degree of the nonlinear function accomplished high throughput by preventing excessive discarding of packets.

show abstract

On Cross-Layer Interactions for Congestion Control in the Internet

Piotrowska

2021

Applied Sciences

View full text Add to dashboard Cite

Two key mechanisms of the Internet are congestion control in the Transmission Control Protocol (TCP) and Active Queue Management (AQM) in routers. The former divides the bandwidth between flows and prevents the Internet from congestion collapse. Simultaneously, the latter informs hosts of the forthcoming congestion by preventive dropping of packets in network nodes. Although these two key mechanisms may severely interact with each other, they are often being researched independently, in parallel. This has led to the development of a few new congestion controls and AQM algorithms known for excellent performance under the assumption that the counterpart remains unaltered. It is unclear, however, how these new solutions in both areas interact with each other. The purpose of this paper is to fill this gap. Namely, in an extensive set of simulations, the impact of interactions between the state-of-the-art congestion control and AQM algorithms on the TCP connection performance is studied. As a result, recommendations for using some particular TCP-AQM pairs, which are observed to perform especially well, are formulated.

show abstract

Performance Evaluation of TCP using AQM Schemes for Congestion Control

Cited by 3 publications

References 3 publications

Study on performance of AQM schemes over TCP variants in different network environments

Study on performance of AQM schemes over TCP variants in different network environments

Effects on random early detection of the packet drop probability function with an adjustable nonlinearity

On Cross-Layer Interactions for Congestion Control in the Internet

Contact Info

Product

Resources

About