Centralized Congestion Control and Scheduling in a Datacenter

10/06/2017
by   Devavrat Shah, et al.
0

We consider the problem of designing a packet-level congestion control and scheduling policy for datacenter networks. Current datacenter networks primarily inherit the principles that went into the design of Internet, where congestion control and scheduling are distributed. While distributed architecture provides robustness, it suffers in terms of performance. Unlike Internet, data center is fundamentally a "controlled" environment. This raises the possibility of designing a centralized architecture to achieve better performance. Recent solutions such as Fastpass and Flowtune have provided the proof of this concept. This raises the question: what is theoretically optimal performance achievable in a data center? We propose a centralized policy that guarantees a per-flow end-to-end flow delay bound of O(#hops × flow-size / gap-to-capacity). Effectively such an end-to-end delay will be experienced by flows even if we removed congestion control and scheduling constraints as the resulting queueing networks can be viewed as the classical reversible multi-class queuing network, which has a product-form stationary distribution. In the language of Harrison et al., we establish that baseline performance for this model class is achievable. Indeed, as the key contribution of this work, we propose a method to emulate such a reversible queuing network while satisfying congestion control and scheduling constraints. Precisely, our policy is an emulation of Store-and-Forward (SFA) congestion control in conjunction with Last-Come-First-Serve Preemptive-Resume (LCFS-PR) scheduling policy.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/31/2021

Beyond Bufferbloat: End-to-End Congestion Control Cannot Avoid Latency Spikes

End-to-end congestion control is the main method of congestion control i...
research
02/21/2018

PABO: A Link-Layer Congestion Mitigation Mechanism Based on Packet Bounce

In today's data center, a diverse mix of throughput-sensitive long flows...
research
07/02/2020

LSTFCoDel: CoDel with LSTF-Style Priority Queuing

Congestion control is vastly important in computer networks. Arising nat...
research
03/26/2018

Stability and Dynamic Control of Underlay Mobile Edge Networks

This paper studies the stability and dynamic control of underlay mobile ...
research
08/09/2020

User Popularity-based Packet Scheduling for Congestion Control in Ad-hoc Social Networks

Traditional ad-hoc network packet scheduling schemes cannot fulfill the ...
research
02/10/2020

PBE-CC: Congestion Control via Endpoint-Centric, Physical-Layer Bandwidth Measurements

Wireless networks are becoming ever more sophisticated and overcrowded, ...
research
04/17/2017

On the Capacity Requirement for Arbitrary End-to-End Deadline and Reliability Guarantees in Multi-hop Networks

It has been shown that it is impossible to achieve both stringent end-to...

Please sign up or login with your details

Forgot password? Click here to reset