Abstract
This paper initiates the study of the impact of failures on the fundamental problem of information spreading in the Vertex-Congest model, in which in every round, each of the n nodes sends the same O(logn)-bit message to all of its neighbors.
Our contribution to coping with failures is twofold. First, we prove that the randomized algorithm which chooses uniformly at random the next message to forward is slow, requiring \(\Omega(n/\sqrt{k})\) rounds on some graphs, which we denote by G n,k , where k is the vertex-connectivity.
Second, we design a randomized algorithm that makes dynamic message choices, with probabilities that change over the execution. We prove that for G n,k it requires only a near-optimal number of O(nlog3 n/k) rounds, despite a rate of q = O(k/nlog3 n) failures per round. Our technique of choosing probabilities that change according to the execution is of independent interest.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ahlswede, R., Cai, N., Li, S.Y., Yeung, R.W.: Network information flow. IEEE Transactions on Information Theory 46(4), 1204–1216 (2000)
Censor-Hillel, K., Ghaffari, M., Kuhn, F.: Distributed connectivity decomposition. In: Proceedings of the 33rd ACM Symposium on Principles of Distributed Computing, PODC, pp. 156–165 (2014)
Censor-Hillel, K., Ghaffari, M., Kuhn, F.: A new perspective on vertex connectivity. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 546–561 (2014). http://epubs.siam.org/doi/abs/10.1137/1.9781611973402.41
Censor-Hillel, K., Giakkoupis, G.: Fast and robust information spreading (2012) (unpublished manuscript)
Censor-Hillel, K., Toukan, T.: On fast and robust information spreading in the vertex-congest model (2015). http://arxiv.org/abs/1507.01181
Deb, S., Médard, M., Choute, C.: Algebraic gossip: A network coding approach to optimal multiple rumor mongering. IEEE Transactions on Information Theory 52(6), 2486–2507 (2006)
Elsässer, R., Sauerwald, T.: Cover time and broadcast time. In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, STACS, pp. 373–384 (2009)
Feige, U., Peleg, D., Raghavan, P., Upfal, E.: Randomized broadcast in networks. Random Structures & Algorithms 1(4), 447–460 (1990)
Haeupler, B.: Analyzing network coding gossip made easy. In: Proceedings of the 43rd Annual ACM Symposium on Theory of Computing, STOC, pp. 293–302 (2011)
Ho, T., Koetter, R., Medard, M., Karger, D.R., Effros, M.: The benefits of coding over routing in a randomized setting. In: Proceedings of the IEEE International Symposium on Information Theory, p. 442 (2003)
Ho, T., Médard, M., Koetter, R., Karger, D.R., Effros, M., Shi, J., Leong, B.: A random linear network coding approach to multicast. IEEE Transactions on Information Theory 52(10), 4413–4430 (2006)
Kuhn, F., Lynch, N., Newport, C.: The abstract MAC layer. Distributed Computing 24(3-4), 187–206 (2011). http://dx.doi.org/10.1007/s00446-010-0118-0
Li, S.Y., Yeung, R.W., Cai, N.: Linear network coding. IEEE Transactions on Information Theory 49(2), 371–381 (2003)
Menger, K.: Zur allgemeinen kurventheorie. Fundamenta Mathematicae 10(1), 96–115 (1927)
Mitzenmacher, M., Upfal, E.: Probability and computing: Randomized algorithms and probabilistic analysis. Cambridge University Press (2005)
Mosk-Aoyama, D., Shah, D.: Information dissemination via network coding. In: 2006 IEEE International Symposium on Information Theory, pp. 1748–1752. IEEE (2006)
Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM (2000)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Censor-Hillel, K., Toukan, T. (2015). On Fast and Robust Information Spreading in the Vertex-Congest Model. In: Scheideler, C. (eds) Structural Information and Communication Complexity. SIROCCO 2015. Lecture Notes in Computer Science(), vol 9439. Springer, Cham. https://doi.org/10.1007/978-3-319-25258-2_19
Download citation
DOI: https://doi.org/10.1007/978-3-319-25258-2_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-25257-5
Online ISBN: 978-3-319-25258-2
eBook Packages: Computer ScienceComputer Science (R0)