Analysis and performance evaluation of the EFCM common congestion controller for TCP connections

NOMS 2018 - 2018 IEEE/IFIP Network Operations and Management Symposium

Gjessing

2018

Communication between two Internet hosts using parallel connections may result in unwanted interference between the connections. In this dissertation, we propose a senderside solution to address this problem by letting the congestion controllers of the different connections collaborate, correctly taking congestion control logic into account. Real-life experiments and simulations show that our solution works for a wide variety of congestion control mechanisms, provides great flexibility when allocating application traffic to the connections, and results in lower queuing delay and less packet loss.

“…Fig. 3 shows the goodput values of two TFRC flows with FSE in the presence of background synthetic traffic 5 when the priority of the first flow is set to 1, while the other flows' 5…”

Section: A Coupled Congestion Control For Rtp Mediamentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Lightweight and flexible single-path congestion control coupling

NOMS 2018 - 2018 IEEE/IFIP Network Operations and Management Symposium

Gjessing

2018

“…Examples of the former include SPDY [1] and HTTP/2 [2], which multiplex multiple web sessions on top of a single TCP connection between client and server. Examples of the latter, often referred to as coupled congestion control (ccc), include the Congestion Manager (CM [3]), Ensemble TCP (E-TCP [4]) and Ensemble Flow Congestion Management (EFCM [5]).…”

Section: Introductionmentioning

confidence: 99%

ctrlTCP: Reducing latency through coupled, heterogeneous multi-flow TCP congestion control

IEEE INFOCOM 2018 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)

Hiorth

et al. 2018

We present ctrlTCP, a method to combine the congestion controls of multiple TCP connections. In contrast to the previous methods such as the Congestion Manager, ctrlTCP can couple all TCP flows that leave one sender, traverse a common bottleneck (e.g., a home user's thin uplink) and arrive at different destinations. Using ns-2 simulations and an implementation in the FreeBSD kernel, we show that our mechanism reduces queuing delay, packet loss, and short flow completion times while enabling precise allocation of the share of the available bandwidth between the connections according to the needs of the applications.

“…In E-TCP, the aggregate of an ensemble is no more aggressive than one TCP Reno connection. Ensemble Flow Congestion Management (EFCM) [9] extended E-TCP by allowing the aggregate of an ensemble to be as aggressive as n TCP connections. These two mechanisms both realize a service of joint congestion control, somewhat similar to the Congestion Manager (CM) [2] or when using application stream multiplexing as in e.g.…”

Section: Introductionmentioning

confidence: 99%

Start Me Up

Proceedings of the 2016 Applied Networking Research Workshop

2016

When multiple TCP connections are used between the same host pair, they often share a common bottleneck-especially when they are encapsulated together, e.g. in VPN scenarios. Then, all connections after the first should not have to guess the right initial value for the congestion window, but rather get the appropriate value from other connections. This allows short flows to complete much faster-but it can also lead to large bursts that cause problems on their own. Prior work used timer-based pacing methods to alleviate this problem; we introduce a new algorithm that "paces" packets by instead correctly maintaining the ACK clock, and show its positive impact in combination with a previously presented congestion coupling algorithm.