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

Please wait, while we are loading the content...

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

Content Provider	Springer Nature Link
Author	Felber, Pascal Kermarrec, Anne Marie Leonini, Lorenzo Rivière, Etienne Voulgaris, Spyros
Copyright Year	2011
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.
Starting Page	74
Ending Page	91
Page Count	18
File Format	PDF
ISSN	19366442
Journal	Peer-to-Peer Networking and Applications
Volume Number	5
Issue Number	1
e-ISSN	19366450
Language	English
Publisher	Springer US
Publisher Date	2012-02-02
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Peer-to-Peer network Gossip-based dissemination Epidemic algorithm Information Systems and Communication Service Communications Engineering, Networks Signal, Image and Speech Processing Computer Communication Networks
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A popularity-based query scheme in P2P networks using adaptive gossip sampling

Adaptive neighborhood selection in peer-to-peer networks based on content similarity and reputation

IDispatcher: A unified platform for secure planet-scale information dissemination

Simulating peer-to-peer cloud resource scheduling

Reputation based friend-to-friend networks

Measuring the complexity of adaptive peer-to-peer systems

Peer-to-peer secure multi-party numerical computation facing malicious adversaries

On the expected file download time of the random time-based switching algorithm in P2P networks

Multi-objective optimization based privacy preserving distributed data mining in Peer-to-Peer networks

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

Similar Documents

A popularity-based query scheme in P2P networks using adaptive gossip sampling

Adaptive neighborhood selection in peer-to-peer networks based on content similarity and reputation

IDispatcher: A unified platform for secure planet-scale information dissemination

Simulating peer-to-peer cloud resource scheduling

Reputation based friend-to-friend networks

Measuring the complexity of adaptive peer-to-peer systems

Peer-to-peer secure multi-party numerical computation facing malicious adversaries

On the expected file download time of the random time-based switching algorithm in P2P networks

Multi-objective optimization based privacy preserving distributed data mining in Peer-to-Peer networks

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