Abstract
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized broadcasting protocol: At some time t an information r is placed at one of the nodes of a graph G. In the succeeding steps, each informed node chooses one neighbor, independently and uniformly at random, and informs this neighbor by sending a copy of r to it.
First, we consider the relationship between randomized broadcasting and random walks on graphs. In particular, we prove that the runtime of the algorithm described above is upper bounded by the corresponding mixing time, up to a logarithmic factor. One key ingredient of our proofs is the analysis of a continuous-type version of the afore mentioned algorithm, which might be of independent interest. Then, we introduce a general class of Cayley graphs, including (among others) Star graphs, Transposition graphs, and Pancake graphs. We show that randomized broadcasting has optimal runtime on all graphs belonging to this class. Finally, we develop a new proof technique by combining martingale tail estimates with combinatorial methods. Using this approach, we show the optimality of our algorithm on another Cayley graph and obtain new knowledge about the runtime distribution on several Cayley graphs.
This work was partially supported by German Science Foundation (DFG) Research Training Group GK-693 of the Paderborn Institute for Scientific Computation (PaSCo) and by the EU within the 6th Framework Programme under contract 001907 “Dynamically Evolving, Large Scale Information Systems” (DELIS).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Akers, S., Harel, D., Krishnamurthy, B.: The star graph: An attractive alternative to the n-cube. In: Proc. of ICPP’87, pp. 393–400 (1987)
Akers, S., Krishnamurthy, B.: A group-theoretic model for symmetric innterconnection networks. In: Proc. of ICPP’86, pp. 555–565 (1986)
Alon, N., Spencer, J.H.: The Probabilistic Method. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, Chichester (2000)
Benjamini, I., et al.: Mixing times of the biased card shuffling and the asymmetric exclusion process. Transactions of the American Mathematical Society 357, 3013–3029 (2005)
Biggs, N.: Algebraic Graph Theory. Cambridge University Press, Cambridge (1993)
Chernoff, H.: A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Stat. 23, 493–507 (1952)
Chung, F.: Spectral Graph Theory. CBMS Regional conference series in mathematics, vol. 92. American Mathematical Society, Providence (1997)
Chung, F., Lu, L.: Concentration inequalities and martingale inequalities — a survey. In: Internet Mathematics (to appear)
Demers, A., et al.: Epidemic algorithms for replicated database maintenance. In: Proc. of PODC’87, pp. 1–12 (1987)
Diaconis, P.: Group Representations in Probability and Statistics. Lecture notes-Monograph Series, vol. 11 (1988)
Diekmann, R., Frommer, A., Monien, B.: Efficient schemes for nearest neighbor load balancing. Parallel Computing 25(7), 789–812 (1999)
Elsässer, R., Sauerwald, T.: On randomized broadcasting in star graphs. In: Kratsch, D. (ed.) WG 2005. LNCS, vol. 3787, pp. 307–318. Springer, Heidelberg (2005)
Elsässer, R., Sauerwald, T.: On the runtime and robustness of randomized broadcasting. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, pp. 349–358. Springer, Heidelberg (2006)
Feige, U., et al.: Randomized broadcast in networks. Random Structures and Algorithm 1(4), 447–460 (1990)
Gasieniec, L., Pelc, A.: Adaptive broadcasting with faulty nodes. Parallel Computing 22, 903–912 (1996)
Habib, M., et al.: Probabilistic Methods for Algorithmic Discrete Mathematics. In: Algorithms and Combinatorics (1991)
Hagerup, T., Rüb, C.: A guided tour of chernoff bounds. Information Processing Letters 36(6), 305–308 (1990)
Hromkovič, J., et al.: Dissemination of Information in Communication Networks. Springer, Heidelberg (2005)
Leighton, F., Maggs, B., Sitamaran, R.: On the fault tolerance of some popular bounded-degree networks. In: Proc. of FOCS’92, pp. 542–552 (1992)
Lubotzky, A., Phillips, R., Sarnak, P.: Ramanujan graphs. Combinatorica 8(3), 261–277 (1988)
Pittel, B.: On spreading rumor. SIAM Journal on Applied Mathematics 47(1), 213–223 (1987)
Sinclair, A., Jerrum, M.: Approximate counting, uniform generation, and rapidly mixing markov chains. Inform. and Comput. 82, 93–113 (1989)
Wilson, D.: Mixing times of lozenge tiling and card shuffling markov chains. Annals of Applied Probability 14, 274–325 (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Elsässer, R., Sauerwald, T. (2007). Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs. In: Thomas, W., Weil, P. (eds) STACS 2007. STACS 2007. Lecture Notes in Computer Science, vol 4393. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70918-3_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-70918-3_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70917-6
Online ISBN: 978-3-540-70918-3
eBook Packages: Computer ScienceComputer Science (R0)