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. |
Year | DOI | Venue |
---|---|---|
2005 | 10.1007/11603771_26 | IWDC |
Keywords | Field | DocType |
performance analysis,peer-to-peer group membership,interesting ggm protocol,interesting trade-off,scamp increase,overlay connectivity,scalable overlay topology,p2p group membership,overlay topology,membership protocol,group membership protocol,churn rate,churn resilience,p2p,network dynamics | Virtual network,Network dynamics,Peer-to-peer,Computer science,Gossip,Network topology,Churn rate,Overlay network,Distributed computing,Scalability | Conference |
Volume | ISSN | ISBN |
3741 | 0302-9743 | 3-540-30959-4 |
Citations | PageRank | References |
2 | 0.43 | 13 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Roberto Baldoni | 1 | 1606 | 132.37 |
Adnan Noor Mian | 2 | 85 | 12.39 |
Sirio Scipioni | 3 | 29 | 3.41 |
Sara Tucci Piergiovanni | 4 | 286 | 22.22 |