LQPD: An efficient long query path driven replication strategy in unstructured P2P network

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 LQPDis presented. In LQPD, file replication operation is triggered only when the length of query path exceeds user-acceptable delay. Experimental results show LQPDcan get better performance than other strategies with the same number of file replicas in a Gnutella-like overlay network. © Springer-Verlag Berlin Heidelberg 2005.