Resource Reclamation in Distributed Hash Tables

Kiran Tati and Geoffrey M. Voelker
July 27, 2006

In this paper, we discuss the problem of storage reclamation in DHTs that use redundancy to provide high data availability. Two approaches for performing storage reclamation for lazy repair are active polling and implicit garbage collection. We evaluated the overhead of these two approaches under low churn situation to high. The garbage collection is most effective for high churn peer to peer environments and the active approach is more suitable for low churn systems like educational/corporate environments.

How to view this document

The authors of these documents have submitted their reports to this technical report series for the purpose of non-commercial dissemination of scientific work. The reports are copyrighted by the authors, and their existence in electronic format does not imply that the authors have relinquished any rights. You may copy a report for scholarly, non-commercial purposes, such as research or instruction, provided that you agree to respect the author's copyright. For information concerning the use of this document for other than research or instructional purposes, contact the authors. Other information concerning this technical report series can be obtained from the Computer Science and Engineering Department at the University of California at San Diego,

[ Search ]

This server operates at UCSD Computer Science and Engineering.
Send email to