Probabilistic Proximity-aware Resource Location in Peer-to-Peer Networks Using Resource Replication

Morteza Analoui, Mohsen Sharifi, Mohammad Hossein Rezvani


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.


Distributed systems, Peer-to-Peer network, Content Distribution, Resource Location, Performance Evaluation

Full Text:



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

S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, A Scalable Content Addressable Network, Proc. ACM Sigcomm, August 2001.

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.

D.A. Menascé, L. Kanchanapalli, Probabilistic Scalable P2P Resource Location Services, ACM Sigmetrics Performance Evaluation Rev., Volume 30, No. 2, pp. 48-58, 2002.

D. Menascé, Scalable P2P Search, IEEE Internet Computing, Volume 7, No. 2, March/April 2003.

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.

G.P. Jesi, A. Montresor, O. Babaoglu, Proximity-Aware Superpeer Overlay Topologies, IEEE Transactions on Network and Service Management, September 2007.

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.

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.


Copyright (c) 2017 Morteza Analoui, Mohsen Sharifi, Mohammad Hossein Rezvani

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

IJCCC is an Open Access Journal : CC-BY-NC.

Articles published in IJCCC user license are protected by copyright.

Users can access, download, copy, translate the IJCCC articles for non-commercial purposes provided that users, but cannot redistribute, display or adapt:

  • Cite the article using an appropriate bibliographic citation: author(s), article title, journal, volume, issue, page numbers, year of publication, DOI, and the link to the definitive published version on IJCCC website;
  • Maintain the integrity of the IJCCC article;
  • Retain the copyright notices and links to these terms and conditions so it is clear to other users what can and what cannot be done with the  article;
  • Ensure that, for any content in the IJCCC article that is identified as belonging to a third party, any re-use complies with the copyright policies of that third party;
  • Any translations must prominently display the statement: "This is an unofficial translation of an article that appeared in IJCCC. Agora University  has not endorsed this translation."

This is a non commercial license where the use of published articles for commercial purposes is forbiden. 

Commercial purposes include: 

  • Copying or downloading IJCCC articles, or linking to such postings, for further redistribution, sale or licensing, for a fee;
  • Copying, downloading or posting by a site or service that incorporates advertising with such content;
  • The inclusion or incorporation of article content in other works or services (other than normal quotations with an appropriate citation) that is then available for sale or licensing, for a fee;
  • Use of IJCCC articles or article content (other than normal quotations with appropriate citation) by for-profit organizations for promotional purposes, whether for a fee or otherwise;
  • Use for the purposes of monetary reward by means of sale, resale, license, loan, transfer or other form of commercial exploitation;

    The licensor cannot revoke these freedoms as long as you follow the license terms.

[End of CC-BY-NC  License for Website User]

INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL (IJCCC), With Emphasis on the Integration of Three Technologies (C & C & C),  ISSN 1841-9836.

IJCCC was founded in 2006,  at Agora University, by  Ioan DZITAC (Editor-in-Chief),  Florin Gheorghe FILIP (Editor-in-Chief), and  Misu-Jan MANOLESCU (Managing Editor).

Ethics: This journal is a member of, and subscribes to the principles of, the Committee on Publication Ethics (COPE).

Ioan  DZITAC (Editor-in-Chief) at COPE European Seminar, Bruxelles, 2015:

IJCCC is covered/indexed/abstracted in Science Citation Index Expanded (since vol.1(S),  2006); JCR2018: IF=1.585..

IJCCC is indexed in Scopus from 2008 (CiteScore2018 = 1.56):

Nomination by Elsevier for Journal Excellence Award Romania 2015 (SNIP2014 = 1.029): Elsevier/ Scopus

IJCCC was nominated by Elsevier for Journal Excellence Award - "Scopus Awards Romania 2015" (SNIP2014 = 1.029).

IJCCC is in Top 3 of 157 Romanian journals indexed by Scopus (in all fields) and No.1 in Computer Science field by Elsevier/ Scopus.


 Impact Factor in JCR2018 (Clarivate Analytics/SCI Expanded/ISI Web of Science): IF=1.585 (Q3). Scopus: CiteScore2018=1.56 (Q2);

SCImago Journal & Country Rank

Editors-in-Chief: Ioan DZITAC & Florin Gheorghe FILIP.