Preventing Bandwidth Abuse at the Router through Sending Rate Estimate-Based Active Queue Management

Halim

IEEE Commun. Surv. Tutorials

2016

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...

“…Time complexity, however, may be greater as compared to StoRED because of the additional lookup operation. The time complexity has not been analyzed in [132].…”

Section: Each Packet Arrivalmentioning

confidence: 98%

“…FSREQM [132] bases the packet dropping probability on both the estimated input rate of the traffic and on the instantaneous queue size. To estimate the input rates of the traffic, FSREQM maintains a vector S that contains an entry for each active flow.…”

Section: A Fair Sending Rate Based Queue Management (Fsreqm)mentioning

confidence: 99%

Fairness-Driven Queue Management: A Survey and Taxonomy

Halim

IEEE Commun. Surv. Tutorials

2016

NETWORKING 2007. Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet

“…In [5] we systematically develop a scalable estimator easily amenable to high speed implementations. Here we define the estimator without providing the details of its development.…”

Section: Conceptual Designmentioning

confidence: 99%

“…where T is a parameter corresponding to the number of packets in history considered for estimation [5]. H i (·) is an exponential smoother, where the most recent observation is weighted by 1 − 1 T , the second most recent observation is weighted by 1 − 1 T 2 and so on.…”

Section: Conceptual Designmentioning

confidence: 99%

Light-Weight Control of Non-responsive Traffic with Low Buffer Requirements

Ramaswamy

Cuellar

Eidenbenz

et al. 2007

Abstract. We propose ESREQM (Efficient Sending Rate EstimationQueue Management), a novel active queue management scheme that achieves almost perfect max-min fairness among flows with minimum (constant) per-flow state and a constant number of CPU operations to handle an incoming packet using a single queue with very low buffer requirements. ESREQM estimates sending rates of flows through a history discounting process that allows it to guarantee max-min fairness by automatically adapting parameters. It can also be used to punish non-responsive flows. The per-flow state is limited to a single value per flow, which allows the flow memory to be in SRAM, thereby making packet processing scalable with link speeds. ESREQM results in good link utilization with low buffer size requirements because it provably desynchronizes TCP flows as a by-product. We show our results through a mixture of analysis and simulation. Our scheme does not make assumptions on what transport protocols are used.

IEEE GLOBECOM 2007-2007 IEEE Global Telecommunications Conference

“…Most of these schemes cannot guarantee fairness among flows, while being inexpensively implementable at the router at high speeds. In [4], we develop a class of queue management schemes called sending rate estimate based queue management schemes (SREQM) that can guarantee max-min fai r bandwidth allocation to flows in a router. These queue management schemes operate by differentially dropping packets from flows based on an estimate of the sending rate of flows as well as on the aggregate queue length.…”

mentioning

confidence: 99%

Low Overhead Router-Based Congestion Control Techniques to Protect Responsive Traffic

Ramaswamy

Cuellar

Eidenbenz

et al. 2007

In this paper, we present queue management algorithms with low implementation complexity that can partition the bandwidth of an outgoing link among flows in a high speed packet switch. These algorithms belong to a family of queue management schemes called Sending Rate Estimate Based Queue Management Schemes (SREQM), which try to prevent congestion by effectively limiting flows based on their estimated sending rates. We also present techniques based on sampling and Bloom filters to further reduce the implementation overhead. The capability of the algorithms to protect responsive flows from non-responsive flows are confirmed by exhaustive analysis and simulations. I. INT RODUCTION