Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
Replication strategies in unstructured peer-to-peer networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
King: estimating latency between arbitrary internet end hosts
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Complex Queries in DHT-based Peer-to-Peer Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Scalable, Efficient Range Queries for Grid Information Services
P2P '02 Proceedings of the Second International Conference on Peer-to-Peer Computing
Routing Indices For Peer-to-Peer Systems
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Improving Search in Peer-to-Peer Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Tracing a Large-Scale Peer to Peer System: An Hour in the Life of Gnutella
CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
Data Indexing in Peer-to-Peer DHT Networks
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
A Peer-to-peer Framework for Caching Range Queries
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Mercury: supporting scalable multi-attribute range queries
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
An Adaptive Protocol for Efficient Support of Range Queries in DHT-Based Systems
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
Bringing Efficient Advanced Queries to Distributed Hash Tables
LCN '04 Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks
Supporting ranked search in parallel search cluster networks
Proceedings of the 14th ACM international conference on Information and knowledge management
SIL: a model for analyzing scalable peer-to-peer search networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Survey of research towards robust peer-to-peer networks: search methods
Computer Networks: The International Journal of Computer and Telecommunications Networking
Novel approaches to efficient flooding search in peer-to-peer networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
SkipNet: a scalable overlay network with practical locality properties
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Bubblestorm: resilient, probabilistic, and exhaustive peer-to-peer search
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Querying the internet with PIER
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
| Hi-index | 0.00 |
While structured peer-to-peer systems are efficient in terms of overhead, they still lack the unstructured system's flexibility and ability to support a wide range of complex queries. This paper examines systems supporting complex queries, deterministic operation, and a fair load distribution between nodes. The aim is to minimize the bandwidth and node load using an optimal level of indexing. The paper first theoretically examines the optimal balance of search and index messages using a search/index space model. This balance is fundamentally determined by the frequency of search requests and index updates. Based on this study, the paper proposes a novel loosely structured peer-to-peer system, Zone indexing, that can balance between index update traffic and search traffic in order to minimize the bandwidth overhead. Nodes are organized into a ring structure. The ring is divided into overlapping zones, within which index updates are distributed. We present an overlay maintenance algorithm with low-cost join and leave operations and a high churn resistance. We further propose a method to dynamically adjust the zone size in order to maintain optimal performance when the network size or user behavior changes. Additionally, we propose a method to limit the search delay by introducing parallel searching. The proposed solutions are evaluated mathematically and the analysis is verified with simulation.