Latency-bandwidth tradeoffs in Internet applications

Latency;analytics;online analytical processing (olap);geo-distributed analytics

Vulimiri, Ashish

关键词: Latency;    analytics;    online analytical processing (olap);    geo-distributed analytics;   

Others  :  https://www.ideals.illinois.edu/bitstream/handle/2142/89007/VULIMIRI-DISSERTATION-2015.pdf?sequence=1&isAllowed=y

美国|英语

来源: The Illinois Digital Environment for Access to Learning and Scholarship

【 摘 要 】

Wide-area Internet links are slow, expensive, and unreliable.This affects applications in two distinct ways.Back-end data processing applications, which need to transfer large amounts of data between data centers across the world, are primarily constrained by the limited capacity of Internet links.Front-end user facing applications, on the other hand, are primarily latency-sensitive, and are bottlenecked by the high, unpredictably variable delays in the wide-area network.Our work exploits this asymmetry in applications' requirements by developing techniques that trade off one of bandwidth and latency to improve the other.We first consider the problem of supporting analytics over the large volumes of geographically dispersed data produced by global-scale organizations.Current solutions for analyzing this data as a whole operate by copying it to a single central data center, an approach that incurs substantial data transfer costs.We instead propose an alternative geo-distributed approach, orchestrating distributed execution across data centers.Our system, Geode, incorporates two key optimizations --- a low-level syntactic network redundancy elimination mechanism, and a high-level semantically aware workload optimization process --- both of which operate by trading off increased processing overhead (and computation latency) within data centers for a reduction in cross-data center bandwidth usage.In experiments we find that Geode achieves an up to 360x cost reduction compared to the current centralized baseline on a range of workloads, both real and synthetic.Next, we evaluate a simple, general purpose technique for trading off bandwidth for reduced latency: initiate redundant copies of latency sensitive operations and take the first copy to complete.While redundancy has been explored in some past systems, its use is typically avoided because of a fear of the overhead that it adds.We study the latency-bandwidth tradeoff due to redundancy and (i) show via empirical evaluation that its use is indeed a net positive in a number of important applications, and (ii) provide a theoretical characterization of its effect, identifying when it should and should not be used and how systems can tune their use of redundancy to maximum effect.Our results suggest that redundancy should be used much more widely than it currently is.