Scalaris: reliable transactional p2p key/value store
Proceedings of the 7th ACM SIGPLAN workshop on ERLANG
P2P Networking and Applications
P2P Networking and Applications
Transactions for distributed wikis on structured overlays
DSOM'07 Proceedings of the Distributed systems: operations and management 18th IFIP/IEEE international conference on Managing virtualization of networks and services
Enhanced Paxos Commit for Transactions on DHTs
CCGRID '10 Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing
A new and effective hierarchical overlay structure for Peer-to-Peer networks
Computer Communications
Usurp: distributed NAT traversal for overlay networks
Proceedings of the 11th IFIP WG 6.1 international conference on Distributed applications and interoperable systems
Review: A survey on content-centric technologies for the current Internet: CDN and P2P solutions
Computer Communications
Performance Evaluation of Range Queries in Key Value Stores
Journal of Grid Computing
A structured overlay for multi-dimensional range queries
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
| Hi-index | 0.00 |
Consistent hashing is at the core of many P2P protocols. It evenly distributes the keys over the nodes, thereby enabling logarithmic routing effort 'with high probability'. However, consistent hashing incurs unnecessary overhead as shown in this paper. By removing consistent hashing from Chord, we derived a protocol that has the same favorable logarithmic routing performance but needs less network hops for updating its routing table. Additionally, our Chord# protocol supports range queries, which are not possible with Chord. Our empirical results indicate that Chord# outperforms Chord even under high churn, that is, when nodes frequently join and leave the system.