Improving churn resistance of P2P data stores based on the hypercube

被引：0

作者：

Fahrenholtz, Dietrich ^{[1
]}

Turau, Volker ^{[1
]}

机构：

[1] Hamburg Univ Technol, Inst Telemat, D-2100 Hamburg, Germany

来源：

ISPDC 2006: FIFTH INTERNATIONAL SYMPOSIUM ON PARALLEL AND DISTRIBUTED COMPUTING, PROCEEDINGS | 2006年

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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 fusion maintenance operation. It aims at reorganizing parts of our PAP data store in case the peer population shrinks so much that data availability is threatened. To this end, we present, a formal cost, model that peers use to estimate the optimal invocation point of a fusion. Finally, we present, experimental results that validate our cost model by simulating various network, conditions.

引用

页码：263 / +

页数：2

共 18 条

[1]

[Anonymous], P 21 ANN ACM S PRINC

[2]

COX R, 2002, P 1 INT WORKSH PEER

[3] A tree-based DHT approach to scalable weakly consistent peer-to-peer data management [J].

Fahrenholtz, D ;

Turau, V .

15TH INTERNATIONAL WORKSHOP ON DATABASE AND EXPERT SYSTEMS APPLICATIONS, PROCEEDINGS, 2004, :991-998

[4]

Fahrenholtz D, 2002, LECT NOTES COMPUT SC, V2455, P214

[5]

GEISSEN S, 1993, PREDICTIVE INFERENCE

[6]

GUPTA A, 2003, P 9 WORKSH HOT TOP O

[7]

Gupta I., 2003, P 2 INT WORKSH PEER

[8]

KAASHOEK F, 2003, P 2 INT WORKSH PEER

[9]

KUHN F, 2005, P 4 INT WORKSH PEER

[10]

Leighton F.T., 1992, Introduction to Parallel Algorithms and Architecture: Arrays. Trees. Hypercubes

← 1 2 →