Random walk spread and search in unstructured P2P

4Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Unstructured Peer-to-Peer applications are very popular on the Internet. An efficient technique for improving performance of search method of these systems is to replicate file location information in P2P. In this paper we present random walk spread mechanism, and random walk spread and search method. Simulation results show that it achieves high success rates at low cost.

Cite

CITATION STYLE

APA

Jia, Z., Rao, R., Li, M., & You, J. (2004). Random walk spread and search in unstructured P2P. In Lecture Notes in Computer Science (Vol. 3320, pp. 768–771). Springer Verlag. https://doi.org/10.1007/978-3-540-30501-9_150

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free