Research On Routing Algorithm Of P2P Based-on Overlay Network

Application of P2P(Peer-to-Peer)network has developed rapidly in recent years. Resource sharing system is an important application of P2P. The performance of such system depends on the kernel problems of P2P: how to locate the needed resource effectively, that is, routing algorithm.P2P overlay network offers a novel platform for a variety of scalable and decentralized, distributed applications. In a structured P2P network, the only relation between physical layer and overlay network is DHT and nodes do not contain any information about their physical location. Such P2P overlay network does not take into account physical network topology and results in high routing latency and low efficiency. Focusing on improving routing enhancement, the thesis conducts an in-depth research on how to extract topology information and how to utilize the information to construct topology-aware P2P systems. The thesis proposes the solution exploiting the network topology and proves the solution can greatly improve routing efficiency in Chord.JXTA is a platform proposed by Sun to construct P2P environment, and provides a simple, small and flexible mechanics to realize P2P computing at any platform, any place and any time. However, with the increase of network nodes and enlargement of network scale, its "flooding" routing algorithm leads to rapid augmentation of network flow, and results in the low latency. The thesis finds out that employing rendezvous peer view is the reason of that, and proposes the solution to introduce the DHT into JXTA. The design and implementation of the solution are given at last.