| |
| | Flexible Update Propagation for Weakly Consistent Replication |
 | | So far, the paper has presented a reconciliation protocol that supports different networking environments and reconciliation policies, is incremental, and allows servers to manage the storage resources and performance of their write-logs to their best convenience. |
 | | Similarly, policies for choosing with whom to perform anti-entropy can depend on multiple factors: which other replicas are reachable, the network characteristics of the connection to these replicas, the up-to-dateness of the replicas, whether the replicas have truncated too many entries from their logs, and which replica is serving as the primary. |
 | | In the graph, the network transfer time is subdivided into four categories: time to marshall and unmarshall the RPC data, time related to transfer actual message information, time to transmit each write's public key and the overhead to transmit the update schema information and data padding for each write. |
| www2.parc.com /csl/projects/bayou/pubs/sosp-97/paper.html (11742 words) |
|