Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

An Efficient Search Algorithm without Memory for Peer-to-Peer Cloud Computing Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Naixue Xiong ; Sch. of Inf. Technol., Jiangxi Univ. of Finance & Econ., Nanchang, China ; Yuhua Liu ; Shishun Wu ; Yang, L.T.
more authors

In recent years, as the rapid development of the technology about Peer-to-Peer (P2P) networks and the cloud computing technology, various applications of P2P technology become very widespread in most cloud computing distributed network applications. P2P cloud computing networks are unstructured and are 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, and it is one of the greatest concerns to users. This paper first describes the basic flooding P2P network search method, which is from the analyzing the pros and cons of several new search methods. After that, a cache-based search algorithm is proposed: 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 results show that the algorithm can effectively improve the hit rates of resources searching, and reduce the query delay in cloud computing networks.

Published in:

Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW), 2011 IEEE International Symposium on

Date of Conference:

16-20 May 2011