Quick project goal:The main goal of this project is to study the information dissemination task of $k$-gossip under smoothing. $k$-gossip is a fundamental primitive in distributed networks and can be used to enforce data replication which has applications in the very popular blockchain networks. I want to see how $k$-gossip's lower and upper bounds are affected in dynamically changing networks if we introduce smoothing to the network graph for each round of synchronous communication. This will give us a better understanding of how efficient our current algorithms are on "realistic" inputs for $k$-gossip.
The revised project aims are as follows:
- Present known unsmoothed and smoothed lower and upper bounds for flooding and the maximum hitting time of a random walk against oblivious adversaries, as an introduction to the techniques used for the later analysis of $k$-gossip.
- Present/Develop unsmoothed lower and upper bounds for $k$-gossip against an oblivious adversary.
- Present the known unsmoothed lower and upper bounds for $k$-gossip against an adaptive adversary.
- Use 2 to develop smoothed lower and upper bounds for $k$-gossip against an oblivious adversary.
- Use 3 to develop smoothed lower and upper bounds for $k$-gossip against an adaptive adversary.
- Presented $\Omega(n^{2/3}/k^{1/3})$ smoothed lower bound for flooding against an oblivious adversary. (part of aim 1)
- Presented $\Omega(n\log{k})$ unsmoothed lower bound for $k$-gossip against an adaptive adversary. (part of aim 3)
- Complete aim 1.
- Complete aim 2.
- Complete aim 3.
No comments:
Post a Comment