Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Security Considerations for Peer-to-Peer Distributed Hash Tables
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
The design and implementation of a next generation name service for the internet
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
A framework for structured peer-to-peer overlay networks
GC'04 Proceedings of the 2004 IST/FET international conference on Global Computing
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
Exploiting the synergy between gossiping and structured overlays
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Performance evaluation of replication strategies in DHTs under churn
Proceedings of the 6th international conference on Mobile and ubiquitous multimedia
Fault-tolerant routing through the 'Umbrella' protocol
International Journal of Internet Protocol Technology
Symmetric replication for efficient flooding in DHTs
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Scalaris: reliable transactional p2p key/value store
Proceedings of the 7th ACM SIGPLAN workshop on ERLANG
Self Management for Large-Scale Distributed Systems: An Overview of the SELFMAN Project
Formal Methods for Components and Objects
A proactive low-overhead file replication scheme for structured P2P content delivery networks
Journal of Parallel and Distributed Computing
Churn-Resilient Replication Strategy for Peer-to-Peer Distributed Hash-Tables
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Passive/Active Load Balancing with Informed Node Placement in DHTs
IWSOS '09 Proceedings of the 4th IFIP TC 6 International Workshop on Self-Organizing Systems
Structured flooding search in chord overlays
GIIS'09 Proceedings of the Second international conference on Global Information Infrastructure Symposium
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
Shepherd: node monitors for fault-tolerant distributed process execution in OSIRIS
Proceedings of the 5th International Workshop on Enhanced Web Service Technologies
A Read-Only Distributed Hash Table
Journal of Grid Computing
DOH: a content delivery peer-to-peer network
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Overcoming software fragility with interacting feedback loops and reversible phase transitions
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
RelaxDHT: A churn-resilient replication strategy for peer-to-peer distributed hash-tables
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
ID-replication for structured peer-to-peer systems
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
OSIRIS-SR: a scalable yet reliable distributed workflow execution engine
Proceedings of the 2nd ACM SIGMOD Workshop on Scalable Workflow Execution Engines and Technologies
| Hi-index | 0.00 |
Structured peer-to-peer systems rely on replication as a basic means to provide fault-tolerance in presence of high churn. Most select replicas using either multiple hash functions, successor-lists, or leaf-sets. We show that all three alternatives have limitations. We present and provide full algorithmic specification for a generic replication scheme called symmetric replication which only needs O(1) message for every join and leave operation to maintain any replication degree. The scheme is applicable to all existing structured peer-to-peer systems, and can be implemented on-top of any DHT. The scheme has been implemented in our DKS system, and is used to do load-balancing, end-to-end faulttolerance, and to increase the security by using distributed voting. We outline an extension to the scheme, implemented in DKS, which adds routing proximity to reduce latencies. The scheme is particularly suitable for use with erasure codes, as it can be used to fetch a random subset of the replicas for decoding.