Analysis of the expected search cost in skip lists
SWAT '90 Proceedings of the second Scandinavian workshop on Algorithm theory
Lower bounds for monotonic list labeling
SWAT '90 Proceedings of the second Scandinavian workshop on Algorithm theory
The path length of random skip lists
Acta Informatica
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Journal of Algorithms - Special issue on SODA '95 papers
Scheduling multithreaded computations by work stealing
Journal of the ACM (JACM)
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
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A Tight Lower Bound for On-line Monotonic List Labeling
SWAT '94 Proceedings of the 4th Scandinavian Workshop on Algorithm Theory
Skip Lists: A Probabilistic Alternative to Balanced Trees
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
A Sparse Table Implementation of Priority Queues
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Are Virtualized Overlay Networks Too Much of a Good Thing?
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Complex Queries in DHT-based Peer-to-Peer Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Two Simplified Algorithms for Maintaining Order in a List
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Peer-to-peer systems for prefix search
Proceedings of the twenty-second annual symposium on Principles of distributed computing
A DISTRIBUTED DATA-BALANCED DICTIONARY BASED ON THE B-LINK TREE
A DISTRIBUTED DATA-BALANCED DICTIONARY BASED ON THE B-LINK TREE
Simple efficient load balancing algorithms for peer-to-peer systems
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
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
Uncoordinated load balancing and congestion games in p2p systems
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
On de Bruijn Routing in Distributed Hash Tables: There and Back Again
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
Skip-webs: efficient distributed data structures for multi-dimensional data sets
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
The expansion and mixing time of skip graphs with applications
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Decentralized algorithms using both local and random probes for P2P load balancing
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
A case study in building layered DHT applications
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
ASPEN: an adaptive spatial peer-to-peer network
Proceedings of the 13th annual ACM international workshop on Geographic information systems
The rainbow skip graph: a fault-tolerant constant-degree distributed data structure
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Nearest neighbor search in metric spaces through Content-Addressable Networks
Information Processing and Management: an International Journal
Survey of research towards robust peer-to-peer networks: search methods
Computer Networks: The International Journal of Computer and Telecommunications Networking
Using a distributed quadtree index in peer-to-peer networks
The VLDB Journal — The International Journal on Very Large Data Bases
SNet: skip graph based semantic web services discovery
Proceedings of the 2007 ACM symposium on Applied computing
Wildcard Search in Structured Peer-to-Peer Networks
IEEE Transactions on Knowledge and Data Engineering
Nearest neighbor search in metric spaces through Content-Addressable Networks
Information Processing and Management: an International Journal
Range queries over skip tree graphs
Computer Communications
Approaching neighbor proximity and load balance for range query in P2P networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Design and implementation trade-offs for wide-area resource discovery
ACM Transactions on Internet Technology (TOIT)
A skip-list approach for efficiently processing forecasting queries
Proceedings of the VLDB Endowment
Scalable community-driven data sharing in e-science grids
Future Generation Computer Systems
Efficient range queries in spatial databases over Peer-to-Peer Networks
International Journal of Internet Protocol Technology
Distribution fairness in Internet-scale networks
ACM Transactions on Internet Technology (TOIT)
Structured overlay for heterogeneous environments: Design and evaluation of oscar
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Passive/Active Load Balancing with Informed Node Placement in DHTs
IWSOS '09 Proceedings of the 4th IFIP TC 6 International Workshop on Self-Organizing Systems
Peer to peer multidimensional overlays: approximating complex structures
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Oscar: small-world overlay for realistic key distributions
DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
Pampoo: an efficient skip-trie based query processing framework for P2P systems
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
Load balancing for moving object management in a P2P network
DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
Web-Scale Range Queries in a Self-Organized Storage Service
WI-IAT '11 Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 03
Replication, load balancing and efficient range query processing in DHTs
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
RAQ: a range-queriable distributed data structure
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Long range contacts in overlay networks
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Brushwood: distributed trees in peer-to-peer systems
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Scalable distributed indexing and query processing over Linked Data
Web Semantics: Science, Services and Agents on the World Wide Web
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Building a network-aware and load-balanced peer-to-peer system for range queries
Computer Networks: The International Journal of Computer and Telecommunications Networking
Performance Evaluation of Range Queries in Key Value Stores
Journal of Grid Computing
NUMA-aware graph mining techniques for performance and energy efficiency
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
| Hi-index | 0.00 |
We describe a load-balancing mechanism for assigning elements to servers in a distributed data structure that supports range queries. The mechanism ensures both load-balancing with respect to an arbitrary load measure specified by the user and geographical locality, assigning elements with similar keys to the same server. Though our mechanism is specifically designed to improve the performance of skip graphs, it can be adapted to provide deterministic, locality-preserving load-balancing to any distributed data structure that orders machines in a ring or line.