Research of a Novel P2P Search Algorithm Based on Small-World Phenomena

Abstract:

This paper proposes a novel breadth-first search algorithm and deals with the problem of duplicate web pages removing and page ranking by the principle of Small World phenomena. The features of algorithm in this paper are as follows: 1) it proposes the Unit Tree-based Breadth-First Search Algorithm and performs a qualitative analysis and simulated calculation of the performance, with the results demonstrating that the algorithm in this paper reduces the number of neighboring nodes to which messages shall be forwarded and redundant messages as compared with traditional Breath-First Search algorithm and Random Breath-First Search algorithm; 2) it proposes a solution to the problem of duplicate web pages removing and page ranking by Small World phenomena, with the results demonstrating that the method in this paper can effectively bring processing workload, waiting time and the pointless network bandwidth consumption of source node searching into balance.

• Periodical: Advanced Materials Research (Volumes 268-270)
• Pages: 1144-1147
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.268-270.1144
• Online since: July 2011
• Authors: Jing Feng Yan, Shao Hua Tao
• Keywords: Breadth First Search, Peer-to-Peer (P2P), Small-World Phenomena, Unit Tree

References

[1] Annextein FS, Berman KA, Jovanovic MA, et al. Indexing Techniques for File Sharing in Scalable Peer-to-Peer Networks. Proceedings IEEE ICCCN 117-124 (2003).

DOI: 10.1109/icccn.2002.1043038

[2] Harren M, Heller stein JM, Huebsch R, et al. Complex queries indht-based peer-to-peer networks. Proceedings of IPTPS02. Cambridge, USA, 65-72, (2005).

[3] Najork M, Wiener J L. Breadth-first crawling yields high-quality pages. Proceedings of the tenth international conference on World Wide Web ACM Press, 114-118, (2005).

DOI: 10.1145/371920.371965

[4] Q Lv, P Cao, F Cohen, et al. Search and Replication in Unstructured Peer-to-Peer Networks. IEEE CS Press, 254-261, (2008).

[5] D Tsoumakos, N Roussopoulos. Adaptive Probabilistic Search (APS) for Peer-to-Peer Networks. Technical Report CS-TR-4451, Un of Maryland, (2007).

DOI: 10.1109/ptp.2003.1231509

[6] A Crespo, H Garcia-Molina. Routing Indices for Peer-to-Peer Systems. ICDCS, (2006).

[7] Yang B. Improving Search in Peer-to-Peer Networks. Proc. 22nd Int'l Conf. Distributed Computing Systems. (2006).

[8] Watts D.J. The Dynamics of Networks Between Order and Randomness. Princeton Studies in Complexity. Princeton University Press, 2005: 86-89 264, (2006).