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.
Pre-2018 CSE ID: CS2006-0863
