Dynamic Replica Management in Distributed Hash Tables

Abstract

Interest in distributed storage is fueled by demand for reliability and resilience combined with decreasing hardware costs. Peer-to-peer storage networks based on distributed hash tables are an attractive solution due to their efficient use of resources and resulting performance. The placement and subsequent efficient location of replicas in such systems remain open problems, especially

1. the requirement to update replicated content,
2. working in the absence of global information, and
3. how to determine the locations in a dynamic system without introducing single points of failure.

We present and evaluate a novel and versatile technique, replica enumeration, which allows for controlled replication and replica access. The possibility of enumerating and addressing individual replicas allows dynamic updates as well as superior performance without burdening the network with state information, yet taking advantage of locality information when available. We simulate, analyze, and prove properties of the system, and discuss some applications.

Documents

• PDF (10 pages, 190 kBytes; this version has been updated since the research report was issued)
• Original version of the research report
• Part of the P2P project

BibTeX entry

@TechReport{waldvogel03dynamic-techreport,
  Author =       {Marcel Waldvogel and Paul Hurley and Daniel Bauer},
  Title =        {Dynamic Replica Management in Distributed Hash Tables},
  Institution =  {IBM},
  Type =         {Research Report},
  Number =       {RZ--3502},
  Year =         2003,
  Month =        jul
}