Font Size: a A A

Research And Implementation Of P2P Resource Search Strategy Based On JXTA

Posted on:2009-10-15Degree:MasterType:Thesis
Country:ChinaCandidate:X L WangFull Text:PDF
GTID:2178360272470324Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
As the information amount rises rapidly with the intense increment of both users' quantity and network's scale, Peer-to-Peer (P2P) is regularly coming into people's lives and industry. This kind of increment has caused a serious problem, difficulty in searching, locating and retrieving resource. To conquer this problem, information retrieval in P2P network is a pivotal technique. A good strategy not only increases hit ratio, but also serves users in studying relevant information to improve the performance in later search process. The ability to decrease node load and network cost is another goal for a good search algorithm.In this paper, we study the available JXTA resource search mechanism and then analyze its advantages and limitations. JXTA is a two-dimension network. The upper layer assembly peers use loosely consistent DHT algorithm, within a limited set point walking view. The lower nodes use broadcasting means. Compared with traditional unstructured one-dimension planar network, one important improvement is an advertisement inquiry no longer spreading to the edge nodes. Only assembly points in advertising inquiries are involved in the transmission. However, it is still a partial view of the overall lack of effective search algorithm.Combining with the limitations of resource search mechanism in JXTA network, we put forward an improved resource search strategy based on JXTA. Leaving lower routing mechanism unchanged, every rendezvous peer in the upper layer has a subject, and the Rendezvous Peer View (RPV) used in the process is split into two parts, target table(TAR) and subject table(SUB). The contents of the two tables are the key of the resources and the relevant PeerID, and all of the keys are centered on the subject owned by the rendezvous peer. So, in the process of searching, every rendezvous peer can choose the next hop purposefully rather than randomly so as to optimize the search process. Besides, the splitting of the RPV can help maintain consistency of the whole network.Finally, we implement a simple cooperation office system using the improved resource search strategy based on JXTA, which is mainly composed of three modules, instant communication, file-sharing and electronic white board.
Keywords/Search Tags:P2P, JXTA, Resource Search, Subject, RPV
PDF Full Text Request
Related items