Self-stabilizing and Byzantine-Tolerant Overlay Network

Dolev, Danny; Hoch, Ezra N.; Renesse, Robbert van

doi:10.1007/978-3-540-77096-1_25

Cited by 12 publications

(6 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…With P we denote the set of all distributed protocols where all interactions between processes can be decomposed into the four primitives. Not surprisingly, all of the self-stabilizing topology maintenance protocols proposed so far (e.g., [2,3,6,8]) are in P(as otherwise they would risk disconnection of their topology).…”

Section: Our Resultsmentioning

confidence: 99%

Towards a Universal Approach for the Finite Departure Problem in Overlay Networks

Koutsopoulos

Scheideler

Strothmann

2015

Proceedings of the 27th ACM Symposium on Parallelism in Algorithms and Architectures

View full text Add to dashboard Cite

A fundamental problem for overlay networks is to safely exclude leaving nodes, i.e., the nodes requesting to leave the overlay network are excluded from it without affecting its connectivity. There are a number of studies for safe node exclusion if the overlay is in a well-defined state, but almost no formal results are known for the case in which the overlay network is in an arbitrary initial state, i.e., when looking for a self-stabilizing solution for excluding leaving nodes. We study this problem in two variants: the Finite Departure Problem (F DP) and the Finite Sleep Problem (FSP). In the F DP the leaving nodes have to irrevocably decide when it is safe to leave the network, whereas in the FSP, this leaving decision does not have to be final: the nodes may resume computation when woken up by an incoming message. We are the first to present a self-stabilizing protocol for the F DP and the F SP that can be combined with a large class of overlay maintenance protocols so that these are then guaranteed to safely exclude leaving nodes from the system from any initial state while operating as specified for the staying nodes. In order to formally define the properties these overlay maintenance protocols have to satisfy, we identify four basic primitives for manipulating edges in an overlay network that might be of independent interest.

show abstract

Section: Our Resultsmentioning

confidence: 99%

Towards a Universal Approach for the Finite Departure Problem in Overlay Networks

Koutsopoulos

Scheideler

Strothmann

2015

Proceedings of the 27th ACM Symposium on Parallelism in Algorithms and Architectures

View full text Add to dashboard Cite

show abstract

“…S-Fireflies [30] is an effective self-stabilizing system for data dissemination, robust to Byzantine faults, and churntolerant. It creates random permutations of the system nodes and uses them to pick the neighbors for each node.…”

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

“…Compared to previous structured overlay approaches, a more realistic solution (from the point of view of Byzantine faults) to P2P streaming is given by Dolev et al in S-Fireflies [12]. The purpose of the P2P overlay network is double: tolerate Byzantine nodes and selfstabilize (to adapt dynamically to churn).…”

Section: Gossiping and Byzantine Faultsmentioning

confidence: 99%

Security and privacy issues in P2P streaming systems: A survey

Gheorghe

Cigno

Montresor

2010

Peer-to-Peer Netw. Appl.

View full text Add to dashboard Cite

Streaming applications over Peer-To-Peer (P2P) systems have gained an enormous popularity. Success always implies increased concerns about security, protection, privacy and all the other 'side' properties that transform an experimental application into a service. Research on security for P2P streaming started to flourish, but no comprehensive security analysis over the current P2P solutions has yet been attempted. There are no best practices in system design, no (widely) accepted attack models, no measurementbased studies on security threats to P2P streaming, nor even general surveys investigating specific security aspects for these systems. This paper addresses this last aspect. Starting from existing analyses and security models in the related literature, we give an overview on security and privacy considerations for P2P streaming systems. Our analysis emphasizes two major facts: (i) the Byzantine-Altruistic-Rational (BAR) model offers stronger security guarantees compared to other approaches, at the cost of higher complexity and overhead; and (ii) the general perception (not necessarily the truth, but a commonplace belief) that it is necessary to sacrifice accuracy or performance in order to tolerate faults or misbehaviors, is not always true. OverviewPeer-to-peer systems have gained more and more momentum over the last years as a means to access multimedia contents, albeit initially in form of file downloads. The evolution to streaming and multicast (e.g., TV) was just a consequence. Their power to accommodate large amounts of users, together with their resilience to churn, reliability, and low cost are some of the reasons why they are preferred over dedicated servers or content distribution networks solutions. In spite of these advantages, or maybe because of them, some P2P features make these systems more difficult to defend against some classes of attacks.Security-wise, P2P streaming systems are more challenging than other P2P applications because they are more vulnerable to QoS fluctuations. Live streaming protocols, and TV in particular, are most sensitive to delay and delay jitter: it is enough for a host to be prevented from receiving some packets in time, and the user may grow dissatisfied with the quality of the delivery and leave the system altogether. If some other peers are connected to that machine, they will be damaged as well. From the watcher's viewpoint, even slight quality fluctuations, or choppiness, cause the viewing experience to loose appeal and the user to drop the service (or switch channels if others offer better quality). Worse, the quality of the user experience is unrecoverable: if some packets are lost during live broadcast, they are lost for good because recovering them afterwards brings no utility to the user. Peer-to-Peer Netw ApplApart from their time-sensitive nature and bandwidth dependency, P2P streaming are susceptible to manipulation and threats at the transport and network layers. Clever attacks can compromise selectively the guarantees that a streaming sessio...

show abstract

Self-stabilizing and Byzantine-Tolerant Overlay Network

Cited by 12 publications

References 16 publications

Towards a Universal Approach for the Finite Departure Problem in Overlay Networks

Towards a Universal Approach for the Finite Departure Problem in Overlay Networks

Atum

Security and privacy issues in P2P streaming systems: A survey

Contact Info

Product

Resources

About