Dietrich Fahrenholtz
Dr. rer. nat. Dietrich Fahrenholtz
Publikationen
Dietrich Fahrenholtz. A Hypercube-based Peer-to-Peer Data Store Resilient against Peer Population Fluctuation. PhD Thesis, Hamburg University of Technology, Hamburg, Germany, 2008.
@PhdThesis{Telematik_Fahrenholtz_2008_Diss,
author = {Dietrich Fahrenholtz},
title = {A Hypercube-based Peer-to-Peer Data Store Resilient against Peer Population Fluctuation},
publisher = {Cuvillier Verlag, G{\"o}ttingen, Germany},
school = {Hamburg University of Technology},
address = {Hamburg, Germany},
edition = {1st},
year = 2008,
isbn = {978-3-86727-498-2},
}
N. I. Damm, Dietrich Fahrenholtz und Volker Turau. On Fluctuation Resilience of Second Generation Distributed Hash Tables. In Proceedings of the 15th ITG/GI - Fachtagung Kommunikation in verteilten Systemen (KiVS'07), Februar 2007, pp. 105–110. Bern, Switzerland.
@InProceedings{Telematik_DFT_2007_FluctuationResilience,
author = {N. I. Damm and Dietrich Fahrenholtz and Volker Turau},
title = {On Fluctuation Resilience of Second Generation Distributed Hash Tables},
booktitle = {Proceedings of the 15th ITG/GI - Fachtagung Kommunikation in verteilten Systemen (KiVS'07)},
pages = {105-110},
month = feb,
year = 2007,
location = {Bern, Switzerland},
}
Abstract:
Every Peer-to-Peer system destined for wide-spread use has to face the challenges imposed by peer population dynamics, which result from peers joining and leaving the system at their own discretion. So any Distributed Hash Table (DHT) design must take precautions against this peer population fluctuation (aka. churn) to sustain efficient lookup performance. Although important, an analysis of the influence of fluctuation on the performance of second generation DHTs in a unified attempt has not been done yet. An existing performance versus cost analysis by Li et al. aims at finding optimal parameters for DHTs being evaluated. However, their analysis focuses on one fluctuation scenario only. In this paper, we analyse second generation DHTs covering a wide range of topologies in a simulation framework under different fluctuation rates and evaluate their performance. Overall Kademlia attains the best lookup performance but its bandwidth consumption goes up significantly when increasing fluctuation rate. With a limited bandwidth budget and high fluctuation rate, Kelips lookup performance is the best among all examined DHTs.
Dietrich Fahrenholtz, Volker Turau und Andreas Wombacher. On Optimal Replication Group Splits in P2P Data Stores Based on the Hypercube. In Proceedings of the 15th ITG/GI - Fachtagung Kommunikation in Verteilten Systemen (KiVS'07), Februar 2007, pp. 155–162. Bern, Switzerland.
@InProceedings{Telematik_FTW_2007_ReplicationGroupHypercube,
author = {Dietrich Fahrenholtz and Volker Turau and Andreas Wombacher},
title = {On Optimal Replication Group Splits in P2P Data Stores Based on the Hypercube},
booktitle = {Proceedings of the 15th ITG/GI - Fachtagung Kommunikation in Verteilten Systemen (KiVS'07)},
pages = {155-162},
month = feb,
year = 2007,
location = {Bern, Switzerland},
}
Abstract:
P2P data stores excel if availability of inserted data items must be guaranteed. Their inherent mechanisms to counter peer population dynamics make them suitable for a wide range of application domains. This paper presents and analyzes the split maintenance operation of our P2P data store. The operation aims at reorganizing replication groups in case operation of them becomes suboptimal. To this end, we present a formal cost model that peers use to compute optimal points when to run performance optimizing maintenance. Finally, we present experimental results that validate our cost model by simulating various network conditions.
Die vollständige Publikationsliste ist separat verfügbar.