arriqaaq / ring Public

Notifications You must be signed in to change notification settings
Fork 2
Star 3

consistent hashing paper implementation using Red Black tree

3 stars 2 forks Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 15 Commits
examples		examples
.gitignore		.gitignore
LICENSE		LICENSE
README.md		README.md
ring.go		ring.go
ring_test.go		ring_test.go

Repository files navigation

Ring

Consistent hashing paper implementation using Red Black Tree

Example Usage

ring:=NewRing([]string{"server-1","server-2","server-3"},1)
node:=ring.Get("foo")

TODO

More test cases
Performance test for xxhash

Paper

https://www.akamai.com/es/es/multimedia/documents/technical-publication/consistent-hashing-and-random-trees-distributed-caching-protocols-for-relieving-hot-spots-on-the-world-wide-web-technical-publication.pdf

Ring Image source: http://paperplanes-assets.s3.amazonaws.com/consistent-hashing.png

About

consistent hashing paper implementation using Red Black tree

go consistent-hash-algorithm ring red-black-tree consistent-hashing consistent-hashing-library

Report repository

Releases

No releases published

Packages

No packages published

Languages

Go 100.0%