2 research outputs found

    Fast Distributed Computation in Dynamic Networks via Random Walks

    Full text link
    The paper investigates efficient distributed computation in dynamic networks in which the network topology changes (arbitrarily) from round to round. Our first contribution is a rigorous framework for 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~(τΦ)\tilde{O}(\sqrt{\tau \Phi}) rounds (with high probability), where τ\tau is the dynamic mixing time and Φ\Phi is the dynamic diameter of the network respectively, and returns a sample close to a suitably defined stationary distribution of the dynamic network. We also apply our fast random walk algorithm to devise fast distributed algorithms for two key problems, namely, information dissemination and decentralized computation of spectral properties in a 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, kk-gossip, there are kk pieces of information (or tokens) that are initially present in some nodes and the problem is to disseminate the kk tokens to all nodes. We present a random-walk based algorithm that runs in O~(min{n1/3k2/3(τΦ)1/3,nk})\tilde{O}(\min\{n^{1/3}k^{2/3}(\tau \Phi)^{1/3}, nk\}) rounds (with high probability). To the best of our knowledge, this is the first o(nk)o(nk)-time fully-distributed token forwarding algorithm that improves over the previous-best O(nk)O(nk) round distributed algorithm [Kuhn et al., STOC 2010], although in an oblivious adversary model. Our final contribution is a simple and fast distributed algorithm for estimating the dynamic mixing time and related spectral properties of the underlying dynamic network

    Distributed Agreement in Dynamic Peer-to-Peer Networks

    Full text link
    Motivated by the need for robust and fast distributed computation in highly dynamic Peer-to-Peer (P2P) networks, we study algorithms for the fundamental distributed agreement problem. P2P networks are highly dynamic networks that experience heavy node {\em churn}. Our goal is to design fast algorithms (running in a small number of rounds) that guarantee, despite high node churn rate, that almost all nodes reach a stable agreement. Our main contributions are randomized distributed algorithms that guarantee {\em stable almost-everywhere agreement} with high probability even under high adversarial churn in a polylogarithmic number of rounds: 1. An O(log2n)O(\log^2 n)-round (nn is the stable network size) randomized algorithm that achieves almost-everywhere agreement with high probability under up to {\em linear} churn {\em per round} (i.e., ϵn\epsilon n, for some small constant ϵ>0\epsilon > 0), assuming that the churn is controlled by an oblivious adversary (that has complete knowledge and control of what nodes join and leave and at what time and has unlimited computational power, but is oblivious to the random choices made by the algorithm). Our algorithm requires only polylogarithmic in nn bits to be processed and sent (per round) by each node. 2. An O(logmlog3n)O(\log m\log^3 n)-round randomized algorithm that achieves almost-everywhere agreement with high probability under up to ϵn\epsilon \sqrt{n} churn per round (for some small ϵ>0\epsilon > 0), where mm is the size of the input value domain, that works even under an adaptive adversary (that also knows the past random choices made by the algorithm). This algorithm requires up to polynomial in nn bits (and up to O(logm)O(\log m) bits) to be processed and sent (per round) by each node.Comment: to appear at the Journal of Computer and System Sciences; preliminary version appeared at SODA 201
    corecore