Research About The P2P Hybrid Network Based On Intrest-Group

With the diversification of Internet network, peer network(P2P,Peer to Peer) have emerged as a new and rapidly developing network.Node (Peer)in distributed P2P networks have equal status,and they could interact directly.The performance of the whole network is the sum of all the peers’performance theoretically,and the network scalability is better than the traditional centralized topology.With the increasing scale and users of P2P networks,the application areas of P2P technology are more widely.Thereby the amount of information in network is growing rapidly,and user is more difficulty in searching,locating and obtaining resources. To overcome this issue,information retrieval about P2P network is a critical technology.A good strategy not only improve routing efficiency and increse hit ratio but also save time for users in searching resources.Thus, information retrieval in P2P network is a valuable research direction.Now most studies focus on P2P search technology topic is based on structured P2P networks.Thereby on the basis of previous studies,it propose a P2P hybrid network based on interest groups:IGTAP(Interest-Group Tapestry model).This network theoretical base on Small World,dividing different group according to nodes’intrests.At the same time. Tapestry act as the underlying topology,and it divided into different intrest group.Nodes could join in a intrest group according to its intrest.The distance between nodes could measure with interest similarity.The second layer is the multi-tree structure which is extending by the neighbor mapping table. A multi-tree belongs to one intrest group and every node could only join in one group. The search strategy is divided into group search and inter-group search.Group search refers to nodes searching resources within the intrest group. In case of group search fails or the resources are not in the group,inter-group search would happen.It also introduces the buffer pool strategy in search process,which is a good solution to save the waste of network resources by searching same target in a short time.In the end,the analysis and simulation prove that,the strategy in this article improve the success rate and accuracy rate in query resource,meanwhile shorten the routing hip.