Distributed computation in dynamic networks via random walks

The paper investigates efficient distributed computation in dynamic networks in which the network topology changes (arbitrarily) from round to round. Random walks are a fundamental primitive in a wide variety of network applications; the local and lightweight nature of random walks is especially useful for providing uniform and efficient solutions to distributed control of dynamic networks. Given their applicability in dynamic networks, we focus on developing fast distributed algorithms for performing random walks in such networks.Our first contribution is a rigorous framework for the design and analysis of distributed random walk algorithms in dynamic networks. We then develop a fast distributed random-walk based algorithm that runs in O˜(τΦ) rounds2 (with high probability), where τ is the dynamic mixing time and Φ is the dynamic diameter of the network, respectively, and returns a sample close to a suitably defined stationary distribution of the dynamic network.Our next contribution is a fast distributed algorithm for the fundamental problem of information dissemination (also called as gossip) in a dynamic network. In gossip, or more generally, k-gossip, there are k pieces of information (or tokens) that are initially present in some nodes and the problem is to disseminate the k   tokens to all nodes. We present a random-walk based algorithm that runs in O˜(min⁡{n1/3k2/3(τΦ)1/3,kΦ}) rounds (with high probability). This is the first o(kΦ)o(kΦ)-time fully-distributed token forwarding   algorithm (on certain graph families) that improves over the previous-best O(kΦ)O(kΦ) round distributed algorithm (Kuhn et al. [24]), although in an oblivious adversary model.The random walk framework developed in this paper has also subsequently proved useful in developing efficient storage and search algorithms as well as developing fast byzantine agreement algorithms in dynamic networks.