Accessing nearby copies of replicated objects in a distributed environment

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

Research output: Contribution to journalArticle

106 Citations (Scopus)

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
StatePublished - May 1999

Fingerprint

Distributed Environment
Data storage equipment
Distributed Networks
Randomized Algorithms
Vertex of a graph
Object
Tend
Resources

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics
  • Mathematics(all)

Cite this

Accessing nearby copies of replicated objects in a distributed environment. / Plaxton, C. G.; Rajaraman, R.; Richa, Andrea.

In: Theory of Computing Systems, Vol. 32, No. 3, 05.1999, p. 241-280.

Research output: Contribution to journalArticle

@article{8057e217a523477dba13d62a876b6332,
title = "Accessing nearby copies of replicated objects in a distributed environment",
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.",
author = "Plaxton, {C. G.} and R. Rajaraman and Andrea Richa",
year = "1999",
month = "5",
language = "English (US)",
volume = "32",
pages = "241--280",
journal = "Theory of Computing Systems",
issn = "1432-4350",
publisher = "Springer New York",
number = "3",

}

TY - JOUR

T1 - Accessing nearby copies of replicated objects in a distributed environment

AU - Plaxton, C. G.

AU - Rajaraman, R.

AU - Richa, Andrea

PY - 1999/5

Y1 - 1999/5

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0033433272&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033433272&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0033433272

VL - 32

SP - 241

EP - 280

JO - Theory of Computing Systems

JF - Theory of Computing Systems

SN - 1432-4350

IS - 3

ER -