Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Gopalakrishnan, V., Silaghi, B., Bhattacharjee, B., Keleher, P.: Adaptive Replication in Peer-to-Peer Systems. In: The 24th International Conference on Distributed Computing Systems (March 2004)
Huang, Y., Wolfson, O.: A Competitive Dynamic Data Replication Algorithm. In: International Conference on Data Engineering (1993)
Reynolds, P., Vahdat, A.: Efficient Peer-to-Peer Keyword Searching. In: Proceedings of International Middleware Conference (2003)
Foster, I., Iamnitchi, A.: On Death, Taxes, and the Convergence of Peer-to-Peer and Grid Computing. In: IPTPS 2003 (2003)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content addressable network. In: Proceedings of ACM SIGCOMM 2001 (August 2001)
Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, p. 329. Springer, Heidelberg (2001)
Zhao, B.Y., Kubiatowicz, J., Joseph, A.: Tapestry: An infrastructure for fault-tolerant wide-area location and routing, Technical Report UCB/CSD-01-1141, University of California at Berkeley, Computer Science Department (2001)
Rhea, S., Geels, D., Roscoe, T., Kubiatowicz, J.: Handling Churn in a DHT. In: Proceedings of the USENIX Annual Technical Conference (June 2004)
Ng, S.E., Zhang, H.: Predicting Internet Network Distance with Coordinates-Based Approaches. In: IEEE INFOCOM 2002 (2002)
Cohen, E., Shenker, S.: Replication Strategies in Unstructured Peer-to-Peer Networks. In: SIGCOMM 2002 (2002)
Huang, Y., Wolfson, O.: A Competitive Dynamic Data Replication Algorithm. In: Proceedings of the Ninth International Conference on Data Engineering (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, Y., Lang, W., Zhou, M. (2005). An Adaptive Replication Algorithm in Overlay Networking. In: Lu, X., Zhao, W. (eds) Networking and Mobile Computing. ICCNMC 2005. Lecture Notes in Computer Science, vol 3619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11534310_15
Download citation
DOI: https://doi.org/10.1007/11534310_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28102-3
Online ISBN: 978-3-540-31868-2
eBook Packages: Computer ScienceComputer Science (R0)