Gossip in a smartphone peer-to-peer network

DOI10.1145/3087801.3087813zbMATH Open1380.68057arXiv1705.09609OpenAlexW2619400424MaRDI QIDQ5368939FDOQ5368939

Authors: Calvin Newport 

Publication date: 11 October 2017

Published in: Proceedings of the ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Abstract: In this paper, we study the fundamental problem of gossip in the mobile telephone model: a recently introduced variation of the classical telephone model modified to better describe the local peer-to-peer communication services implemented in many popular smartphone operating systems. In more detail, the mobile telephone model differs from the classical telephone model in three ways: (1) each device can participate in at most one connection per round; (2) the network topology can undergo a parameterized rate of change; and (3) devices can advertise a parameterized number of bits about their state to their neighbors in each round before connection attempts are initiated. We begin by describing and analyzing new randomized gossip algorithms in this model under the harsh assumption of a network topology that can change completely in every round. We prove a significant time complexity gap between the case where nodes can advertise $0$ bits to their neighbors in each round, and the case where nodes can advertise $1$ bit. For the latter assumption, we present two solutions: the first depends on a shared randomness source, while the second eliminates this assumption using a pseudorandomness generator we prove to exist with a novel generalization of a classical result from the study of two-party communication complexity. We then turn our attention to the easier case where the topology graph is stable, and describe and analyze a new gossip algorithm that provides a substantial performance improvement for many parameters. We conclude by studying a relaxed version of gossip in which it is only necessary for nodes to each learn a specified fraction of the messages in the system.

Full work available at URL: https://arxiv.org/abs/1705.09609

Recommendations

• How to discreetly spread a rumor in a crowd
• Efficient Information Exchange in the Random Phone-Call Model
• Optimal gossip with direct addressing
• Gossip algorithms
• Simple, fast and deterministic gossip and rumor spreading

zbMATH Keywords

peer-to-peergossipsmartphonemobile telephone model

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14)

Cited In (2)

• Gossip algorithms
• Computational Science – ICCS 2005

This page was built for publication: Gossip in a smartphone peer-to-peer network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5368939)