Abstract
Peer-to-Peer (P2P) network is an important component to implement next generation Internet, how to quickly and efficiently search the resources in P2P networks has become one of the most critical issues, at the same time, this is one of greatest concern to users. This paper describes the basic Flooding Peer-to-Peer network search method, followed by analysis of several new search methods pros and cons, and then further analysis of these algorithms is proposed based on a cache-based search algorithm: When a node of the remaining load capacity is high, it will become the center node, and form a joint topology area with the nearby nodes together, then the center node and ordinary nodes also need to store the index cache, at the local region the overheating resources will be copied to the local (that is, the contents cache). The simulation shows that the algorithm can effectively improve the hit rates of resources searching, reduce the query delay.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Albert R., Barabási A. L. (1999) Emergence of scaling in random networks. Science 286: 509–512
Jan, S., Jim, D., Raymond, C., & Rene, M. (2006). Using aggregation for adaptive super-peer discovery on the gradient topology. In A. Keller & J.-P. Martin-Flatin (Eds.), SelfMan, ser. Lecture Notes in Computer Science (vol. 3996). Springer.
Li N., Sun J. et al (2008) The load balancing algorithm based on network positioning in structured P2P system. Computer Applications Research 25(8): 2524–2527
Liu Y., Xiong N., Zhu L., Gao J. (2010) An effective simulation method for search strategy in unstuctured P2P network. Simulation Modelling Practice and Theory 18(4): 456–469
Lv, Q., Cao, P., Cohen, F., et al. (2002). Search and replication in unstructured peer-to-peer networks. ICS.
Sandakly F., Garcia J., Ferreira P., Poyet P. (2001) Distributed shared memory infrastructure for virtual enterprise in building and construction. Intelligent Manufacturing 12: 199–212
Saroiu, S., Gummadi, P. K., & Gribble S. D. (2002). A measurement study of peer-to-peer file sharing systems. In Proceedings of multimedia computing and networking.
Stefan, S., & Gummadi, P. K. (2002). An analysis of internet content delivery systems.
Stoiea, I., Morris, R., Karger, D., et a1. (2001). Chord:A scalable peer-to-peer lookup service for Internet applicationss. In Proceedings of the 2001 ACM SIGCOMM (pp. 149–160). New York: ACM Press (2001).
Tsoumakos, D., et al. (2002). A comparison of peer-to-peer search methods. WebDB.
Wu, S., Liu, Y., & Xu, K. (2010). The topology optimization of controlling Hubs in P2P networks. In The 2010 international conference on future computer and communication (ICFCC 2010) (pp. V3-783–V3-786). Wuhan: IEEE Computer Society (2010).
Xing L.-N., Chen Y.-W., Yang K.-W. (2009) An efficient search method for multi-objective flexible job shop scheduling problems. Journal of Intelligent Manufacturing 20: 283–293
Xhafa, F., Sanchez, C., & Barolli, L. (2010). Local search methods for efficient router nodes placement in wireless mesh networks. Journal of Intelligent Manufacturing doi:10.1007/s10845-010-0412-5.
Yang, B., & Garcia-Molina, H. (2003). Designing a super-peer network. In Proceedings of the the 19th international conference data engineering (ICDE 2003) (pp. 49–60). Bangalore.
Zhou S., Qin Z., Liu J. (2003) Analysis of peer computing. Computer Applications 23(10): 1–2
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was supported by the natural science foundation of china (Grant No.60673163).
Rights and permissions
About this article
Cite this article
Liu, Y., Wu, S., Xiong, N. et al. A cache-based search algorithm in unstructured P2P networks. J Intell Manuf 23, 2101–2107 (2012). https://doi.org/10.1007/s10845-011-0603-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10845-011-0603-8