Deterministic Replication for RELOAD
draft-vidya-p2psip-replication-00
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Vidya Narayanan , Saumitra Das , Ashwin Swaminathan | ||
| Last updated | 2009-07-02 | ||
| RFC stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| Stream | Stream state | (No stream defined) | |
| Consensus boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Expired | |
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
RELOAD [1] provides successor replication of data to protect against data loss occurring from churn on the overlay. It specifies storing of two redundant copies of data on the two immediate successors of a particular node. This provides for basic replication and is highly essential for stability of the overlay. However, it does not address the problem of replication to meet the availability requirements for a particular piece of data or to have the replicas be useful in some inherent load balancing on the overlay. This document specifies a mechanism to provide application-agnostic, deterministic replication on the overlay to meet these needs.
Authors
Vidya Narayanan
Saumitra Das
Ashwin Swaminathan
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)