BO-ARED: A new AQM algorithm with adaptive adjustment of parameters

Luo, Yunqi; Chen, Hong; Yang, Xiaoping; Hao, Yuxiang

doi:10.1109/wcica.2010.5554486

Cited by 3 publications

(1 citation statement)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Improving the RED algorithm allows networks to detect and avoid congestion quicker than standard RED currently does. Standard RED is very sensitive to a network environment due to the fixed threshold settings [8]. These parameters are configured specifically for each network.…”

Section: Redmentioning

confidence: 99%

Reliable Ethernet

Movsesyan

View full text Add to dashboard Cite

Reliable Ethernet Aleksandr Movsesyan Networks within data centers, such as connections between servers and disk arrays, need lossless flow control allowing all packets to move quickly through the network to reach their destination. This paper proposes a new algorithm for congestion control to satisfy the needs of such networks and to answer the question: Is it possible to provide circuit-less reliability and flow control in an Ethernet network? TCP uses an end-to-end congestion control algorithm, which is based on end-to-end round trip time (RTT). Therefore its flow control and error detection/correction approach is dependent on end-to-end RTT. Other approaches utilize specialized data link layer networks such as InfiniBand and Fibre Channel to provide network reliability. The algorithm proposed in this thesis builds on the ubiquitous Ethernet protocol to provide reliability at the data link layer without the overhead and cost of the specialized networks or the delay induced by TCP's end-to-end approach. This approach requires modifications to the Ethernet switches to implement a back pressure based flow control algorithm. This back pressure algorithm utilizes a modified version of the Random Early Detection (RED) algorithm to detect congestion. v Our simulation results show that the algorithm can quickly recover from congestion and that the average latency of the network is close to the average latency when no congestion is present. With correct threshold and alpha values, buffer sizes in the network and on the source nodes can be kept small to allow little needed additional hardware to implement the system.

show abstract

Section: Redmentioning

confidence: 99%

Reliable Ethernet

Movsesyan

View full text Add to dashboard Cite

show abstract

Extended Queue Backward Congestion Control Algorithms for Web Transfers

Prakash¹,

Amalarethinam²,

Raj

2012

Procedia Engineering

View full text Add to dashboard Cite

Fairness and Percentage Loss Analysis for Short Lived Web Transfers using QMBCCA

Prakash¹,

Amalarethinam²,

Raj³

2011

IJCA

View full text Add to dashboard Cite

One of the major problems in Internet today is Network Congestion. TCP is used as a Transport Protocol for most of the applications on the Internet and is also responsible for adjusting to network congestion dynamically. The Active Queue Management algorithms (AQM) are used to reduce congestion, and in this paper two such AQM algorithms are considered. Here we look at the existing Explicit Congestion Notification (ECN) algorithm and a Queue Management Backward Congestion Control Algorithm (QMBCCA). A comparison is made between the two algorithms in terms of Fairness and Percentage Loss for short lived web transfers. We have found that there is a significant reduction in packet loss and improvement in fairness index when using QMBCCA when there were more number of TCP flows.

show abstract

BO-ARED: A new AQM algorithm with adaptive adjustment of parameters

Cited by 3 publications

References 5 publications

Reliable Ethernet

Reliable Ethernet

Extended Queue Backward Congestion Control Algorithms for Web Transfers

Fairness and Percentage Loss Analysis for Short Lived Web Transfers using QMBCCA

Contact Info

Product

Resources

About