Scalable Self-Configuring Resource Search in Hypercubes

Nowadays, the Grid and P2P is the focus of multiple researches. Our work is centered on Resource Search Algorithms as it is an opened and actual research area. In this work, we propose a scheme that presents essential characteristics for self-configuring search and is able to handle dynamic resources, such as memory capacity. Our approach consists on a hypercube topology connecting the nodes and a scalable and self-configuring search procedure. The algorithm improves the probability of reaching the alive nodes even in the presence of non-alive ones (inaccessible, crashed or heavy loaded nodes). In this paper, we show some results obtained by simulation running our search protocol (Algorithm-H). At network level, we used the topologies created by BRITE and at application one, we implemented our overlay, HGrid, and performs searches using Algorithm-H.