Random walk spread and search in unstructured p2p

Authors:
Zhaoqing Jia;Ruonan Rao;Minglu Li;Jinyuan You
Affiliations:
Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China;Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China;Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China;Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China
Venue:
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
Year:
2004

Citing 2
Cited 0

A random graph model for massive graphs

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Search and replication in unstructured peer-to-peer networks

ICS '02 Proceedings of the 16th international conference on Supercomputing

Quantified Score

Hi-index	0.00

Visualization

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.