LQPD: an efficient long query path driven replication strategy in unstructured p2p network

  • Authors:
  • Xicheng Lu;Qianbing Zheng;Peidong Zhu;Wei Peng

  • Affiliations:
  • School of Computer Science, National University of Defense Technology, Changsha, P.R.China;School of Computer Science, National University of Defense Technology, Changsha, P.R.China;School of Computer Science, National University of Defense Technology, Changsha, P.R.China;School of Computer Science, National University of Defense Technology, Changsha, P.R.China

  • Venue:
  • ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
  • Year:
  • 2005

Quantified Score

Hi-index 0.01

Visualization

Abstract

Random walks is an excellent search mechanism in unstructured P2P network. However, it generates long delay and makes some resources indiscoverable, especially for uncommon files. File replication strategy can improve the performance of random walks. But it has high overhead. An efficient replication strategy LQPD is presented. In LQPD, file replication operation is triggered only when the length of query path exceeds user-acceptable delay. Experimental results show LQPD can get better performance than other strategies with the same number of file replicas in a Gnutella-like overlay network.