A New DHT Supporting Multi-attribute Queries for Grid Information Services

Recent structured Peer-to-Peer (P2P) systems can´t be simply applied to grid information services, because grid resources need to be registered and searched using multiple attributes. This paper proposes a multi-attribute addressable DHT (MAA-DHT) for grid information services. It uses hypercube as its logical graph and provides a new resource placement mechanism based on the values of all attributes, and then supports query based on all attributes and part attributes. The join of a new object and object query operation based on all attributes can be finished within O (log N) hops for N peers. Then, this paper proposes the lookup algorithm based on global index, the corresponding query delay is still O (log N) hops. In particular, in order to maintain the topology, this paper designs a novel stabilization protocol for the MAA-DHT, which also can implement and maintain the global index within O (2 log N) rounds. Furthermore, in order to save storage and query time of the global index, we propose the informed lookup mechanism based on bloom filters, the query based on part attributes still can be finished within O (log N) hops.