Study Of A Searching Model On P2P Network Based On A Data-transfer-tree

By virtue of its great efficiency and graceful architecture, the Client/Server model has been prevalent for more than twenty years. As the rapid expandse of Internet scale, some disadvantages are also recognized in Client/Server model. Especially, the service bottleneck of Client/Server model will become more and more severe in such networking environment. Some approaches have been proposed to solve such kind of disadvantages. Among these approaches, the distributed computing is considered an important candidate for Client/Server model.As one of special distributed computing, the Peer-to-Peer (P2P) computing doesn't the central Server and employs interactive communication directly between two peers. It is possibal for us to solve service bottleneck because of the feature of free of central controlling in P2P model. Now the P2P computing technology and application are gradually becoming the focus of Network research region.Because there is no centralized control node in P2P network, how to find the resourse and transfer the message package is the basic question for the P2P computing. A primary limitation for the flooding routing using in the first generation P2P is lacking the ability of guiding the message package in the full range, which easily causes the"circle routing"and waste of networking resources. So the flooding routing is only suitable for small-scale application. Likewise, the rigorous architecture and no consideration about specific semantic requirement of application of the Distributed Hash Table (DHT) routing drop the shadow on the second generation P2P, which relies on the DHT. The second generation P2P is also limited to particular application area.In this article, I propose a searching model on P2P network based on a Data-transfer-tree. The theory is simple: firstly using the"Small-World theory"in a real network environment and the strategy of application-layer-multicast, we carve all nodes up many clusters possessing the attribute of assemble effection. Then we create a virtual Overlay Network using a recursion method. At last we transmit the message package in a Data-transfer-tree that derives from the Overlay Network. In this searching model the"circle routing"is avoided entirely and the resource is found efficiently, which make it possibal to deploy the P2P application in a huge scale. As supplying a stability support for the P2P application, this searching model shows extraordinary value both on the academic region and application region.