PDL ABSTRACT

SNC-Meister: Admitting More Tenants with Tail Latency SLOs

SoCC ’16, October 05-07, 2016, Santa Clara, CA, USA.

Timothy Zhu, Daniel S. Berger*, Mor Harchol-Balter

Carnegie Mellon University
* University of Kaiserslautern

http://www.pdl.cmu.edu/

Meeting tail latency Service Level Objectives (SLOs) in shared cloud networks is both important and challenging. One primary challenge is determining limits on the multi-tenancy such that SLOs are met. Doing so involves estimating latency, which is difficult, especially when tenants exhibit bursty behavior as is common in production environments. Nevertheless, recent papers in the past two years (Silo, QJump, and PriorityMeister) show techniques for calculating latency based on a branch of mathematical modeling called Deterministic Network Calculus (DNC). The DNC theory is designed for adversarial worst-case conditions, which is sometimes necessary, but is often overly conservative. Typical tenants do not require strict worst-case guarantees, but are only looking for SLOs at lower percentiles (e.g., 99th, 99.9th).

This paper describes SNC-Meister, a new admission control system for tail latency SLOs. SNC-Meister improves upon the state-of-the-art DNC-based systems by using a new theory, Stochastic Network Calculus (SNC), which is designed for tail latency percentiles. Focusing on tail latency percentiles, rather than the adversarial worst-case DNC latency, allows SNC-Meister to pack together many more tenants: in experiments with production traces, SNC-Meister supports 75% more tenants than the state-of-the-art.

KEYWORDS: stochastic network calculus, tail latency guarantees, quality of service

FULL PAPER: pdf

 


 

 

 

© 2017. Last updated 27 September, 2016