CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays

Voulgaris, Spyros; Gavidia, Daniela; Steen, Maarten van

doi:10.1007/s10922-005-4441-x

Cited by 365 publications

(393 citation statements)

References 14 publications

Supporting

Mentioning

387

Contrasting

Order By: Relevance

“…We further justify this choice of a very low coverage of the initial push phase with our second experiment. Unless otherwise noted, the minimal and maximal pull periods are set to pull min = 0.2 s and pull max = 30 s. No node has global knowledge of the network, and the selection of random peers for Pulp operations is based exclusively on Cyclon [33], as explained in Section 3.2. Cyclon performs periodic pairwise shuffles of peers' views to maintain a constantly evolving overlay network whose properties are close to those of a random graph (i.e., each node's link is equally likely to be present in any other node's view).…”

Section: Methodsmentioning

confidence: 99%

“…To that end, we rely on the family of Peer Sampling Service protocols [11], and specifically Cyclon [33], which provides each node with a regularly refreshed list of links to random other peers, in a fully decentralized manner and at negligible bandwidth cost.…”

Section: Supporting Mechanismsmentioning

confidence: 99%

“…To provide a high level sketch of Cyclon we omit certain details found in [33]. In a Cyclon overlay, each node maintains a (very short) partial view of the network, that is, a handful of links (IP addresses and ports) to other nodes.…”

Section: Supporting Mechanismsmentioning

confidence: 99%

“…As a result, views are periodically refreshed with new links to random other peers of the overlay. When the right policies are followed (see [11] and [33] for details), this method has shown to produce overlays that strongly resemble random graphs, that is, at any given moment each node's view contains links to nodes selected uniformly at random from the whole network. Moreover, this process has shown to converge in a few dozen cycles irrespectively of the initial topology, and due to the selfhealing nature of Cyclon the respective properties are retained even in the face of node churn.…”

Section: Supporting Mechanismsmentioning

confidence: 99%

See 3 more Smart Citations

Pulp: An adaptive gossip-based dissemination protocol for multi-source message streams

Felber

Kermarrec

Leonini

et al. 2012

Peer-to-Peer Netw. Appl.

Self Cite

View full text Add to dashboard Cite

Gossip-based protocols provide a simple, scalable, and robust way to disseminate messages in large-scale systems. In such protocols, messages are spread in an epidemic manner. Gossiping may take place between nodes using push, pull, or a combination. Push-based systems achieve reasonable latency and high resilience to failures but may impose an unnecessarily large redundancy and overhead on the system. At the other extreme, pull-based protocols impose a lower overhead on the network at the price of increased latencies. A few hybrid approaches have been proposedtypically pushing control messages and pulling datato avoid the redundancy of high-volume content and single-source streams. Yet, to the best of our knowledge, no other system intermingles push and pull in a multiple-senders scenario, in such a way that data messages of one help in carrying control messages of the other and in adaptively adjusting its rate of operation, further reducing overall cost and improving both on delays and robustness. In this paper, we propose an efficient generic push-pull dissemination protocol, Pulp, which combines the best of both worlds. Pulp exploits the efficiency of push approaches, while limiting redundant messages and therefore imposing a low overhead, as pull protocols do. Pulp leverages the dissemination of multiple messages from diverse sources: by exploiting the push phase of messages to transmit information about other disseminations, Pulp enables an efficient pulling of other messages, which themselves help in turn with the dissemination of pending messages. We deployed Pulp on a cluster and on PlanetLab. Our results demonstrate that Pulp achieves an appealing trade-off between coverage, message redundancy, and propagation delay.

show abstract

Section: Methodsmentioning

confidence: 99%

Section: Supporting Mechanismsmentioning

confidence: 99%

Section: Supporting Mechanismsmentioning

confidence: 99%

Section: Supporting Mechanismsmentioning

confidence: 99%

See 2 more Smart Citations

Pulp: An adaptive gossip-based dissemination protocol for multi-source message streams

Felber

Kermarrec

Leonini

et al. 2012

Peer-to-Peer Netw. Appl.

Self Cite

View full text Add to dashboard Cite

show abstract

“…The mechanism used to construct the overlay in the unstructured approach is known as the Peer Sampling Service [11], and several works before have focused on building such a service in a fully decentralized fashion [8,16,20,14,15,9]. With the abstraction provided by the Peer Sampling Service, peers wishing to disseminate messages, simply consult the service to obtain a subset of known neighbors, and forward those messages to them.…”

Section: Introductionmentioning

confidence: 99%

CLON: Overlay Networks and Gossip Protocols for Cloud Environments

Matos

Sousa

Pereira

et al. 2009

On the Move to Meaningful Internet Systems: OTM 2009

View full text Add to dashboard Cite

Although epidemic or gossip-based multicast is a robust and scalable approach to reliable data dissemination, its inherent redundancy results in high resource consumption on both links and nodes. This problem is aggravated in settings that have costlier or resource constrained links, as happens in Cloud Computing infrastructures composed by several interconnected data centers across the globe.The goal of this work is therefore to improve the efficiency of gossip-based reliable multicast by reducing the load imposed on those constrained links. In detail, the proposed CLON protocol combines an overlay that gives preference to local links and a dissemination strategy that takes into account locality. Extensive experimental evaluation using a very large number of simulated nodes shows that this results in a reduction of traffic in constrained links by an order of magnitude, while at the same time preserving the resilience properties that make gossip-based protocols so attractive.

show abstract

Gossip and Epidemic Protocols

Montresor

2017

Wiley Encyclopedia of Electrical and Electronics Engineering

View full text Add to dashboard Cite

Agossip protocolis a distributed communication paradigm inspired by the gossip phenomenon that can be observed in social networks. Initially born to efficiently disseminate information, as its human counterpart, it has been later used to solve several other problems, such as failure detection, data aggregation, distributed topology construction, and resource allocation –to name just a few. Gossip protocols tend to be used in contexts where both the scale and the dynamism of the underlying communication network make the adoption of traditional communication protocols highly unpractical. In this article, we first introduce a collection of gossip protocols for information diffusion, and we provide an analytical model to study their performance with respect to speed and quality of the diffusion. We then introduce three representative examples of gossip‐based protocols that solve the most diverse problems, namely, membership management, aggregation, and overlay topology construction.

show abstract

CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays

Cited by 365 publications

References 14 publications

Pulp: An adaptive gossip-based dissemination protocol for multi-source message streams

Pulp: An adaptive gossip-based dissemination protocol for multi-source message streams

CLON: Overlay Networks and Gossip Protocols for Cloud Environments

Gossip and Epidemic Protocols

Contact Info

Product

Resources

About