The Community for Technology Leaders
2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS) (2018)
Vienna, Austria
Jul 2, 2018 to Jul 6, 2018
ISSN: 2575-8411
ISBN: 978-1-5386-6871-9
pp: 143-153
ABSTRACT
In distributed key-value stores, performance fluctuations generally occur across servers, especially when the servers are deployed in a cloud environment. Hence, the replica selected for a request will directly affect the response latency. In the context of key-value stores, even the state-of-the-art algorithm of replica selection still has considerable room for improving the response latency. In this paper, we present the fundamental factors that prevent replica selection algorithms from being effective. We address these factors by proposing NetRS, a framework that enables in-network replica selection for key-value stores. NetRS exploits emerging network devices, including programmable switches and network accelerators, to select replicas for requests. NetRS supports diverse algorithms of replica selection and is suited to the network topology of modern data centers. Compared with the conventional scheme of clients selecting replicas for requests, NetRS could effectively cut the response latency according to our extensive evaluations. Specifically, NetRS reduces the average latency by up to 48.4%, and the 99th latency by up to 68.7%.
INDEX TERMS
cache storage, cloud computing, synchronisation
CITATION

Y. Su, D. Feng, Y. Hua, Z. Shi and T. Zhu, "NetRS: Cutting Response Latency in Distributed Key-Value Stores with In-Network Replica Selection," 2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS), Vienna, Austria, 2018, pp. 143-153.
doi:10.1109/ICDCS.2018.00024
184 ms
(Ver 3.3 (11022016))