Persistence of Data in a Dynamic Network

Abstract

We explore the possibility of achieving robust and efficient peer-to-peer storage by differentiating between reliable and unreliable nodes. Central to our technique is the use of a distributed directory (DD) to provide a level of indirection, thereby permitting the system to exploit heterogeneity. We compare and contrast the DD approach to a distributed… (More)

Topics

10 Figures and Tables

Cite this paper

@inproceedings{WeatherspoonPersistenceOD, title={Persistence of Data in a Dynamic Network}, author={Hakim Weatherspoon and Rachel L. Rubin} }