Paper Info
Title
Ultra-Fast Load Balancing of Distributed Key-Value Stores through Network-Assisted Lookups.
Abstract
Many systems rely on distributed caches with thousands of nodes to improve response times and off-load underlying systems. Large-scale caching presents challenges in terms of resource utilization, load balancing, robustness and flexibility of deployment. In this paper, we propose a novel distributed caching method based on dynamic IP address assignment. Keys are mapped to a large IP address space statically and each node is dynamically assigned multiple IP addresses. As a result, we have a system with minimal need for central coordination, while eliminating the single point of failure in competitive solutions. We evaluate our system in our datacenter and show that our approach localizes the effect of load-balancing to only loaded cache servers, while leaving cache clients unaffected and also providing for finely-granular rebalancing.
Year
DOI
Venue
2014
10.1007/978-3-319-09873-9_25
Lecture Notes in Computer Science
Field
DocType
Volume
Single point of failure,Software deployment,Load balancing (computing),Computer science,CPU cache,Cache,Server,Block (data storage),Robustness (computer science),Distributed computing
Conference
8632
ISSN
Citations 
PageRank 
0302-9743
2
0.39
References 
Authors
4
4
Name
Order
Citations
PageRank
Davide De Cesaris120.39
Kostas Katrinis210219.41
Spyros Kotoulas359046.46
A. Corradi42429183.23