Asynchronous Gossip in Smartphone Peer-to-Peer Networks

by   Calvin Newport, et al.

In this paper, we study gossip algorithms in communication models that describe the peer-to-peer networking functionality included in most standard smartphone operating systems. We begin by describing and analyzing a new synchronous gossip algorithm in this setting that features both a faster round complexity and simpler operation than the best-known existing solutions. We also prove a new lower bound on the rounds required to solve gossip that resolves a minor open question by establishing that existing synchronous solutions are within logarithmic factors of optimal. We then adapt our synchronous algorithm to produce a novel gossip strategy for an asynchronous model that directly captures the interface of a standard smartphone peer-to-peer networking library (enabling algorithms described in this model to be easily implemented on real phones). Using new analysis techniques, we prove that this asynchronous strategy efficiently solves gossip. This is the first known efficient asynchronous information dissemination result for the smartphone peer-to-peer setting. We argue that our new strategy can be used to implement effective information spreading subroutines in real world smartphone peer-to-peer network applications, and that the analytical tools we developed to analyze it can be leveraged to produce other broadly useful algorithmic strategies for this increasingly important setting.



There are no comments yet.


page 1


Random Gossip Processes in Smartphone Peer-to-Peer Networks

In this paper, we study random gossip processes in communication models ...

A New Approach to Multi-Party Peer-to-Peer Communication Complexity

We introduce new models and new information theoretic measures for the s...

The Capacity of Smartphone Peer-to-Peer Networks

We study three capacity problems in the mobile telephone model, a networ...

Reducing asynchrony to synchronized rounds

Synchronous computation models simplify the design and the verification ...

Crisis: Probabilistically Self Organizing Total Order in Unstructured P2P Networks

A framework for asynchronous, signature free, fully local and probabilis...

SnapFuzz: An Efficient Fuzzing Framework for Network Applications

In recent years, fuzz testing has benefited from increased computational...

Peer-to-Peer Localization for Single-Antenna Devices

Some important indoor localization applications, such as localizing a lo...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.