Probabilistic Proximity-aware Resource Location in Peer-to-Peer Networks Using Resource Replication
Keywords:
Distributed systems, Peer-to-Peer network, Content Distribution, Resource Location, Performance EvaluationAbstract
Nowadays, content distribution has received remarkable attention in distributed computing researches and its applications typically allow personal computers, called peers, to cooperate with each other in order to accomplish distributed operations such as query search and acquiring digital contents. In a very large network, it is impossible to perform a query request by visiting all peers. There are some works that try to find the location of resources probabilistically (i.e. non-deterministically). They all have used inefficient protocols for finding the probable location of peers who manage the resources. This paper presents a more efficient protocol that is proximity-aware in the sense that it is able to cache and replicate the popular queries proportional to distance latency. The protocol dictates that the farther the resources are located from the origin of a query, the more should be the probability of their replication in the caches of intermediate peers. We have validated the proposed distributed caching scheme by running it on a simulated peer-to-peer network using the well-known Gnutella system parameters. The simulation results show that the proximity-aware distributed caching can improve the efficiency of peer-to-peer resource location services in terms of the probability of finding objects, overall miss rate of the system, fraction of involved peers in the search process, and the amount of system load.References
S. Androutsellis-Theotokis, D. Spinellis, A Survey of Peer-to-Peer Content Distribution Technologies, ACM Computing Surveys, vol. 36, no. 4, pp. 335-371, 2004 http://dx.doi.org/10.1145/1041680.1041681
S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, A Scalable Content Addressable Network, Proc. ACM Sigcomm, August 2001. http://dx.doi.org/10.1145/383059.383072
M. Ripeanu, I. Foster, A. Iamnitchi, Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design, IEEE Internet Computing, 6(1), February 2002.
Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, Search and Replication in Unstructured Peer-to-Peer Networks, the 16th ACM International Conference on Supercomputing (ICS'02). New York, NY., 2002.
A. Crespo, H. Garcia-Molina, Routing Indices for Peer-to-Peer Systems, Proc. of Int. Conf. on Distributed Computing Systems, Vienna, Austria, 2002. http://dx.doi.org/10.1109/icdcs.2002.1022239
D.A. Menascé, L. Kanchanapalli, Probabilistic Scalable P2P Resource Location Services, ACM Sigmetrics Performance Evaluation Rev., Volume 30, No. 2, pp. 48-58, 2002. http://dx.doi.org/10.1145/588160.588167
D. Menascé, Scalable P2P Search, IEEE Internet Computing, Volume 7, No. 2, March/April 2003. http://dx.doi.org/10.1109/MIC.2003.1189193
L. Dai, Y. Cao, Y. Cui and Y. Xue, On Scalability of Proximity-Aware Peer-to-Peer Streaming, in Computer Communications, Elsevier, vol. 32, no 1, pp. 144-153, 2009.
Y. Zhu, B. Li., Overlay Networks with Linear Capacity Constraints, IEEE Transactions on Parallel and Distributed Systems, 19 (2), pp. 159-173, February 2008.
Y. Zhu, B. Li, K. Q. Pu., Dynamic Multicast in Overlay Networks with Linear Capacity Constraints, IEEE Transactions on Parallel and Distributed Systems, Vol. 20, No. 7, pp. 925-939, 2009. http://dx.doi.org/10.1109/TPDS.2008.155
G.P. Jesi, A. Montresor, O. Babaoglu, Proximity-Aware Superpeer Overlay Topologies, IEEE Transactions on Network and Service Management, September 2007. http://dx.doi.org/10.1109/TNSM.2007.070904
F. Dabek, R. Cox, F. Kaashoek, and R. Morris., VIVALDI: A Decentralized Network Coordinate System, The SIGCOMM '04, Portland, Oregon, August 2004.
I. Clarke, S. G. Miller, T. W. Hong, O. Sandberg, and B. Wiley, Protecting Free Expression Online with Freenet, IEEE Internet Computing, Volume 5, No. 1, pp. 40-49, 2002. http://dx.doi.org/10.1109/4236.978368
B. Yang, H. Garcia-Molina, Designing a Super-Peer Network, Proc. Int'l Conf. Data Eng. (ICDE), pp. 49-63, Mar. 2003.
C. Palmer, J. Steffan, Generating network topologies that obey power laws, The GLOBECOM 2000, November 2000.
B. Yang, H. Garcia-Molina, Comparing Hybrid Peer-to-Peer Systems, Proc. 27th Int. Conf. on Very Large Data Bases, Rome, 2001.
J.W. Song, K.S. Park, S.B. Yang, An Effective Cooperative Cache Replacement Policy for Mobile P2P Environments, In proceeding of IEEE International Conference on Hybrid Information Technology (ICHIT'06), Korea, Vol. 2, pp. 24-30, 2006.
B. Yang, H. Garcia-Molina, Improving Search in Peer-to-Peer Networks, The 22nd International Conference on Distributed Computing Systems (ICDCS'02), Vienna, Austria, 2002.
Published
Issue
Section
License
ONLINE OPEN ACCES: Acces to full text of each article and each issue are allowed for free in respect of Attribution-NonCommercial 4.0 International (CC BY-NC 4.0.
You are free to:
-Share: copy and redistribute the material in any medium or format;
-Adapt: remix, transform, and build upon the material.
The licensor cannot revoke these freedoms as long as you follow the license terms.
DISCLAIMER: The author(s) of each article appearing in International Journal of Computers Communications & Control is/are solely responsible for the content thereof; the publication of an article shall not constitute or be deemed to constitute any representation by the Editors or Agora University Press that the data presented therein are original, correct or sufficient to support the conclusions reached or that the experiment design or methodology is adequate.
