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

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 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.

Multisource Rumor Spreading with Network Coding

“…• Finally, we are evaluating CHEPIN thoroughly by simulation. We show that our solution reduces the bandwidth overhead by 25% and the delivery delay by 18% with respect to PULP [14], while keeping the same properties.…”

“…However, due to its probabilistic aspect, gossip based dissemination implies high redundancy with nodes receiving the same message several times. Many algorithms have been studied to limit the number of exchanged messages to disseminate data, using different combination of approaches such as push (a node can push a message it knows to its neighbors), pull (a node pulls a messages it does not know from its neighbors) or push-pull (a mix of both) for either single or multi-source gossip protocols [12] [13] [14].…”

Collaborative Multi-Source Scheme for Multimedia Content Distribution

“…Authors in [9] exploit the similar source concept to significantly improve the download time of a file from multiple sources to one receiver. Push is proposed in [10] as an efficient generic push-pull dissemination protocol. Pulp exploits the efficiency of push and pull approaches, such that it presents achieve reasonable latency and presents a low overhead by limiting redundant messages.…”

Trust-based collection of information in distributed reputation networks

“…In the push strategy, a node sends (pushes) its messages towards other nodes in the network while in a pull strategy, it probes another node for messages that it has not received yet, and then it fetches (pulls) the corresponding messages. We perform a pull-based strategy since it results in significantly smaller overhead and ensures the delivery of message in sparsely connected areas of the network [12]. From a security perspective, a node collecting information requests messages from selected nodes following the flow of trust in the interaction graph and so, it has more control on the received information.…”