Physical Location And Interest In Combining P2p Search Technology Research

With the advancement of information technology and the development of internet,there is more and more information resource on line, so how to get valuable information onthe enormous internet becomes an increasingly concerned problem.Latest a few years, peer-to-peer computing(P2P) is one of the hot topic in thecomputer domain.P2P as a rising network computing mode,is self-organized and has goodexpansibility.Fortune magazine call it as one of the four technology which will affect thefuture of internet.One advantage of the P2P technology is to exploit powerful search tools. Comparedwith server-basede search, a search network in allusion to local data based on P2P hasmuch strong suit.For example, it needn't costly server, and it has good search performanceand result.Although there are many P2P application systems, it is still a pivotal problem to forma flexible and extensible information search and discover mechanism in the large-scale,dispersive and distributed P2P system. For example,constructed P2P system(such asChord, CAN) has good expansibility.It organizes the peers to be a constructed overlaybased on distributed hash table(DHT).It assures that it can find the data within definitehops,but it can just make exact suited search according to the key of theresource.Unconstructed P2P system can easily implement complex search,such asmulti-keyword search and partial search,but it send search messages to the neighbor peersby 'flooding',so it has bad expansibility and it cannot insure to find the resource in thesystem.This paper put forword a kind of P2P mode combining the logical interest andphysical location.It overcomes the shortcoming of much spending and bad transmissionperformance caused by long physical distance between two logically adjacent peers.It alsomake use of the comparability between P2P network and human society to improve thesearch speed and veracity.On the base of the mode mentioned above, this paper put forward entering arithmetic,exiting arithmetic, routing arithmetic to implement rapid and exact search.This paper uses JXTA programme to implement correlative function as networkconstruct, search and so on. At last this paper test its performance by experimentation.