Skip to main content

Load Balancing in In-Memory Key-Value Stores for Response Time Minimization

  • Conference paper
  • First Online:
Economics of Grids, Clouds, Systems, and Services (GECON 2016)

Abstract

In-memory key-value stores (IMKVS) have now turned into a mainstream technology in order to meet with demanding temporal application requirements under heavy loads. This work examines the factors that affect the load distribution in IMKVS clusters as well as migration policies that cure the problem of unbalanced loads as a means to provide response time guarantees. Experiments are conducted in a Redis deployment under various settings. The results show that the key distribution and key length are contributing factors to the load balancing problem and impact the cluster’s response times. On the contrary, key popularity and query volume seem to have minor or no effect at all.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Facebook Company Info. http://newsroom.fb.com/company-info/

  2. Trajano, A.F.R., Fernandez, M.P.: Two-phase load balancing of in-memory key-value storages using network functions virtualization (NFV). J. Netw. Comput. Appl. 69, 1–13 (2016)

    Article  Google Scholar 

  3. Cesaris, D., Katrinis, K., Kotoulas, S., Corradi, A.: Ultra-fast load balancing of distributed key-value stores through network-assisted lookups. In: Silva, F., Dutra, I., Santos Costa, V. (eds.) Euro-Par 2014. LNCS, vol. 8632, pp. 294–305. Springer, Cham (2014). doi:10.1007/978-3-319-09873-9_25

    Google Scholar 

  4. Fan, B., et al.: Small cache, big effect: provable load balancing for randomly partitioned cluster services. In: Proceedings of the 2nd ACM Symposium on Cloud Computing. ACM (2011)

    Google Scholar 

  5. Konstantinou, I., et al.: DBalancer: distributed load balancing for NoSQL data-stores. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data. ACM (2013)

    Google Scholar 

  6. Srinivasan, V., Bulkowski, B.: Citrusleaf: a real-time nosql db which preserves acid. Proc. VLDB Endow. 4(12), 1340–1350 (2011)

    Google Scholar 

  7. Redis Cluster Specification. http://redis.io/topics/cluster-spec

  8. Redis Cluster tutorial. http://redis.io/topics/cluster-tutorial

  9. Carlini, E., et al.: Service and resource discovery supports over p2p overlays. In: 2009 International Conference on Ultra Modern Telecommunications & Workshops. IEEE (2009)

    Google Scholar 

  10. Gennaro, C., et al.: MRoute: a peer-to-peer routing index for similarity search in metric spaces. In: Proceedings of the 5th International Workshop on Databases, Information Systems and Peer-to-Peer Computing (DBISP2P 2007) (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Antonios Makris .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Makris, A., Tserpes, K., Anagnostopoulos, D. (2017). Load Balancing in In-Memory Key-Value Stores for Response Time Minimization. In: Bañares, J., Tserpes, K., Altmann, J. (eds) Economics of Grids, Clouds, Systems, and Services. GECON 2016. Lecture Notes in Computer Science(), vol 10382. Springer, Cham. https://doi.org/10.1007/978-3-319-61920-0_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-61920-0_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-61919-4

  • Online ISBN: 978-3-319-61920-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics