The P2P Network Model Based On Neighboring Node And Interest Grouping

P2P as a new network compute mode,is self-organized and has good Expansibility.P2P technology is also a popular reaching point in the international IT area and it was honored as one of the four new technologies which will change the world of the internet.In P2P network a node is both a server and a client which makes greater use of the network idle resource.But the information amount rises rapidly with the intense increment of both users' quantity and network's scale,and caused a serious problem in searching,locating and retrieving resource.On this,this paper do an in-depth analysis and research,which mainly include the following work.1.We presented a new P2P network model named NIP2P(Neighboring Node and Interest Grouping P2P) which based on the Gnutella protocol and decentralized unstructured topology in this paper.NIP2P is a P2P model which combining the interest grouping and physical Location.It divided the P2P network into many groups according to the standard of user's interest.There is a central node to be responsible for the management of the group.And then in the interest grouping,search for each node's Physical neighboring nodes.Neighboring nodes overcomes the shortcoming of much spending and bad transmission performance caused by long physical distance between two logically adjacent peers.2.The group inside search and the across group search composed the search strategy of the NIP2P,and the group inside search is the main search strategy.For the purpose of reducing the harm for the network by single point failure,we put forward Standby Central Node strategy.And NIP2P improves Cache strategies,which not only enhance searching speed rate and successful rate,but also does good job to the network's stability. Model analysis and simulation prove that,the interest-based search mechanism is more efficient than the traditional search method in Gnutella-like system.Besides, NIP2P can decrease node load and network cost。...