IMI Interdisciplinary Mathematics InstituteCollege of Arts and Sciences

Consistent Hashing: an overview and some thoughts

  • April 24, 2012
  • 2 p.m.
  • LeConte 412


A consistent hash function is one which maintains strong properties over a changing set of ranges. These functions have several remarkable applications all over the internet, including cache servers and P2P networks. I will be discussing some families of consistent hash functions, and some bounds on the different properties we would like them to have.

© Interdisciplinary Mathematics Institute | The University of South Carolina Board of Trustees | Webmaster