Abstract
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 design and analysis of distributed random walk algorithms in dynamic networks. We then develop a fast distributed random walk based algorithm that runs in \(\tilde{O}(\sqrt{\tau \Phi})\) rounds (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 \(\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)-time fully-distributed token forwarding algorithm that improves over the previous-best O(nk) round distributed algorithm [Kuhn et al., STOC 2010], although in an oblivious adversary model.
Supported in part by the following research grants: Nanyang Technological University grant M58110000, Singapore Ministry of Education Academic Research Fund Tier 2 grant MOE2010-T2-2-082, and a grant from the US-Israel Binational Science Foundation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alon, N., Avin, C., Koucký, M., Kozma, G., Lotker, Z., Tuttle, M.R.: Many random walks are faster than one. In: SPAA, pp. 119–128 (2008)
Augustine, J., Pandurangan, G., Robinson, P., Upfal, E.: Towards robust and efficient computation in dynamic peer-to-peer networks. In: SODA (2012)
Avin, C., Koucký, M., Lotker, Z.: How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs). In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 121–132. Springer, Heidelberg (2008)
Baumann, H., Crescenzi, P., Fraigniaud, P.: Parsimonious flooding in dynamic graphs. In: PODC, pp. 260–269 (2009)
Berenbrink, P., Czyzowicz, J., Elsässer, R., Gąsieniec, L.: Efficient Information Exchange in the Random Phone-Call Model. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 127–138. Springer, Heidelberg (2010)
Bui, M., Bernard, T., Sohier, D., Bui, A.: Random Walks in Distributed Computing: A Survey. In: Böhme, T., Larios Rosillo, V.M., Unger, H., Unger, H. (eds.) IICS 2004. LNCS, vol. 3473, pp. 1–14. Springer, Heidelberg (2006)
Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. CoRR, abs/1012.0009 (2010)
Clementi, A., Macci, C., Monti, A., Pasquale, F., Silvestri, R.: Flooding time in edge-markovian dynamic graphs. In: PODC, pp. 213–222 (2008)
Clementi, A., Silvestri, R., Trevisan, L.: Information spreading in dynamic graphs. In: PODC (2012)
Das Sarma, A., Molla, A., Pandurangan, G.: Fast Distributed Computation in Dynamic Networks via Random Walks (May 2012), http://arxiv.org/abs/1205.5525
Das Sarma, A., Nanongkai, D., Pandurangan, G.: Fast distributed random walks. In: PODC (2009)
Das Sarma, A., Nanongkai, D., Pandurangan, G., Tetali, P.: Efficient distributed random walks with applications. In: PODC, pp. 201–210 (2010)
Dutta, C., Pandurangan, G., Rajaraman, R., Sun, Z.: Information spreading in dynamic networks. CoRR, abs/1112.0384 (2011)
Kuhn, F., Lynch, N., Oshman, R.: Distributed computation in dynamic networks. In: STOC (2010)
Kuhn, F., Oshman, R., Moses, Y.: Coordinated consensus in dynamic networks. In: PODC, pp. 1–10 (2011)
Lynch, N.: Distributed Algorithms. Morgan Kaufmann Publishers, San Mateo (1996)
Lyons, R.: Asymptotic enumeration of spanning trees. Combinatorics, Probability & Computing 14(4), 491–522 (2005)
Nanongkai, D., Das Sarma, A., Pandurangan, G.: A tight unconditional lower bound on distributed randomwalk computation. In: PODC, pp. 257–266 (2011)
Pandurangan, G., Khan, M.: Theory of communication networks. In: Algorithms and Theory of Computation Handbook, 2nd edn. CRC Press (2009)
Pandurangan, G., Raghavan, P., Upfal, E.: Building low-diameter peer-to-peer networks. In: FOCS (2001)
Peleg, D.: Distributed computing: a locality-sensitive approach. SIAM, Philadelphia (2000)
Tel, G.: Introduction to Distributed Algorithms. Cambridge University Press, UK (1994)
Zhong, M., Shen, K.: Random walk based node sampling in self-organizing networks. Operating Systems Review 40(3), 49–55 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Das Sarma, A., Molla, A.R., Pandurangan, G. (2012). Fast Distributed Computation in Dynamic Networks via Random Walks. In: Aguilera, M.K. (eds) Distributed Computing. DISC 2012. Lecture Notes in Computer Science, vol 7611. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33651-5_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-33651-5_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33650-8
Online ISBN: 978-3-642-33651-5
eBook Packages: Computer ScienceComputer Science (R0)