Abstract
The tail latency of end-user requests, which directly impacts the user experience and the revenue, is highly related to its corresponding numerous accesses in key-value stores. The replica selection algorithm is crucial to cut the tail latency of these key-value accesses. Recently, the C3 algorithm, which creatively piggybacks the queue-size of waiting keys from replica servers for the replica selection at clients, is proposed in NSDI 2015. Although C3 improves the tail latency a lot, it suffers from the timeliness issue on the feedback information, which directly influences the replica selection. In this paper, we analysis the evaluation of queue-size of waiting keys of C3, and some findings of queue-size variation were made. It motivate us to propose the Prediction-Based Replica Selection (PRS) algorithm, which predicts the queue-size at replica servers under the poor timeliness condition, instead of utilizing the exponentially weighted moving average of the state piggybacked queue-size as in C3. Consequently, PRS can obtain more accurate queue-size at clients than C3, and thus outperforms C3 in terms of cutting the tail latency. Simulation results confirm the advantage of PRS over C3.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Decandia, G., Hastorun, D., Jampani, M., Kakulapati, G., Lakshman, A., Pilchin, A., Sivasubramanian, S., Vosshall, P., Vogels, W.: Dynamo: amazons highly available key-value store. In: Proceedings of the SOSP (2007)
Jalaparti, V., Bodik, P., Kandula, S., Menache, I., Rybalkin, M., Yan, C.: Speeding up distributed request-response workflows. In: Proceedings of the SIGCOMM (2013)
Brutlag, J.: Speed Matters (2009). http://googleresearch.blogspot.com/2009/06/speed-matters.html
Rumble, S.M., Ongaro, D., Stutsman, R., Rosenblum, M., Ousterhout, J.K.: Its time for low latency. In: Proceedings of the HotOS (2011)
Nishtala, R., Fugal, H., Grimm, S., Kwiatkowski, M., Lee, H., Li, H.C., McElroy, R., Paleczny, M., Peek, D., Saab, P., Stafford, D., Tung, T., Venkataramani, V.: Scaling memcache at facebook. In: Proceedings of the NSDI (2013)
Riak Load Balancing and Proxy Configuration (2014). http://docs.basho.com/riak/1.4.0/cookbooks/Load-Balancing-and-Proxy-Configuration/
Amazon ELB (2014). http://docs.aws.amazon.com/ElasticLoadBalancing/latest/DeveloperGuide/TerminologyandKeyConcepts.html
Cassandra Documentation (2014). http://www.datastax.com/documentation/cassandra/2.0
Atikoglu, B., Xu, Y., Frachtenberg, E., Jiang, S., Paleczny, M.:. Workload analysis of a large-scale key-value store. In: SIGMETRICS (2012)
Suresh, L., Canini, M., Schmid, S., Feldmann, A.: C3: cutting tail latency in cloud data stores via adaptive replica selection. In: Proceedings of the NSDI (2015)
Jiang, W., Fang, L., Xie, H., Zhou, X., Wang, J.: Timeliness-aware adaptive replica selection for key-value stores. In: ICCCN, Tars (2017)
Suresh, L: Simulation Code of C3. https://github.com/lalithsuresh/absim/tree/table
Vulimiri, A., Godfrey, P.B., Mittal, R., Sherry, J., Ratnasamy, S., Shenker, S.: Low latency via redundancy. In: CoNEXT (2013)
Schad, J., Dittrich, J., Quiane-Ruiz, J.-A.: Runtime measurements in the cloud: observing, analyzing, and reducing variance. VLDB Endow. 3(1–2), 460–471 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Fang, L., Zhou, X., Xie, H., Jiang, W. (2017). PRS: Predication-Based Replica Selection Algorithm for Key-Value Stores. In: Zou, B., Li, M., Wang, H., Song, X., Xie, W., Lu, Z. (eds) Data Science. ICPCSEE 2017. Communications in Computer and Information Science, vol 727. Springer, Singapore. https://doi.org/10.1007/978-981-10-6385-5_27
Download citation
DOI: https://doi.org/10.1007/978-981-10-6385-5_27
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-6384-8
Online ISBN: 978-981-10-6385-5
eBook Packages: Computer ScienceComputer Science (R0)