Random Gossip Processes in Smartphone Peer-to-Peer Networks

Newport, Calvin; Weaver, Alex

doi:10.1109/dcoss.2019.00041

Cited by 5 publications

(4 citation statements)

References 27 publications

(77 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The capabilities and behaviors of smartphone based networks have also been studied [9,25,26]. One of the major problems is that the classic P2P algorithms were designed without energy efficiency in mind [4].…”

Section: Related Workmentioning

confidence: 99%

Modeling Peer-to-Peer Connections over a Smartphone Network

Berta

Szabó

Jelasity

2020

Proceedings of the 1st International Workshop on Distributed Infrastructure for Common Good

View full text Add to dashboard Cite

Section: Related Workmentioning

confidence: 99%

Modeling Peer-to-Peer Connections over a Smartphone Network

Berta

Szabó

Jelasity

2020

Proceedings of the 1st International Workshop on Distributed Infrastructure for Common Good

View full text Add to dashboard Cite

“…Existing results for one-shot gossip in the mobile telephone model are expressed with respect to the vertex expansion (denoted α) of the graph topology [30,29]. The best known results requires O((n/α)polylog(n)) rounds, which is not tight in all graphs as vertex expansion does not necessarily characterize optimal gossip.…”

Section: Implications For One-shot Gossipmentioning

confidence: 99%

“…the MTM, including rumor spreading [17], load balancing [8], leader election [29], and gossip [29,30]. This paper is the first to study ongoing communication in this setting.…”

Section: Introductionmentioning

confidence: 99%

The Capacity of Smartphone Peer-to-Peer Networks

Dinitz,

Halldórsson,

Newport

et al. 2019

Preprint

Self Cite

View full text Add to dashboard Cite

We study three capacity problems in the mobile telephone model, a network abstraction that models the peer-to-peer communication capabilities implemented in most commodity smartphone operating systems. The capacity of a network expresses how much sustained throughput can be maintained for a set of communication demands, and is therefore a fundamental bound on the usefulness of a network. Because of this importance, wireless network capacity has been active area of research for the last two decades.The three capacity problems that we study differ in the structure of the communication demands. The first problem is pairwise capacity, where the demands are (source, destination) pairs. Pairwise capacity is one of the most classical definitions, as it was analyzed in the seminal paper of Gupta and Kumar on wireless network capacity. The second problem we study is broadcast capacity, in which a single source must deliver packets to all other nodes in the network. Finally, we turn our attention to all-to-all capacity, in which all nodes must deliver packets to all other nodes. In all three of these problems we characterize the optimal achievable throughput for any given network, and design algorithms which asymptotically match this performance. We also study these problems in networks generated randomly by a process introduced by Gupta and Kumar, and fully characterize their achievable throughput.Interestingly, the techniques that we develop for all-to-all capacity also allow us to design a one-shot gossip algorithm that runs within a polylogarithmic factor of optimal in every graph. This largely resolves an open question from previous work on the one-shot gossip problem in this model.

show abstract

“…longest chain). The RNS method implies randomized paths, walked by shared data [201], leading to an inefficient data propagation scheme. This is due to several redundant exchanged messages caused by the probability of cycle appearance on the randomly selected path of data, leading to higher average finality time and lower consistency levels.…”

Section: Introductionmentioning

confidence: 99%

Integrating Blockchain and Fog Computing Technologies for Efficient Privacy-preserving Systems

Baniata

View full text Add to dashboard Cite

This PhD dissertation concludes a three-year long research journey on the integration of Fog Computing and Blockchain technologies. The main aim of such integration is to address the challenges of each of these technologies, by integrating it with the other. Blockchain technology (BC) is a distributed ledger technology in the form of a distributed transactional database, secured by cryptography, and governed by a consensus mechanism. It was initially proposed for decentralized cryptocurrency applications with practically proven high robustness. Fog Computing (FC) is a geographically distributed computing architecture, in which various heterogeneous devices at the edge of network are ubiquitously connected to collaboratively provide elastic computation services. FC provides enhanced services closer to end-users in terms of time, energy, and network load. The integration of FC with BC can result in more efficient services, in terms of latency and privacy, mostly required by Internet of Things systems.

show abstract

Random Gossip Processes in Smartphone Peer-to-Peer Networks

Cited by 5 publications

References 27 publications

Modeling Peer-to-Peer Connections over a Smartphone Network

Modeling Peer-to-Peer Connections over a Smartphone Network

The Capacity of Smartphone Peer-to-Peer Networks

Integrating Blockchain and Fog Computing Technologies for Efficient Privacy-preserving Systems

Contact Info

Product

Resources

About