Sublinear Algorithms in T -interval Dynamic Networks
| dc.contributor.author | Jahja, Irvan | |
| dc.contributor.author | Yu, Haifeng | |
| dc.date.accessioned | 2020-06-23T04:34:10Z | |
| dc.date.available | 2020-06-23T04:34:10Z | |
| dc.date.issued | 2020-05-20 | |
| dc.description.abstract | We consider standard T -interval dynamic networks, under the synchronous timing model and the broadcast CONGEST model. In a T -interval dynamic network, the set of nodes is always fixed and there are no node failures. The edges in the network are always undirected, but the set of edges in the topology may change arbitrarily from round to round, as determined by some adversary and subject to the following constraint: For every T consecutive rounds, the topologies in those rounds must contain a common connected spanning subgraph. Let Hr to be the maximum (in terms of number of edges) such subgraph for round r through r +T − 1. We define the backbone diameter d of a T -interval dynamic network to be the maximum diameter of all such Hr ’s, for r ≥ 1. We use n to denote the number of nodes in the network. Within such a context, we consider a range of fundamental distributed computing problems including zount/Max/Median/Sum/LeaderElect/Consensus/ConfirmedFlood. Existing algorithms for these problems all have time complexity of Ω(n) rounds, even for T = ∞ and even when d is as small as O(1). This paper presents a novel O(d3 log2 n) deterministic algorithm for computing Count, for T -interval dynamic networks with T ≥ c · d2 log2 n. Here c is a (sufficiently large) constant independent of d, n, and T . To our knowledge, our algorithm is the very first such algorithm whose complexity does not contain a Θ(n) term. For d = O(na ) with constant a < 13, our deterministic algorithm has o(n) complexity, which is better than all (both randomized and deterministic) existing Count algorithms in this setting. For d = O(polylog(n)), our algorithm is exponentially faster. Following the frameworkof our Count algorithm, this paper further develops novel algorithms for solving Max/Median/Sum/LeaderElect/ Consensus/ ConfirmedFlood, while incurring either O(d3 log2 n) or O(d3 log3 n) complexity. Again, for all these problems, our algorithms are the first ones whose time complexity does not contain a Θ(n) term. | en_US |
| dc.identifier.uri | https://dl.comp.nus.edu.sg/xmlui/handle/1900.100/8459 | |
| dc.language.iso | en | en_US |
| dc.relation.ispartofseries | Technical Report;TRA5/20 | |
| dc.title | Sublinear Algorithms in T -interval Dynamic Networks | en_US |
| dc.type | Technical Report | en_US |