The efficient and low load range queries in p2p

Authors:
Shui Chao;Zhou Pen; JiaYan;Zhou Bing
Affiliations:
School of Computer, National University of Defense Technology, Changsha, China;School of Computer, National University of Defense Technology, Changsha, China;School of Computer, National University of Defense Technology, Changsha, China;School of Computer, National University of Defense Technology, Changsha, China
Venue:
PRIMA'06 Proceedings of the 9th Pacific Rim international conference on Agent Computing and Multi-Agent Systems
Year:
2006

Citing 8
Cited 0

Scalable, Efficient Range Queries for Grid Information Services

P2P '02 Proceedings of the Second International Conference on Peer-to-Peer Computing
MAAN: A Multi-Attribute Addressable Network for Grid Information Services

GRID '03 Proceedings of the 4th International Workshop on Grid Computing
P-tree: a p2p index for resource discovery applications

Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
Mercury: supporting scalable multi-attribute range queries

Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
A case study in building layered DHT applications

Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Cactus: a new constant-degree and fault tolerate p2p overlay

PRIMA'06 Proceedings of the 9th Pacific Rim international conference on Agent Computing and Multi-Agent Systems
RAQ: a range-queriable distributed data structure

SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.01

Visualization

Abstract

To enable efficient and appropriate uses of the resources in web, it is important to provide range query to keep track of the availability and attributes of millions of service which are geographically distributed. Range query in P2P face a performance tradeoff problem between the efficiency of query and number of message: Optimizing one tends to put pressure on the others. In this paper, a range query algorithm had proposed which lookup for every node in range can be done via O(logN) hops, and number of messages is trend to O(logN)+m-1. We evaluate our system in this paper via a simulation and show that its design along with particular Range-query algorithm meets the goals of efficient query and low message load.