Sunday, December 21, 2014
Peer to Peer Lookup using Consistent Hashing and Virtual Nodes
It took a long time for me to understand the relationship between Consistent Hashing and Virtual Nodes.
Consitent Hashing and Virtual Nodes. Paper
Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications
Consitent Hashing Paper
Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web
Amazon’s Dynamo DB uses consistent hashing with virtual nodes to locate nodes and keys in the dynamo ring.
Dynamo: Amazon’s Highly Available Key-value Store
Consitent Hashing and Virtual Nodes. Paper
Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications
Consitent Hashing Paper
Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web
Consistent Hashing and Virtual Nodes
Amazon’s Dynamo DB uses consistent hashing with virtual nodes to locate nodes and keys in the dynamo ring.
Dynamo: Amazon’s Highly Available Key-value Store
Subscribe to:
Posts (Atom)