A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Replication strategies in unstructured peer-to-peer networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
A Competitive Dynamic Data Replication Algorithm
Proceedings of the Ninth International Conference on Data Engineering
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
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Adaptive Replication in Peer-to-Peer Systems
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
Efficient peer-to-peer keyword searching
Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware
| Hi-index | 0.00 |
We present ARK (Adaptive Replication of Keywords) which is a replication algorithm working on DHT overlay networks. We proved in this paper that ARK is near optimal in load balance and is competitive in replica management overhead. Simulations show that ARK has great improvements in load balance and fault tolerance, comparing with existing replication algorithms in CAN, Pastry and Bamboo. ARK is achieved without explicit metadata or the need for a replica directory service, works as an independent building block on top of any overlay system. Nodes unaware of ARK can work well with nodes equipped with ARK. Although our research is part of a content indexing system, the algorithm is suitable for any overlay based data item storage and lookup system.