CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
unknown
PULP: an Adaptive Gossip-Based Dissemination Protocol for Multi-Source Message Streams
Authors
A-M Kermarrec
A-M Kermarrec
+16 more
A-M Kermarrec
AJ Ganesh
Anne-Marie Kermarrec
B Urgaonkar
D Kostoulas
Etienne Rivière
KP Birman
Lorenzo Leonini
P Eugster
Pascal Felber
R Lo Cigno
R Srinivasan
S Kashyap
S Voulgaris
Spyros Voulgaris
X Liu
Publication date
1 January 2011
Publisher
Doi
Cite
Abstract
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 proposed-typically pushing control messages and pulling data-to 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. © 2011 Springer Science+Business Media, LLC
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
DSpace at VU
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:dare.ubvu.vu.nl:1871/43382
Last time updated on 03/09/2013
NARCIS
See this paper in CORE
Go to the repository landing page
Download from data provider
Last time updated on 14/10/2017
VU Research Portal
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:research.vu.nl:publication...
Last time updated on 18/04/2020
Crossref
See this paper in CORE
Go to the repository landing page
Download from data provider
info:doi/10.1007%2Fs12083-011-...
Last time updated on 11/12/2019