Replica placement in a dynamic network

Gurdip Singh, Mahesh Bommareddy

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We study the problem of placement of replicas of a database (or a shared resource) in a dynamic network. We develop a set of protocols that maintain a path from each site to its nearest replica such that the cost of accessing the nearest replica is below a certain threshold. The protocols determine the number of replicas needed and the sites where these replicas must be placed. This is useful in read-intensive applications which impose time constraints on read operations. The protocols reconfigure the placement in response to changes in link costs. This may involve recomputing paths and relocating, adding or removing replicas.

Original languageEnglish (US)
Title of host publicationProceedings - International Conference on Distributed Computing Systems
PublisherIEEE Computer Society
Pages528-535
Number of pages8
StatePublished - 1994
Externally publishedYes
EventProceedings of the 1994 IEEE 14th International Conference on Distributed Computing Systems - Poznan, Pol
Duration: Jun 21 1994Jun 24 1994

Other

OtherProceedings of the 1994 IEEE 14th International Conference on Distributed Computing Systems
CityPoznan, Pol
Period6/21/946/24/94

ASJC Scopus subject areas

  • Hardware and Architecture

Fingerprint Dive into the research topics of 'Replica placement in a dynamic network'. Together they form a unique fingerprint.

  • Cite this

    Singh, G., & Bommareddy, M. (1994). Replica placement in a dynamic network. In Proceedings - International Conference on Distributed Computing Systems (pp. 528-535). IEEE Computer Society.