Freenet: a distributed anonymous information storage and retrieval system
International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
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
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Replication strategies in unstructured peer-to-peer networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
P-Grid: A Self-Organizing Access Structure for P2P Information Systems
CooplS '01 Proceedings of the 9th International Conference on Cooperative Information Systems
Incrementally improving lookup latency in distributed hash table systems
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Scalable, Efficient Range Queries for Grid Information Services
P2P '02 Proceedings of the Second International Conference on Peer-to-Peer Computing
BRITE: Universal Topology Generation from a User''s Perspective
BRITE: Universal Topology Generation from a User''s Perspective
The impact of DHT routing geometry on resilience and proximity
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Peer-to-peer systems for prefix search
Proceedings of the twenty-second annual symposium on Principles of distributed computing
MAAN: A Multi-Attribute Addressable Network for Grid Information Services
GRID '03 Proceedings of the 4th International Workshop on Grid Computing
A Peer-to-peer Framework for Caching Range Queries
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Simple efficient load balancing algorithms for peer-to-peer systems
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Load balancing and locality in range-queriable data structures
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Brief announcement: prefix hash tree
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Mercury: supporting scalable multi-attribute range queries
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
One torus to rule them all: multi-dimensional queries in P2P systems
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
Querying peer-to-peer networks using P-trees
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
P-ring: an efficient and robust P2P range index structure
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
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
Online balancing of range-partitioned data with applications to peer-to-peer systems
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Range queries on structured overlay networks
Computer Communications
Approaching neighbor proximity and load balance for range query in P2P networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Replica-aware, multi-dimensional range queries in Distributed Hash Tables
Computer Communications
A survey of DHT security techniques
ACM Computing Surveys (CSUR)
A construction of locality-aware overlay network: mOverlay and its performance
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
We present a structured P2P system called Donuts for range queries, which takes two important yet somewhat conflicting issues into account: proximity and load balance. Proximity allows physically close nodes to be arranged near each other in the overlay so as to reduce the cost of neighbor communications that occur quite often in a range-queriable system. Load balance is crucial because object distribution in a semantically meaningful key space is often skewed. Efficient load balance, however, requires flexible node position in the overlay, and thus conflicts with proximity. Donuts resolves the problem by separating physically close nodes into several overlay sections. By dynamically switching between these sections, they help one another balance their loads without altering overlay proximity too much. Still, breaking apart physically close nodes inevitably compromises overlay proximity. Therefore, we have put much effort in the overlay construction to ensure that load balance can be performed effectively and efficiently, with minimal damage to overlay proximity.