Most DHTs are designed more for scalability than for consistency, and thus do not provide strong guarantees on the consistency of data. In this paper, we focus on key consistency rather than data consistency: key consistency requires that no key be owned by more than one root. We briefly show how key consistency can be used to support atomic DHT operations and then propose a mechanism to achieve key-consistency. We have tested our algorithm through simulation and a Planetlab deployment, and find that it provides high availability in the face of node churn and packet drops.
Usage Statement
Researchers may make free and open use of the UC Berkeley Library’s digitized public domain materials. However, some materials in our online collections may be protected by U.S. copyright law (Title 17, U.S.C.). Use or reproduction of materials protected by copyright beyond that allowed by fair use (Title 17, U.S.C. § 107) requires permission from the copyright owners. The use or reproduction of some materials may also be restricted by terms of University of California gift or purchase agreements, privacy and publicity rights, or trademark law. Responsibility for determining rights status and permissibility of any use or reproduction rests exclusively with the researcher. To learn more or make inquiries, please see our permissions policies (https://www.lib.berkeley.edu/about/permissions-policies).
