Abstract
Recently, there has been increasing interest in research on data sharing through peer-to-peer networks. In this paper, assuming a data-sharing service, we propose a new replication strategy that achieves not only load balancing but also improvement of search performance. The proposed strategy creates replicas at each peer on the path along which a query is successfully forwarded, depending on the peer’s rank of access frequency to the data. Moreover, we verify the effectiveness of the proposed strategy by simulation experiments.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Adamic, L.A., Lukose, R.M., Puniyani, A.R., Huberman, B.A.: Search in Power-Law Networks. Physical Review E 64(4), 46135–46143 (2001)
Bu, T., Towsley, D.: On Distinguishing Between Internet Power Law Topology Generators. In: Proc. INFOCOM 2002 (2002)
Cohen, E., Shenker, S.: Replication Strategies in Unstructured Peer-to-Peer Networks. In: Proc. SIGCOMM 2002, pp. 177–190 (2002)
Cuenca-Acuna, F.M., Martin, R.P., Nguyen, T.D.: Autonomous Replication for High Availability in Unstructured P2P Systems. In: Proc. SRDS 2003, pp. 99–108 (2003)
Datta, A., Hauswirth, M., Aberer, K.: Updates in Highly Unreliable, Replicated Peer-to-Peer Systems. In: Proc. ICDCS 2003, pp. 76–85 (2003)
FreeNet, http://freenet.sourceforge.net
Gnutella, http://www.gnutella.com
JXTA, http://www.jxta.org
Keyani, P., Larson, B., Senthil, M.: Peer Pressure: Distributed Recovery from Attacks in Peer-to-Peer Systems. In: Proc. Networking Workshop 2002, pp. 306–320 (2002)
Kleinberg, J.: The Small-World Phenomenon: An Algorithm Perspective. In: Proc. STOC 2000, pp. 163–170 (2000)
Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and Replication in Unstructured Peer-to-Peer Networks. In: Proc. ICS 2002, pp. 84–95 (2002)
On, G., Schmitt, J., Steinmetz, R.: The Effectiveness of Realistic Replication Strategies on Quality of Availability for Peer-to-Peer Systems. In: Prop. P2P 2003, pp. 57–65 (2003)
Maymounkov, P., Mazières, D.: Kademlia: A Peer-to-Peer Information System Based on the XOR Metric. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 53–65. Springer, Heidelberg (2002)
Ratnasamy, S., Francis, P., Handley, M., Karp, R.: A Scalable Content-Addressable Network. In: Proc. SIGCOMM 2001, pp. 161–171 (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, pp. 329–350. Springer, Heidelberg (2001)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In: Proc. SIGCOMM 2001, pp. 149–160 (2001)
Zhao, B., Kubiatowicz, J., Joseph, A.: Tapestry: An Infrastructure for Wide-area Fault-tolerant Location and Routing. In: Proc. SIGCOMM 2001, pp. 161–170 (2001)
Zipf, G.K.: Human Behavior and the Principle of Least Effort. Addison-Wesley, Reading (1949)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hara, T., Kido, Y., Nishio, S. (2006). Probabilistic Replication Based on Access Frequencies in Unstructured Peer-to-Peer Networks. In: Bressan, S., Küng, J., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2006. Lecture Notes in Computer Science, vol 4080. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11827405_77
Download citation
DOI: https://doi.org/10.1007/11827405_77
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37871-6
Online ISBN: 978-3-540-37872-3
eBook Packages: Computer ScienceComputer Science (R0)