https://github.com/arriqaaq/ring
consistent hashing paper implementation using Red Black tree
https://github.com/arriqaaq/ring
consistent-hash-algorithm consistent-hashing consistent-hashing-library go red-black-tree ring
Last synced: 2 months ago
JSON representation
consistent hashing paper implementation using Red Black tree
- Host: GitHub
- URL: https://github.com/arriqaaq/ring
- Owner: arriqaaq
- License: mit
- Created: 2018-08-25T02:58:24.000Z (almost 7 years ago)
- Default Branch: master
- Last Pushed: 2019-06-15T06:24:37.000Z (about 6 years ago)
- Last Synced: 2025-04-12T23:42:22.394Z (2 months ago)
- Topics: consistent-hash-algorithm, consistent-hashing, consistent-hashing-library, go, red-black-tree, ring
- Language: Go
- Size: 7.81 KB
- Stars: 4
- Watchers: 1
- Forks: 2
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Ring
Consistent hashing paper implementation using Red Black Tree
## Example Usage
```go
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.pdfRing Image source: http://paperplanes-assets.s3.amazonaws.com/consistent-hashing.png