THE DISTRIBUTED SPANNING-TREE BASED SERVICE DISCOVERY IN GRID ENVIRONMENT
With the dynamic and heterogeneous characteristics of resources in grid environment, efficient service discovery becomes a challenging issue. In this paper, we propose a service discovery approach based on the distributed spanning-tree architecture. According to this architecture, we arrange the grid resources in such a hierarchical way as IS layer, Institution layer, Organization layer and Domain layer in turn. Any member at the same layer is equivalent. Only IS layer and Institution layer have real resource entities while other layers over them are overlays to cluster the resource information onto their own Delegation Nodes (DN). These DNs have the Resource Index and can locate the query route.Hence, query message traffic is sharply decreased depending on the DNs locating of query routes. Every Institution in grid owns a global unique ID according to the coding mechanism.Based on this, the parallel searching process can be synchronously implemented among peer nodes, which improves the efficiency dramatically. Caching and Collaboration Units techniques are adopted to increase the efficienry of service discovery. The DN can be replaced by the new elected one when it fails which ensures the survivability of the system. Performance evaluation shows that our approach achieves a good efficiency, scalability, survivability and adaptability.
Distributed spanning-tree Delegation node Election algorithm Parallel searching Survivability
XIAO-HUA SONG YUAN-DA CAO HE-QING HUANG
School of Computer Science and Technology, Beijing Institute of Technology, Beijing 100081, China
国际会议
2006 International Conference on Machine Learning and Cybernetics(IEEE第五届机器学习与控制论坛)
大连
英文
2379-2386
2006-08-13（万方平台首次上网日期，不代表论文的发表时间）