Skip to main content
SpringerLink
Log in

A Consistent Hashing Based Data Redistribution Algorithm

  • Conference paper
  • First Online:
Intelligence Science and Big Data Engineering. Big Data and Machine Learning Techniques (IScIDE 2015)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 9243))

Abstract

Data partitioning is the basis of massive data distributed storage management and consistent hashing algorithm is one of the most popular data partitioning methods. We analyzes consistent hashing algorithm and find it can not guarantee the dynamic load balancing of the nodes in the system during the running time. To solve this problem,we propose a consistent hashing based data redistribution algorithm(CHRA). And the comparison of our simulation experiments verifies that the CHRA can balance the load of nodes in the system.

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

Access this chapter

Log in via an institution
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. Karger, D., Lehman, E., Leighton, T., et al.: Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 654–663. ACM (1997)

    Google Scholar 

  2. Scheuermann, P., Weikum, G., Zabback, P.: Data partitioning and load balancing in parallel disk systems. VLDB J. 7(1), 48–66 (1998)

    Article  Google Scholar 

  3. Ceri, S., Negri, M., Pelagatti, G.: Horizontal data partitioning in database design. In: Proceedings of the 1982 ACM SIGMOD International Conference on Management of Data, pp. 128–136. ACM (1982)

    Google Scholar 

  4. Byers, J., Considine, J., Mitzenmacher, M.: Simple load balancing for distributed hash. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  5. Guo, M., Nakata, I.: A framework for efficient data redistribution on distributed memory multicomputers. J. Supercomput. 20(3), 243–265 (2001)

    Article  MATH  Google Scholar 

  6. Herault, T., Herrmann, J., Marchal, L., et al.: Determining the optimal redistribution for a given data partition. In: 2014 IEEE 13th International Symposium on Parallel and Distributed Computing (ISPDC), pp. 95–102. IEEE (2014)

    Google Scholar 

  7. Yousefi’zadeh, H.: Database load balancing for multi-tier computer systems: U.S. Patent 6,950,848, 27 September 2005

    Google Scholar 

  8. Han, J., Haihong, E., Le, G., et al.: Survey on NoSQL database. In: 2011 6th International Conference on Pervasive Computing and Applications (ICPCA), pp. 363–366. IEEE (2011)

    Google Scholar 

  9. DeCandia, G., Hastorun, D., Jampani, M., et al.: Dynamo: amazon’s highly available key-value store. ACM SIGOPS Oper. Syst. Rev. 41(6), 205–220 (2007)

    Article  Google Scholar 

  10. Feinberg, A.: Project voldemort: reliable distributed storage. In: Proceedings of the 10th IEEE International Conference on Data Engineering (2011)

    Google Scholar 

Download references

Acknowledgment

This paper is supported by the national high technology research and developmentprogramme (863programme) (2012AA01A401), the national natural science foundation (60933005, 91124002) and the national information security program242 (2011A010).

Author information

Authors and Affiliations

  1. College of Computer, National University of Defense Technology, Changsha, Hunan, China

    Xiang Fu, Can Peng & Weihong Han

Authors
  1. Xiang Fu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Can Peng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Weihong Han
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiang Fu .

Editor information

Editors and Affiliations

  1. Zhejiang University, Hangzhou, China

    Xiaofei He

  2. Xidian University, Xi'an, China

    Xinbo Gao

  3. Northwestern Polytechnical University, Xi'an, China

    Yanning Zhang

  4. Nanjing University, Nanjing, China

    Zhi-Hua Zhou

  5. Chinese Academy of Sciences, Beijing, China

    Zhi-Yong Liu

  6. Suzhou University of Science and Technology, Suzhou, China

    Baochuan Fu

  7. Suzhou University of Science and Technology, Jiangsu, China

    Fuyuan Hu

  8. Suzhou University of Science and Technology, Jiangsu, China

    Zhancheng Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Fu, X., Peng, C., Han, W. (2015). A Consistent Hashing Based Data Redistribution Algorithm. In: He, X., et al. Intelligence Science and Big Data Engineering. Big Data and Machine Learning Techniques. IScIDE 2015. Lecture Notes in Computer Science(), vol 9243. Springer, Cham. https://doi.org/10.1007/978-3-319-23862-3_55

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23862-3_55

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23861-6

  • Online ISBN: 978-3-319-23862-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation