On the Power of Randomization in Distributed Algorithms in Dynamic Networks with Adaptive Adversaries*
| dc.contributor.author | Jahja, Irvan | |
| dc.contributor.author | Yu, Haifeng | |
| dc.contributor.author | Hou, Ruomu | |
| dc.date.accessioned | 2020-10-05T01:48:52Z | |
| dc.date.available | 2020-10-05T01:48:52Z | |
| dc.date.issued | 2020-09-16 | |
| dc.description.abstract | This paper investigates the power of randomization in general distributed algorithms in dynamic networks where the network’s topology may evolve over time, as determined by some adaptive adversary. In such a context, randomization may help algorithms to better deal with i) “bad” inputs to the algorithm, and ii) evolving topologies generated by “bad” adaptive adversaries. We prove that randomness offers limited power to better deal with “bad” adaptive adversary. We define a simple notion of prophetic adversary for determining the evolving topologies. Such an adversary accurately predicts all randomness in the algorithm beforehand, and hence the randomness will be useless against “bad” prophetic adversaries. Given a randomized algorithm P whose time complexity satisfies some mild conditions, we prove that P can always be converted to a new algorithm Q with comparable time complexity, even when Q runs against prophetic adversaries. This | en_US |
| dc.identifier.uri | https://dl.comp.nus.edu.sg/xmlui/handle/1900.100/9115 | |
| dc.language.iso | en | en_US |
| dc.relation.ispartofseries | Technical Report;TRA9/20 | |
| dc.title | On the Power of Randomization in Distributed Algorithms in Dynamic Networks with Adaptive Adversaries* | en_US |
| dc.type | Technical Report | en_US |