Research Of Resource Search Based On Peer-to-Peer Network

Internet has become the broadest information resource,every Internet user may query the information what he want to know. With the flying development of network,P2P gets extensively applied in document sharing, resources searching,and so on.Routing mechanism is becoming an important aspect that measures the P2P system performance.P2P systems have hundreds of thousands of peers that involve frequent dynamic activities,thus resulting in high maintenance overhead. In this paper,we present state cache mechanism, called SCM, that solves the problem by exploiting the access patterns of dynamic activities in P2P systems.SCS partitions the whole P2P network into clusters and dynamically chooses a"super"node in each cluster to selectively record and maintain the routing information for departed nodes most likely to arrive back in the near future. The cached routing information enables SCS to simplify self-organization, reduce system maintenance overhead and provide high quality routing service.The simulation has validated that the application of SCM has improved P2P system's performance.