An efficient grid resource discovery mechanism based on tree structure

The computational systems of the grid make a way in which different heterogeneous resources distributed geographically are connected in a virtual processing environment. The resource discovery is so critical in such environments. In recent years, authors have proposed different methods in the resource discovery in the grid. Recent methods have tried to decrease the discovery and update costs. Some were successful in lowering the discovery cost and some the updating cost. In this paper, any nodes of the grid take a format as a catalogue. In this form to any attribute of the resource allocated a unique code. These codes are transferred among nodes for the updating and discovery that have low volumes. Contrary to the previous methods, here is presented a method which is of low-cost in terms of both the discovery and the updating. The results show that the traffic and number of visited nodes in our resource discovery algorithm is less than other algorithms.