DMCA
DelayBounded Range Queries in DHT-based Peer-to-Peer Systems (2006)
| Venue: | In 26th IEEE International Conference on Distributed Computing Systems (ICDCS |
| Citations: | 8 - 0 self |
BibTeX
@INPROCEEDINGS{Li06delayboundedrange,
author = {Dongsheng Li and Jiannong Cao and Xicheng Lu and Keith C. C. Chan and Baosheng Wang and Jinshu Su},
title = {DelayBounded Range Queries in DHT-based Peer-to-Peer Systems},
booktitle = {In 26th IEEE International Conference on Distributed Computing Systems (ICDCS},
year = {2006},
pages = {64}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Many general range query schemes for DHT-based peer-to-peer (P2P) systems have been proposed, which do not need to modify the underlying DHTs. However, most existing works have the query delay depending on both the scale of the system and the size of the query space or the specific query, and thus cannot guarantee to return the query results in a bounded delay. In this paper, we propose Armada, an efficient general range query scheme to support single-attribute and multiple-attribute range queries. Armada is the first delay-bounded range query scheme over constant-degree DHTs, and can return the results for any range query within 2logN hops in a P2P system with N peers. Results of analysis and simulations show that the average delay of Armada is less than logN, and the average message cost of single-attribute range queries is about logN+2ní2 (n is the number of peers that intersect with the query). These results are very close to the lower bounds on delay and message cost of range queries over constant-degree DHTs. 1.
Keyphrases
range query dht-based peer-to-peer system constant-degree dhts efficient general range query scheme average message cost bounded delay many general range query scheme p2p system specific query query space single-attribute range query query delay message cost average delay query result multiple-attribute range query dht-based peer-to-peer underlying dhts first delay-bounded range query scheme
