Accessing Nearby Copies of Replicated Objects in a Distributed Environment

Accessing Nearby Copies of Replicated Objects in a Distributed Environment (1997)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by C. Greg Plaxton , Rajmohan Rajaraman , Andrea W. Richa , Andr'ea W. Richa

Citations:

422 - 10 self

BibTeX

@INPROCEEDINGS{Plaxton97accessingnearby,
    author = {C. Greg Plaxton and Rajmohan Rajaraman and Andrea W. Richa and Andr'ea W. Richa},
    title = {Accessing Nearby Copies of Replicated Objects in a Distributed Environment},
    booktitle = {},
    year = {1997},
    pages = {311--320}
}

Years of Citing Articles

Bookmark

OpenURL

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 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 small 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 mode...

Citations

No citations identified.