Please use this identifier to cite or link to this item:
Title: Efficient range queries and fast lookup services for scalable P2P networks
Authors: Liau, C.Y. 
Ng, W.S.
Shu, Y. 
Tan, K.-L. 
Bressan, S. 
Issue Date: 2005
Citation: Liau, C.Y.,Ng, W.S.,Shu, Y.,Tan, K.-L.,Bressan, S. (2005). Efficient range queries and fast lookup services for scalable P2P networks. Lecture Notes in Computer Science 3367 : 93-106. ScholarBank@NUS Repository.
Abstract: In this paper we propose a Peer-To-Peer (P2P) architecture using a tree based indexing scheme which allows for efficient lookup and range query services on documents in the network. We also present a basic load balancing technique by assigning a new node that joins the network to a heavily loaded area to take on some of load of its peers. Given a query, we need to search only a small number of nodes to locate matching documents hence making the architecture scalable. We also take into account the fact that nodes in a P2P environment need not have the same capability. We implemented a simulator and performed experiments to study to the performance of our proposed architecture. The results show that our proposed architecture is scalable and highly efficient when handling range queries. © Springer-Verlag Berlin Heidelberg 2005.
Source Title: Lecture Notes in Computer Science
ISSN: 03029743
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Aug 10, 2019

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.