Improving the performance of active buffer management with per-flow information

Nabeshima, Masayoshi

doi:10.1109/lcomm.2002.801321

Cited by 9 publications

(3 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We discuss general attributes, design approaches, and advantages and disadvantages of these schemes in this section. The state space and the computational costs of these schemes are summarized in Table III of BRED has been shown to have the ability to effectively isolate unresponsive and responsive flows and there have been a number of extensions of BRED, such as the ones presented in [83] and [121]. However, unresponsive flows can still get much higher bandwidth than responsive ones when buffer size is small.…”

Section: Rate Based Schemesmentioning

confidence: 99%

See 1 more Smart Citation

Fairness-Driven Queue Management: A Survey and Taxonomy

Abbas

Halim

Abbas

2016

IEEE Commun. Surv. Tutorials

View full text Add to dashboard Cite

Providing congestion control in the Internet, while ensuring fairness among myriad of heterogeneous flows is a challenging task. The conventional wisdom is to rely on end-user applications cooperatively deploying congestion control mechanisms to achieve high network utilization and some degree of fairness among flows. However, as the Internet has evolved to encompass all of society, such a cooperative behavior from enduser applications is not always granted. Applications may simply act selfishly to be more competitive through bandwidth abuse. Bandwidth starvation may also arise unintentionally depending on the nature of traffic sources. The ensuing impact can be severe fairness hazard and even congestion collapse. Router-based queue management schemes driven by fairness objectives thus become an inescapable necessity for fairly sharing network resources.Given a significant volume of literature relating to fairnessdriven queue management schemes, there has remained a need for a broader and coherent survey. This paper presents a systematic and comprehensive review of eminent fairness-driven queue management schemes from the inception of the concept and the preliminary work to the most recent work. We present a new taxonomy of categorizing fairness-driven queue management schemes. We discuss design approaches and key attributes of these schemes and provide their comparison and analysis. Based on the outcomes of this survey, we discuss a number of open issues and provide generic design guidelines and future directions for the research in this field. Fairness-Driven Queue Management: A Survey and Taxonomy 2 c packets/s Scheduling algorithm Dequeueend B packets Buffer k l 1 l Enqueueend Output link Input links Queue management algorithm mechanisms at all, either deliberately or by accident, and generate misbehaving traffic [9]. Furthermore, there are applications that selfishly improve throughput by splitting a single TCP connection into multiple connections [10], [3]. All such applications and the resulting traffic aggregates are potentially dangerous as they inflict unfairness in the network, and can eventually cause congestion collapse [9], [11].In response to these problems, there has been a long history, dating back to [12], of realizing that routers play a significant role in fair bandwidth allocation. The technical report by Floyd and Fall [13] (later published as [3]) is, however, the first one to extensively demonstrate the danger of unfairness due to unresponsive flows. Floyd and Fall [13] argue that the incentives for cooperative behavior can only come from the network itself, and therefore, routers inevitably need to deploy mechanisms to provide an incentive structure for applications to use end-to-end congestion control. The report also proposes queue management based techniques for identifying and restricting unresponsive flows. Since then, a number of fairness-driven queue management schemes have been proposed to shield responsive flows and to regulate unresponsive and aggressive flows.This paper provid...

show abstract

Section: Rate Based Schemesmentioning

confidence: 99%

“…In general, a per-activeflow queue management scheme is implemented using a single queue in order to keep the buffer occupancy of each flow equal, as opposed to per-flow scheduling that requires a separate queue for each flow[42],[83].…”

mentioning

confidence: 99%

Fairness-Driven Queue Management: A Survey and Taxonomy

Abbas

Halim

Abbas

2016

IEEE Commun. Surv. Tutorials

View full text Add to dashboard Cite

show abstract

“…Due to these drawbacks some new modified schemes including adaptive RED (ARED) [11], Flow Random Early Detection (FRED) [12], stabilized RED (SRED) [13], balanced RED (BRED) [14], BRED with virtual buffer occupancy (BRED/VBO) [15], exponential RED (ERED) [16], dynamic RED (DRED) [17], novel autonomous proportional and differential RED (PD-RED) [18,102], loss ratio and rate control RED (LRC-RED) [19], robust RED (RRED) [20], Neural network based RED (NN-RED) [103], random exponentially marking (REM) [6], adaptive virtual queue (AVQ) [5], BLUE [21], YELLOW [22], and GREEN [23] have been proposed as alternatives to RED.…”

Section: Introductionmentioning

confidence: 99%

Adaptive active queue management controller for TCP communication networks using PSO-RBF models

Sheikhan

Shahnazi

Hemmati

2012

Neural Comput & Applic

View full text Add to dashboard Cite

Addressing performance degradations in end-to-end congestion control has been one of the most active research areas in the last decade. Active queue management (AQM) aims to improve the overall network throughput, while providing lower delay and reduce packet loss and improving network. The basic idea is to actively trigger packet dropping (or marking provided by explicit congestion notification (

show abstract

Fair TCP congestion control in heterogeneous networks with explicit congestion notification

Byun

Lim

2005

IEE Proc., Commun.

View full text Add to dashboard Cite

Improving the performance of active buffer management with per-flow information

Cited by 9 publications

References 5 publications

Fairness-Driven Queue Management: A Survey and Taxonomy

Fairness-Driven Queue Management: A Survey and Taxonomy

Adaptive active queue management controller for TCP communication networks using PSO-RBF models

Fair TCP congestion control in heterogeneous networks with explicit congestion notification

Contact Info

Product

Resources

About