Accessing nearby copies of replicated objects in a distributed environment
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Coordinated Placement and Replacement for Large-Scale Distributed Caches
IEEE Transactions on Knowledge and Data Engineering
Online Algorithms for Caching Multimedia Streams
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Novel architectures for P2P applications: The continuous-discrete approach
ACM Transactions on Algorithms (TALG)
USENIXATC'11 Proceedings of the 2011 USENIX conference on USENIX annual technical conference
| Hi-index | 0.00 |
The authors consider a synchronous model of distributed computation in which n nodes communicate via point-to-point messages, subject to the following constraints: (i) in a single "step", a node can only send or receive O(logn) words, and (ii) communication is unreliable in that a constant fraction of all messages are lost at each step due to node and/or link failures. They design and analyze a simple local protocol for providing fast concurrent access to shared objects in this faulty network environment. In the protocol, clients use a hashing-based method to access shared objects. When a large number of clients attempt to read a given object at the same time, the object is rapidly replicated to an appropriate number of servers. Once the necessary level of replication has been achieved, each remaining request for the object is serviced within O(1) expected steps. The protocol has practical potential for supporting high levels of concurrency in distributed file systems over wide area networks.