SkipMard: a multi-attribute peer-to-peer resource discovery approach

Abstract

Resource discovery technologies for grids and peer-to-peer (P2P) systems share some characteristics. However, some P2P systems such as skip graph cannot simply be applied to grid resource discovery because complex grid resources need to be searched by using multi-attribute queries. This paper proposes a new multi-attribute P2P resource discovery approach (SkipMard) that extends skip graph structure to support multi-attribute queries. SkipMard provides a prefix matching resource routing algorithm to resolve multi-attribute queries, and introduces the concepts of "layer" and "crossing layer nearest neighbor" into the data structure. To decrease message passing numbers, an approximate closest-point method is addressed that can help routing a searching key to a node with a key value that has the minimum distance between two keys. Each node has O(m*l) neighbors for total m layers and I levels in SkipMard. The expected time for a multi-attribute query is O(log N) and the message passing number is O(logN)+O(k).

DOI: 10.1109/IMSCCS.2007.97

Extracted Key Phrases

6 Figures and Tables

Cite this paper

@article{He2007SkipMardAM, title={SkipMard: a multi-attribute peer-to-peer resource discovery approach}, author={Tao He and Jun Ni and Alberto Maria Segre and Shaowen Wang and Boyd M. Knosp}, journal={Second International Multi-Symposiums on Computer and Computational Sciences (IMSCCS 2007)}, year={2007}, pages={266-273} }