Survive Under High Churn in Structured P2P Systems: Evaluation and Strategy

Liu, Zhiyu; Yuan, Rong; Li, Zhenhua; Li, Hongxing; Chen, Guihai

doi:10.1007/11758549_58

Cited by 13 publications

(7 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Value area of Churn is between 0.1 and 0.5. 0.5 is a critical value with which system will collapse in a short time [26]. Let C present SSE individual availability, then its temporary offline probability is B= (1-C) × (1-A) (1).…”

Section: B Stochastic Petri Network Modelmentioning

confidence: 99%

A distributed storage model for selfish and rational nodes

Song

2013

2013 6th International Conference on Biomedical Engineering and Informatics

View full text Add to dashboard Cite

considering autonomy character of distributed nodes, we propose a distributed storage model for selfish and rational nodes (SR-DSM). SR-DSM is designed as six-layer model. First, static conception is described in formalization method, in which conceptions of Physical Entity (PE), Storage Service Entity (SSE) and User Entity (UE) are proposed. Second, main realization issues promoting cooperation are discussed, which is the P2P overlay network, providing of incentive compatible storage resource and selection using mechanism design, and replica placement using game theory. At last, for SSE is considered as chief active subject in model, dynamic behavior of SSE is abstracted by Petri network which is used to analyze user initial demand satisfaction with the P2P measured data. SR-DSM not only satisfies the character of selfishness and rationality, but also strengthens cooperation among nodes. And advantages of scalability, decentralized controls are still kept.

show abstract

Section: B Stochastic Petri Network Modelmentioning

confidence: 99%

A distributed storage model for selfish and rational nodes

Song

2013

2013 6th International Conference on Biomedical Engineering and Informatics

View full text Add to dashboard Cite

show abstract

“…The authors reported that these DHTs can achieve similar performance, if they are correctly calibrated. In [17], the authors measured the level of churn that different DHT topologies can tolerate. They used a random-failure churn model in order to find the churn level that yields a successful lookup ratio greater than 0.5.…”

Section: B Related Workmentioning

confidence: 99%

On the effect of peer online times on the lookup service of Chord and Kademlia P2P systems

Medrano-Chávez

Pérez-Cortés

Lopez‐Guerrero

2013

2013 IEEE Latin-America Conference on Communications

View full text Add to dashboard Cite

P2P systems can be used to provide a wide spectrum of traditional and novel applications. These systems are built around distributed hash tables (DHTs) that allow them to achieve efficient storage and retrieval of resources. A DHT is a data structure whose storage is distributed among network peers. Chord and Kademlia are two relevant examples of such DHTs. A limiting factor for the proper operation of P2P networks is the aggregate effect of peer arrivals and departures. This phenomenon is called churn and it negatively affects the quality of the services provided by DHTs. The lookup service, for instance, is a function that receives a resource ID as the input and determines the pointer to the holder of such resource. This service may fail if the nodes that store parts of a DHT leave the network. In this work we study the performance of the lookup service of Chord and Kademlia in simulation scenarios with different peer online times. We found that, by making use of long-lived peers in the network structure, Kademlia achieves better performance than Chord. Our results suggest that this benefit is obtained even with a low fraction of long-lived peers.

show abstract

“…DHTs can be adapted to handle Byzantine faults [17,36,38,63], and the problem of churn has also been ad- 7 We also assume global knowledge in one of our applications (AShare, §4.2), but this assumption is not inherent in Atum. dressed in [54,60]. Tentative lookup schemes that are both secure and churn-friendly are given in [74], where session times as low as 10 minutes are theoretically explored.…”

Section: Related Workmentioning

confidence: 99%

Atum

Guerraoui

Kermarrec

Pavlovic

et al. 2016

Proceedings of the 17th International Middleware Conference

View full text Add to dashboard Cite

This paper presents Atum, a group communication middleware for a large, dynamic, and hostile environment. At the heart of Atum lies the novel concept of volatile groups: small, dynamic groups of nodes, each executing a state machine replication protocol, organized in a flexible overlay. Using volatile groups, Atum scatters faulty nodes evenly among groups, and then masks each individual fault inside its group. To broadcast messages among volatile groups, Atum runs a gossip protocol across the overlay.We report on our synchronous and asynchronous (eventually synchronous) implementations of Atum, as well as on three representative applications that we build on top of it: A publish/subscribe platform, a file sharing service, and a data streaming system. We show that (a) Atum can grow at an exponential rate beyond 1000 nodes and disseminate messages in polylogarithmic time (conveying good scalability); (b) it smoothly copes with 18% of nodes churning every minute; and (c) it is impervious to arbitrary faults, suffering no performance decay despite 5.8% Byzantine nodes in a system of 850 nodes.

show abstract

Survive Under High Churn in Structured P2P Systems: Evaluation and Strategy

Cited by 13 publications

References 19 publications

A distributed storage model for selfish and rational nodes

A distributed storage model for selfish and rational nodes

On the effect of peer online times on the lookup service of Chord and Kademlia P2P systems

Atum

Contact Info

Product

Resources

About