Technical reports
Latency-First datacenter network scheduling
January 2020, 310 pages
This technical report is based on a dissertation submitted April 2017 by the author for the degree of Doctor of Philosophy to the University of Cambridge.
DOI: 10.48456/tr-943
Abstract
Every day we take for granted that, with the click of a mouse or a tap on a touchscreen, we can instantly access the Internet to globally exchange information, finances and physical goods. The computational machinery behind the Internet is found in datacenters scattered all over the globe. Each datacenter contains many tens of thousands of computers connected together through a datacenter network. Like the Internet, datacenter networks suffer from network interference. Network interference occurs when congestion caused by some applications, delays or interferes with traffic from other applications. Network interference makes it difficult to predict network latency: the time that any given packet will take to traverse the network. The lack of predictability makes it difficult to build fast, efficient, and responsive datacenter applications.
In this dissertation I address the problem of network interference in datacenter networks. I do so primarily by exploiting network scheduling techniques. Network scheduling techniques were previously developed to provide predictability in the Internet. However, they were complex to deploy and administer because few assumptions could be made about the network. Unlike the Internet, datacenter networks are administered by a single entity, and have well known physical properties, that rarely change.
The thesis of this dissertation is that it is both possible and practical to resolve network interference in datacenter networks by using network scheduling techniques. I show that it is possible to resolve network interference by deriving a simple, and general, network scheduler and traffic regulator. I take the novel step of basing my scheduler design on a simple, but realistic, model of a datacenter switch. By regulating the flow of traffic into each switch, I show that it is possible to bound latency across the network. I develop the leaky token bucket regulator to perform this function. I show that my network scheduler design is practical by implementing a simple, and immediately deployable, system called QJUMP. QJUMP is thoroughly evaluated and demonstrated to resolve network interference between datacenter applications in both simulation and on a physical test-bed. I further show that QJUMP can be extended and improved upon in a variety of ways. I therefore conclude that it is both possible and practical to control network interference in datacenter networks using network scheduling techniques.
Full text
PDF (10.3 MB)
BibTeX record
@TechReport{UCAM-CL-TR-943,
author = {Grosvenor, Mathew P.},
title = {{Latency-First datacenter network scheduling}},
year = 2020,
month = jan,
url = {https://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-943.pdf},
institution = {University of Cambridge, Computer Laboratory},
doi = {10.48456/tr-943},
number = {UCAM-CL-TR-943}
}