Accessing nearby copies of replicated objects in a distributed environment
From MaRDI portal
Publication:1293914
DOI10.1007/s002240000118zbMath0929.68126OpenAlexW4376585699MaRDI QIDQ1293914
Rajmohan Rajaraman, C. Greg Plaxton, Andréa W. Richa
Publication date: 25 January 2000
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002240000118
Related Items (24)
D2B: A de Bruijn based content-addressable network ⋮ Load balanced distributed directories ⋮ Survey of DHT topology construction techniques in virtual computing environments ⋮ Transmission and navigation on disordered lattice networks, directed spanning forests and Brownian web ⋮ Topological implications of selfish neighbor selection in unstructured peer-to-peer networks ⋮ Concurrent maintenance of rings ⋮ Distance estimation and object location via rings of neighbors ⋮ Distributed transactional memory for metric-space networks ⋮ HyperTree for self-stabilizing peer-to-peer systems ⋮ Dynamic Routing and Location Services in Metrics of Low Doubling Dimension ⋮ Echo: a peer-to-peer clustering framework for improving communication in DHTs ⋮ Maintaining the Ranch topology ⋮ Sharing resources in a P2P network with artificial ants ⋮ Compact roundtrip routing with topology-independent node names ⋮ Distributed transactional memory for general networks ⋮ MAAN: A multi-attribute addressable network for grid information services ⋮ Towards a scalable and robust DHT ⋮ Robust random number generation for peer-to-peer systems ⋮ Empire of colonies: Self-stabilizing and self-organizing distributed algorithm ⋮ Estimating network size from local information ⋮ The Analysis of Kademlia for Random IDs ⋮ Sub-linear Universal Spatial Gossip Protocols ⋮ Self-organizing flows in social networks ⋮ Self-organizing Flows in Social Networks
This page was built for publication: Accessing nearby copies of replicated objects in a distributed environment
