The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Accessing nearby copies of replicated objects in a distributed environment
Open accessAbstract
Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time.To ensure both fast access to the objects as well as efficient utilization of network resources, it is desirable that each access request be satisfied by a copy "close" to the requesting node.Unfortunately, it is not clear how to efficiently achieve this goal in a dynamic, distributed environment in which large numbers of objects are continuously being created, replicated, and destroyed,In this paper, we design a simple randomized algorithm for accessing shared objects that tends to satisfy each access request with a nearby copy.The algorithm is based on a novel mechanism to maintain and distribute information about object locations, and requires only a smaIl amount of additional memory at each node.We analyze our access scheme for a class of cost functions that captures the hierarchical nature of wide-area networks.We show that under the particular cost model considered: (i) the expected cost of an individual access is asymptotically optimal, and (ii) if objects are sufficiently large, the memory used for objects dominates the additional memory used by our algorithm with high probability.We also address dynamic changes in both the network as well as the set of object copies.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
Chernoff, H. (1952) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729330 · Cited by 3,550
Karger, D., Lehman, E., Leighton, T., Panigrahy, R., Levine, M., & Lewin, D. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258660 · Cited by 1,981
Fat-trees: Universal networks for hardware-efficient supercomputing
Leiserson, C. E. (1985) · IEEE Transactions on Computers · doi:10.1109/tc.1985.6312192 · Cited by 1,325
Competitive Algorithms for Distributed Data Management
Bartal, Y., Fiat, A., & Rabani, Y. (1995) · Journal of Computer and System Sciences · doi:10.1006/jcss.1995.1073 · Cited by 146
Online tracking of mobile users
Awerbuch, B., & Peleg, D. (1995) · Journal of the ACM · doi:10.1145/210118.210132 · Cited by 131
Competitive algorithms for distributed data management (extended abstract)
Bartal, Y., Fiat, A., & Rabani, Y. (1992) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/129712.129717 · Cited by 68
Distributed Paging for General Networks
Awerbuch, B., Bartal, Y., & Fiat, A. (1998) · Journal of Algorithms · doi:10.1006/jagm.1998.0924 · Cited by 55
Distributed paging for general networks
Awerbuch, B., Bartal, Y., & Fiat, A. (1996) · Symposium on Discrete Algorithms · doi:10.5555/313852.314122 · Cited by 29
Fast fault-tolerant concurrent access to shared objects
Plaxton, C. G., & Rajaraman, R. (2002) · doi:10.1109/sfcs.1996.548516 · Cited by 22
Self-citation
Cited by
Chord: A scalable peer-to-peer lookup service for internet applications
Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., & Balakrishnan, H. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383071 · Cited by 9,623
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Rowstron, A., & Druschel, P. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45518-3_18 · Cited by 7,276
A scalable content-addressable network
Ratnasamy, S., Francis, P., Handley, M., Karp, R., & Shenker, S. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383072 · Cited by 6,372
Chord: a scalable peer-to-peer lookup protocol for internet applications
Stoica, I., Morris, R., Liben-Nowell, D., Karger, D. R., Kaashoek, M. F., Dabek, F., & Balakrishnan, H. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.808407 · Cited by 3,133
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
Maymounkov, P., & Mazières, D. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_5 · Cited by 3,004
Metadata
- Authors
- Plaxton, C. G., Rajaraman, R., & Richa, A. W.
- Venue
- Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures - SPAA '97
- Publisher
- ACM Press
- Published
- 1997
- Pages
- 311-320
- OpenAlex
- W2000876023
- Cited by
- 760
- References
- 9
- FWCI
- 5.46
- Type
- conference paper
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.