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 language | English (US) |
|---|---|
| Title of host publication | Proceedings - International Conference on Distributed Computing Systems |
| Publisher | IEEE Computer Society |
| Pages | 528-535 |
| Number of pages | 8 |
| State | Published - 1994 |
| Externally published | Yes |
| Event | Proceedings of the 1994 IEEE 14th International Conference on Distributed Computing Systems - Poznan, Pol Duration: Jun 21 1994 → Jun 24 1994 |
Other
| Other | Proceedings of the 1994 IEEE 14th International Conference on Distributed Computing Systems |
|---|---|
| City | Poznan, Pol |
| Period | 6/21/94 → 6/24/94 |
ASJC Scopus subject areas
- Hardware and Architecture