Partitioning is one of the main problems in p2p group membership, This problem rises when failures and dynamics of peer participation, or churn, occur in the overlay topology created by a group membership protocol connecting the group of peers. Solutions based on Gossip-based Group Membership (GGM) cope well with the failures while suffer from network dynamics. This paper shows a performance evaluation of SCAMP, one of the most interesting GGM protocol, The analysis points out that the probability of partitioning of the overlay topology created by SCAMP increases with the churn rate, We also compare SCAMP with DET - another membership protocol that deterministically avoids partitions of the overlay, The comparison points out an interesting trade-off between (i) reliability, in terms of guaranteeing overlay connectivity at any churn rate, and (ii) scalability in terms of creating scalable overlay topologies where latencies experienced by a peer during join and leave operations do not increase linearly with the number of peers in the group. © Springer-Verlag Berlin Heidelberg 2005.
Churn Resilience of Peer-to-Peer Group Membership: a Performance Analysis / Baldoni, Roberto; NOOR MIAN, A; Scipioni, Sirio; TUCCI PIERGIOVANNI, Sara. - 3741 LNCS:(2005), pp. 226-237. (Intervento presentato al convegno 7th International Workshop on Distributed Computing, IWDC 2005 tenutosi a Kharagpur; India) [10.1007/11603771_26].
Churn Resilience of Peer-to-Peer Group Membership: a Performance Analysis
BALDONI, Roberto;SCIPIONI, Sirio;TUCCI PIERGIOVANNI, sara
2005
Abstract
Partitioning is one of the main problems in p2p group membership, This problem rises when failures and dynamics of peer participation, or churn, occur in the overlay topology created by a group membership protocol connecting the group of peers. Solutions based on Gossip-based Group Membership (GGM) cope well with the failures while suffer from network dynamics. This paper shows a performance evaluation of SCAMP, one of the most interesting GGM protocol, The analysis points out that the probability of partitioning of the overlay topology created by SCAMP increases with the churn rate, We also compare SCAMP with DET - another membership protocol that deterministically avoids partitions of the overlay, The comparison points out an interesting trade-off between (i) reliability, in terms of guaranteeing overlay connectivity at any churn rate, and (ii) scalability in terms of creating scalable overlay topologies where latencies experienced by a peer during join and leave operations do not increase linearly with the number of peers in the group. © Springer-Verlag Berlin Heidelberg 2005.File | Dimensione | Formato | |
---|---|---|---|
VE_2005_11573-362890.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
655.3 kB
Formato
Adobe PDF
|
655.3 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.