LAND: Stretch (1 + ε) Locality-Aware Networks for DHTs
نویسندگان
چکیده
This paper proposes the first peer-to-peer network and lookup algorithm that for any 0 < ε has worst case stretch bounded by 1+ ε. The construction uses an expected logarithmic number of links. It is suitable for a very realistic class of metrics in which the only restriction on density is a growth-bound. It is completely decentralized and readily deployable in dynamic networks.
منابع مشابه
Locality-Aware Randomized Load-Balancing Algorithms in Structured Peer-to-Peer Networks
This paper presents a locality-aware randomized load-balancing algorithm to deal with both the proximity and network churn at the same time. A factor of randomness in the probing of lightly loaded nodes in a range of proximity is introduced. Further the efficiency by allowing the probing of multiple candidates (d-way) at a time is improved. Simulation results show the superiority of the localit...
متن کامل3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs
Categorizing peer-to-peer networks from an algorithmic point of view the two extremes of the spectrum are unstructured networks and networks based on plain distributed hash tables (DHT). Unstructured networks stand out with their simplicity, robustness, and support for complex queries. Though, they lack efficient query algorithms providing guarantees. On the other hand, DHT based networks featu...
متن کاملMesh-dht Approach for Efficient Resource Sharing in P2p Based Wireless Mesh Network
Wireless Mesh Networks (WMN) is a popular communication paradigm due to its low cost and rapid deployment. A large-scale WMN needs a look-up structure to support storage, client mobility and generic services. A Distributed Hash Table (DHTs) spreads construction and maintenance load of abstract index infrastructure over participating nodes, providing simple data access interface. The existing Lo...
متن کاملAn IP address based caching scheme for peer-to-peer networks
Distributed hash tables (DHTs), used in a number of current peer-to-peer systems, provide efficient mechanisms for resource location. Systems such as Chord, Pastry, CAN, and Tapestry provide strong guarantees that queries in the overlay network can be resolved in a bounded number of overlay hops, while preserving load balance among the peers. A key distinction in these systems is the way they h...
متن کاملLAND: Locality Aware Networks for Distributed Hash Tables
This paper proposes the first peer-to-peer network and lookup algorithm that has worst case constant distortion. The construction uses a constant expected number of links. The design lends itself to dynamic deployment, and has a simple and easy to verify proof. The construction embraces the two-tier architecture of current peer-to-peer networks, where stronger and stable nodes serve as ultra-pe...
متن کامل