Information dissemination via random walks
View / Open Files
Authors
Advisors
Sauerwald, Thomas
Giakkoupis, George
Date
2021-07-06Awarding Institution
University of Cambridge
Qualification
Doctor of Philosophy (PhD)
Type
Thesis
Metadata
Show full item recordCitation
Saribekyan, H. (2021). Information dissemination via random walks (Doctoral thesis). https://doi.org/10.17863/CAM.77947
Abstract
Information dissemination is a fundamental task in distributed computing:
How to deliver a piece of information from a node of a network to some or all other nodes?
In the face of large and still growing modern networks, it is imperative that dissemination algorithms are decentralised and can operate under unreliable conditions.
In the past decades, randomised rumour spreading algorithms
have addressed these challenges.
In these algorithms, a message is initially placed at a source node of a network, and, at regular intervals, each node contacts a randomly selected neighbour.
A message may be transmitted in one or both directions during each of these communications, depending on the exact protocol.
The main measure of performance for these algorithms is their broadcast time, which is the time until a message originating from a source node is disseminated to all nodes of the network.
Apart from being extremely simple and robust to failures, randomised rumour spreading achieves theoretically optimal broadcast time in many common network topologies.
In this thesis, we propose an agent-based information dissemination algorithm, called Visit-Exchange.
In our protocol, a number of agents perform independent random walks in the network.
An agent becomes informed when it visits a node that has a message, and later informs all future nodes it visits.
Visit-Exchange shares many of the properties of randomised rumour spreading, namely, it is very simple and uses the same amount of communication in a unit of time.
Moreover, the protocol can be used as a simple model of non-recoverable epidemic processes.
We investigate the broadcast time of Visit-Exchange on a variety of network topologies, and compare it to traditional rumour spreading.
On dense regular networks we show that the two types of protocols are equivalent, which means that in this setting the vast literature on randomised rumour spreading applies in our model as well.
Since many networks of interest, including real-world ones, are very sparse, we also study agent-based broadcast for sparse networks.
Our results include almost optimal or optimal bounds for sparse regular graphs, expanders, random regular graphs, balanced trees and grids.
We establish that depending on the network topology, Visit-Exchange may be either slower or faster than traditional rumour spreading.
In particular, in graphs consisting of hubs that are not well connected, broadcast using agents can be significantly faster.
Our conclusion is that a combined broadcasting protocol that simultaneously uses both traditional rumour spreading and agent-based dissemination can be fast on a larger range of topologies than each of its components separately.
Keywords
random walks, information dissemination, networks, rumour spreading, multi-agent
Sponsorship
Gates Cambridge Trust, St John's College Benefactors' Scholarship
Identifiers
This record's DOI: https://doi.org/10.17863/CAM.77947
Statistics
Total file downloads (since January 2020). For more information on metrics see the
IRUS guide.
Recommended or similar items
The current recommendation prototype on the Apollo Repository will be turned off on 03 February 2023. Although the pilot has been fruitful for both parties, the service provider IKVA is focusing on horizon scanning products and so the recommender service can no longer be supported. We recognise the importance of recommender services in supporting research discovery and are evaluating offerings from other service providers. If you would like to offer feedback on this decision please contact us on: support@repository.cam.ac.uk