Grid Resource Search Model Based On P2p-hierarchical Chord

Grid's rising has brought a new revolution of the Internet. As while as traditional Internet has realized connection of computer hardware and web technique has realized connection between web pages and network resources by handwork, grid technique intends to realize totally connectivity of resources which can be found on the internet such as computering resources, storing resources, communicating resources, software resources, information resources, knowledge resources and so on. Grid computing has the characteristic of distributed, dynamic, heterogeneous, extensible, self-organizing. Unified standard has been designed on the grid, so it has extended developing future. At the same time, as a new network technique, peer to peer (p2p) shares the same goal to fully utilize and halve the distributed resources in the network.Finding resources of grid is a research hotspot all the time. Existing projects have provided themselves solving methods, but they have shortcomings of theirselves that need to amending. In the thesis the Chord model has been studied, it is a typical arithmetic of the fully distributed structured p2p network, and has also all-sided summarized its construction process and research arithmetic and analyzed its performance, advantage and disadvantage. On the foundation of above work, some improvement thought of the Chord model is summarized, and then the capability of improved arithmetic in comparison with the original Chord is analyzedIn the thesis, a hierarchical Chord model was proposed, which carves up resources of grid between domains and areas, and uses consistent hashing function hash data resources to different identifiers which has information about which domains the resource data is belong to and where is the data resource. The research way of hierarchical Chord, improving on the search way of Chord, arrives at goal of decreasing the time of query response, at least reaching Chord's speed, and also decreases physics routing length in the real network and communicating cost, which is meaningful in the factual application especially in the case of that it is very limited of the network bandwidth.Finally, search capability between the improved Chord arithmetic and original Chord arithmetic is compared in the experiments and hierarchical Chord's search capability on the aspect of average query time and average physical route length in comparison with the original Chord is also analyzed.