Accessing nearby copies of replicated objects in a distributed environment
From MaRDI portal
Recommendations
Cited in
(36)- 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
- MAAN: A multi-attribute addressable network for grid information services
- 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
- Load balanced distributed directories
- Transmission and navigation on disordered lattice networks, directed spanning forests and Brownian web
- Distributed transactional memory for general networks
- Self-organizing flows in social networks
- D2B: A de Bruijn based content-addressable network
- Analysis of randomized protocols for conflict-free distributed access
- Sharing resources in a P2P network with artificial ants
- Self-organizing flows in social networks
- Sub-linear universal spatial gossip protocols
- Survey of DHT topology construction techniques in virtual computing environments
- Dynamic Routing and Location Services in Metrics of Low Doubling Dimension
- Algorithmic Design of the Globe Wide-Area Location Service
- Locating replicas of a database on a network
- scientific article; zbMATH DE number 2044915 (Why is no real title available?)
- scientific article; zbMATH DE number 1759986 (Why is no real title available?)
- The analysis of Kademlia for random IDs
- Stable and fault-tolerant object allocation
- An algorithm for replicated objects with efficient reads (extended abstract)
- A dynamic adaptive replica allocation algorithm in mobile ad hoc networks
- Efficient replication of large data objects
- Compact roundtrip routing with topology-independent node names
- Building a large location table to find replicas of physics objects
- Topological implications of selfish neighbor selection in unstructured peer-to-peer networks
- Echo: a peer-to-peer clustering framework for improving communication in DHTs
- Maintaining the Ranch topology
- Distributed object location in a dynamic network
- Towards communication-efficient Peer-to-Peer networks
- Towards a scalable and robust DHT
This page was built for publication: Accessing nearby copies of replicated objects in a distributed environment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1293914)
