Pastry Network Model Network

P2P (Peer-to-Peer) is one kind of distributed calculation model, which realizes sharing of resource and service through exchanging among nodes directly. P2P includes unstructured P2P, structured P2P and relaxed structured P2P. In unstructured P2P and relaxed structured P2P, nodes connect each other at random, which leads to data query to be finished depending on flooding, results in high cost in the network and low scalability. So structured P2P with high scalability becomes a hotspot of research now.But communication efficiency and utilize rate of bandwidth, among current structured P2P routing algorithms, are not high, and it spends every node high cost storing route table and other items, and every node has heavy burden. In order to resolve these problems, the thesis presents SmartPa, basing on research before. The algorithm combines pastry and full-joined structured overlay network algorithm. It makes use of usable bandwidth of every node, can be deployed in any environments, not matter what the system size is, how dynamic the nodes are, and what the node-capacity distribution is like. It ensures route efficiency though dynamic adjustment, and can be use in all kinds of wide area distributed system. Through experiments, we can see that SmartPa makes that communication efficiency among nodes in the network and utilize rate of bandwidth are higher than other algorithms, and it has low node cost.