Evaluating Strategies for Resource Finding in a Peer-to-Peer Grid

This paper presents some experimental results on the evaluation of a resource finding algorithm for a peer-to- peer grid. The algorithm, which is based on "spatial computing" concepts, models a grid as a P2P overlay network, on which resources are obtained by a suitable navigation strategy that forwards a request from node to node, until one is found offering the desired amount of resources. The algorithm is experimentally evaluated by means of a software simulator, and fully characterised by assessing the performances afforded by different navigation strategies and the influence of several parameters, such as the number of nodes, their workload, the origin (node) of the resource request, etc.