A Quantitative Theory of Bottleneck Structures for Data Networks

by   Jordi Ros-Giralt, et al.

The conventional view of the congestion control problem in data networks is based on the principle that a flow's performance is uniquely determined by the state of its bottleneck link, regardless of the topological properties of the network. However, recent work has shown that the behavior of congestion-controlled networks is better explained by models that account for the interactions between bottleneck links. These interactions are captured by a latent bottleneck structure, a model describing the complex ripple effects that changes in one part of the network exert on the other parts. In this paper, we present a quantitative theory of bottleneck structures (QTBS), a mathematical and engineering framework comprising a family of polynomial-time algorithms that can be used to reason about a wide variety of network optimization problems, including routing, capacity planning and flow control. QTBS can contribute to traffic engineering by making clear predictions about the relative performance of alternative flow routes, and by providing numerical recommendations for the optimal rate settings of traffic shapers. A particularly novel result in the domain of capacity planning indicates that previously established rules for the design of folded-Clos networks are suboptimal when flows are congestion controlled. We show that QTBS can be used to derive the optimal rules for this important class of topologies, and empirically demonstrate the correctness and efficacy of these results using the BBR and Cubic congestion-control algorithms.


page 1

page 2

page 3

page 4


Link Capacity Distributions and Optimal Capacities for Competent Network Performance

This work addresses the problem of evaluating optimal link capacities of...

ABC: A Simple Explicit Congestion Control Protocol for Wireless Networks

We propose Accel-Brake Control (ABC), a simple and deployable explicit c...

Model Predictive Congestion Control for TCP Endpoints

A common problem in science networks and private wide area networks (WAN...

CCID5: An implementation of the BBR Congestion Control algorithm for DCCP and its impact over multi-path scenarios

Providing multi-connectivity services is an important goal for next gene...

Updating the Theory of Buffer Sizing

Routers have packet buffers to reduce packet drops during times of conge...

Optimal Congestion Control for Time-varying Wireless Links

Modern networks exhibit a high degree of variability in link rates. Cell...

Optimization-Based Predictive Congestion Control for the Tor Network: Opportunities and Challenges

Based on the principle of onion routing, the Tor network achieves anonym...

Please sign up or login with your details

Forgot password? Click here to reset