Evaluation of ARED, CoDel and PIE

Schwardmann, Jens; Wagner, David P.; Kühlewind, Mirja

doi:10.1007/978-3-319-13488-8_17

Cited by 10 publications

(8 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…PIE has already been shown to need an updated parameterisation for specific scenarios (such as data-centers [10] or cable modems [11]). CoDel has been shown to not always control the queuing delay with a limited impact on the bottleneck utilization [8], [9], and it was uncertain whether CoDel could be tuned for objectives and network conditions other than the ones for which it has been designed: this led to our interest in examining CoDel and not PIE. We also wanted to evaluate the performance of a hybrid scheduling/AQM scheme, which is possible with FQCoDel, whereas there is no reference algorithm for FQ-PIE.…”

Section: Delay-based Aqm Schemesmentioning

confidence: 99%

See 1 more Smart Citation

Tackling Bufferbloat in capacity-limited networks

Kulatunga

Kuhn

Fairhurst

et al. 2015

2015 European Conference on Networks and Communications (EuCNC)

View full text Add to dashboard Cite

Abstract-Over-provisioned network buffers, often at the Internet edge, induce large queuing delay and high latency; this issue is known as Bufferbloat. In response to this, a set of recently proposed Active Queue Management (AQM) algorithms attempt to reduce standing queues, while maintaining the bottleneck utilisation at an acceptable level. This paper assesses the performance of two AQM schemes (CoDel and FQ-CoDel) over capacity-limited networks with large Round-Trip Time (RTT). In such settings, these AQM schemes have difficulty controlling the buffering level, resulting in both momentarily high queuing delay and low bottleneck utilisation, even if the methods are claimed to be insensitive to link rates and round-trip delays. We explore this issue and show that it is possible to adapt the parameterisation of CoDel and FQ-CoDel to offer a higher bottleneck utilisation while maintaining a low queuing delay. We present experiments over an emulated test bed and a satellite network to confirm that our new parameterisation improves the download time of moderate-size files and reduces the latency for capacity-limited and large-RTT networks.

show abstract

Section: Delay-based Aqm Schemesmentioning

confidence: 99%

“…The claim that CoDel can self-tune its dropping policy suggests that no knobs needs to be tuned. However its behaviour has been shown to depend on the congestion level [8] and the RTT of the path [9]. The benefits of introducing AQM mechanisms in capacity-limited and large RTT networks are not yet well understood.…”

Section: Introductionmentioning

confidence: 99%

Tackling Bufferbloat in capacity-limited networks

Kulatunga

Kuhn

Fairhurst

et al. 2015

2015 European Conference on Networks and Communications (EuCNC)

View full text Add to dashboard Cite

show abstract

“…Due to the expensive requirements of CoDel for implementation and operation, a lightweight algorithm, PIE (Proportional Integral Controller Enhanced), has also been proposed, which benefits from the advantages of both RED and CoDel: it is easy to be implemented like RED, while it directly controls latency like CoDel [40]. Evaluation of CoDel, PIE, and ARED for various static and dynamic scenarios in [23,45] shows that PIE achieves significantly lower delays than the other two in static scenarios, while CoDel and ARED recover significantly faster than PIE from traffic changes. Experimental evaluations using real-world implementations in a wired testbed in [28] show that ARED performs worse than CoDel and PIE only when the number of traffic flows on the bottleneck link is very small.…”

Section: Related Workmentioning

confidence: 99%

A self-tuning controller for queuing delay regulation in TCP/AQM networks

Kahe

Jahangir

2018

Telecommun Syst

View full text Add to dashboard Cite

AQM router aims primarily to control the network congestion through marking/dropping packets which are used as congestion feedback in traffic sources to balance their flow rate. However, stabilizing queuing delay and maximizing link utilization have been considered as the main control objectives, especially in media dominated networks. Usually, most of the AQM algorithms are designed for a nominal operating point. However, time-varying nature of network parameters frequently violates their robustness bounds. In this paper, a self-tuning compensated PID controller is proposed to address the time-varying nature of network conditions caused by parameter variations and unresponsive connections. The proposed scheme consists of network parameter estimation and a self-tuning AQM. Traffic load, network delay, and bottleneck link capacity are the time-varying network parameters whose variation effects should be compensated by the controller gains adaptation. As the controller gains are simply and directly obtained from the dynamic model, the obtained self-tuning controller can reasonably adapt itself to different operating conditions, while preserving the simplicity of the PI controllers. Packet-level simulations using ns2 show the outperformance of the developed controller for both latency regulation and resource utilization.

show abstract

“…PIE can ensure low latency and achieve high link utilization under various congestion conditions. Schwardmann et al evaluated by simulation the robustness of CoDel, PIE, and ARED for various static and dynamic scenarios [23] in a simple set-up with one link and a variable number of bulk TCP flows. ARED (Adaptive RED) is an active queue management scheme that attempts to stabilize the average queue size around some preset target queue size [24].…”

Section: Related Workmentioning

confidence: 99%

The Virtue of Gentleness: Improving Connection Response Times with SYN Priority Active Queue Management

Braud

Heusse

Duda

2018

2018 IFIP Networking Conference (IFIP Networking) and Workshops

View full text Add to dashboard Cite

We have analyzed network traces of TCP connections and observed that there are many more losses during the handshake than for the remainder of the data exchange. Although recently developed AQM schemes can efficiently reduce latency related to bufferbloat, only more complex solutions relying on Fair Queueing (FQ) can improve the long delays resulting from the loss of a packet during the establishment of a TCP connection. In this paper, we propose SPA (SYN Priority Active queue management), a new low-complexity queue management scheme that combines the benefits and simplicity of the most recent AQM schemes while achieving performance comparable to more complex combinations of Fair Queueing and AQM. Our evaluation shows that the SPA performance is close to FQ CoDel for only a fraction of the complexity and resource usage.

show abstract

Evaluation of ARED, CoDel and PIE

Cited by 10 publications

References 7 publications

Tackling Bufferbloat in capacity-limited networks

Tackling Bufferbloat in capacity-limited networks

A self-tuning controller for queuing delay regulation in TCP/AQM networks

The Virtue of Gentleness: Improving Connection Response Times with SYN Priority Active Queue Management

Contact Info

Product

Resources

About