The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
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
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
Collecting and Modeling the Join/Leave Behavior of Multicast Group Members in the MBone
HPDC '96 Proceedings of the 5th IEEE International Symposium on High Performance Distributed Computing
Application-Layer Multicasting with Delaunay Triangulation Overlays
Application-Layer Multicasting with Delaunay Triangulation Overlays
LAND: stretch (1 + ε) locality-aware networks for DHTs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
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
Mercury: supporting scalable multi-attribute range queries
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Araneola: A Scalable Reliable Multicast System for Dynamic Environments
NCA '04 Proceedings of the Network Computing and Applications, Third IEEE International Symposium
GeoPeer: A Location-Aware Peer-to-Peer System
NCA '04 Proceedings of the Network Computing and Applications, Third IEEE International Symposium
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
Symphony: distributed hashing in a small world
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
HDOV: an overlay network for wide area spatial data collection
Proceedings of the 2011 ACM Symposium on Applied Computing
| Hi-index | 0.00 |
In this paper we present and evaluate a novel mechanism, called Hop Level, that creates and maintains long range contacts (LRCs) in overlay networks. The Hop Level mechanism owns the following characteristics: i) lazy creation of the LRCs, ii) support for unbalanced node distribution, iii) support for multidimensional spaces and iv) near-optimal path lenght/node degree trade-off. These characteristics make Hop Level specially suited for overlay networks that support range data queries (as opposed to distributed hash tables that only support exact queries) with one or more dimensions. Furthermore, and unlike previous similar work, Hop Level can handle churn very well, because it postpones creation of the LRCs until it is necessary. In this way, nodes that have short lives do not overload the network with their state update requests.