analysis of long-running replicated strongsystemsstrong.pdfVIP

Analysis of Long-Running Replicated Systems Sriram Ramabhadran Joseph Pasquale Dept. of Computer Science Engineering Dept. of Computer Science Engineering University of California, San Diego University of California, San Diego sriram@ pasquale@ Abstract— We address the problem of using replication to ity, the system must constantly repair replicas lost due to reliably maintain state in a distributed system for time spans node departure. Thus, there is a notion of repair rate, which that far exceed the lifetimes of individual replicas. This scenario captures how proactive the system is in replacing lost replicas. is relevant for any system comprised of a potentially large and selectable number of replicated components, each of which may Thus, the two parameters the systems uses to ensure long-term be highly unreliable, where the goal is to have enough replicas to availability of state are the number of replicas, and the repair keep the system “alive” (meaning at least one replica is working rate. The metric the system tries to optimize is the lifetime or available) for a certain expected period of time, i.e., the of the state, i.e., how long the system is able to preserve the system’s lifetime. In particular, this applies to recent efforts to state in the system before all replicas are lost. How the system build highly available storage systems based on the peer-to-peer paradigm. We model notions of replica loss and replica repair tunes these parameters to maximize lifetime is the subject of