Accessing nearby copies of replicated objects in a distributed environment

C. G. Plaxton, R. Rajaraman, Andrea Richa

Research output: Contribution to journalArticle

107 Scopus citations

Abstract

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 achieve this goal efficiently 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 small amount of additional memory at each node.

Original languageEnglish (US)
Pages (from-to)241-280
Number of pages40
JournalTheory of Computing Systems
Volume32
Issue number3
DOIs
StatePublished - Jan 1 1999

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Accessing nearby copies of replicated objects in a distributed environment'. Together they form a unique fingerprint.

  • Cite this