Optimal Node Splits in Hypercube-based Peer-to-Peer Data Stores

Publikationstyp
Technical Report
Date Issued
2006
Sprache
English
Author(s)
Fahrenholtz, Dietrich  
Institut
Telematik E-17  
TORE-DOI
10.15480/882.259
TORE-URI
http://tubdok.tub.tuhh.de/handle/11420/261
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 technical report 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 sub-optimal. 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.
Subjects
Peer-to-Peer
Overlay Netzwerk
Optimierung
Kostenmodell
Peer-to-Peer
Overlay Network
Nonlinear Programming
Optimization
Cost Model
Activity-based Simulation
Lizenz
http://rightsstatements.org/vocab/InC/1.0/
Loading...
Thumbnail Image
Name

TR-2006-12-01.pdf

Size

190.6 KB

Format

Adobe PDF