Analysis of search and replication in unstructured peer-to-peer networks

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Analysis of search and replication in unstructured peer-to-peer networks

Full text

Pdf (140 KB)

Source

Joint International Conference on Measurement and Modeling of Computer Systems archive
Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems table of contents

Banff, Alberta, Canada

POSTER SESSION: Posters table of contents

Pages: 404 - 405

Year of Publication: 2005

ISBN:1-59593-022-1

Also published in ...

Authors

Saurabh Tewari	University of California at Los Angeles, Los Angeles, CA
Leonard Kleinrock	University of California at Los Angeles, Los Angeles, CA

Sponsors

ACM: Association for Computing Machinery
SIGMETRICS: ACM Special Interest Group on Measurement and Evaluation

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 62, Citation Count: 4

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1064212.1064276 What is a DOI?

ABSTRACT

This paper investigates the effect of the number of file replicas on search performance in unstructured peer-to-peer networks. We observe that for a search network with a random graph topology where file replicas are uniformly distributed, the hop distance to a replica of a file is logarithmic in the number of replicas. Using this observation we show that flooding-based search is optimized when the number of replicas is proportional to the file request rates. This replica distribution is also optimal for download time and since flooding has logarithmically better search time than random walk under its optimal replica distribution, we investigate the query-processing load using this distribution.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Edith Cohen , Scott Shenker, Replication strategies in unstructured peer-to-peer networks, Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications, August 19-23, 2002, Pittsburgh, Pennsylvania, USA
	2	Alexander Klemm , Christoph Lindemann , Mary K. Vernon , Oliver P. Waldhorst, Characterizing the query behavior in peer-to-peer file sharing systems, Proceedings of the 4th ACM SIGCOMM conference on Internet measurement, October 25-27, 2004, Taormina, Sicily, Italy [doi>10.1145/1028788.1028796]
	3	Tewari, S., Kleinrock, L. "On Fairness, Optimal Download Performance and Proportional Replication in Peer-to-Peer Networks," to appear in Proc. of IFIP Networking, May 2005.
	4	Tewari, S., Kleinrock, L. "Search and Replication in Unstructured Peer-to-Peer Networks," UCLA Computer Science Dept Technical Report UCLA-CSD-TR050006, March 2005.

CITED BY 4

	Stratis Ioannidis , Peter Marbach, On the design of hybrid peer-to-peer systems, ACM SIGMETRICS Performance Evaluation Review, v.36 n.1, June 2008
	Bin Wu , Ajay D. Kshemkalyani, Modeling message propagation in random graph networks, Computer Communications, v.31 n.17, p.4138-4148, November, 2008
	Haiying Shen , Yingwu Zhu, A proactive low-overhead file replication scheme for structured P2P content delivery networks, Journal of Parallel and Distributed Computing, v.69 n.5, p.429-440, May, 2009
	Amos Brocco , Apostolos Malatras , Béat Hirsbrunner, Proactive information caching for efficient resource discovery in a self-structured grid, Proceedings of the 2009 workshop on Bio-inspired algorithms for distributed systems, June 19-19, 2009, Barcelona, Spain