Abstract
This paper revisits the classical problem of multi-message broadcast: given an undirected network G, the objective is to deliver k messages, initially placed arbitrarily in G, to all nodes. Per round, one message can be sent along each edge. The standard textbook result is an \(O(D+k)\) round algorithm, where D is the diameter of G. This bound is existentially optimal, which means there exists a graph \(G'\) with diameter D over which any algorithm needs \(\varOmega (D+k)\) rounds.
In this paper, we seek the stronger notion of optimality—called universal optimality by Garay, Kutten, and Peleg [FOCS’93]—which is with respect to the best possible for graph G itself. We present a distributed construction that produces a k-message broadcast schedule with length roughly within an \(\tilde{O}(\log n)\) factor of the best possible for G, after \(\tilde{O}(D+k)\) pre-computation rounds.
Our approach is conceptually inspired by that of Censor-Hillel, Ghaffari, and Kuhn [SODA’14, PODC’14] of finding many essentially-disjoint trees and using them to parallelize the flow of information. One key aspect that our result improves is that our trees have sufficiently low diameter to admit a nearly-optimal broadcast schedule, whereas the trees obtained by the algorithms of Censor-Hillel et al. could have arbitrarily large diameter, even up to \(\Theta (n)\).
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
Censor-Hillel, K., Ghaffari, M., Kuhn, F.: Distributed connectivity decomposition. In: The Proc. of the Int’l Symp. on Princ. of Dist. Comp. (PODC), pp. 156–165 (2014)
Censor-Hillel, K., Ghaffari, M., Kuhn, F.: A new perspective on vertex connectivity. In: Pro. of ACM-SIAM Symp. on Disc. Alg. (SODA), pp. 546–561 (2014)
Das Sarma, A., Holzer, S., Kor, L., Korman, A., Nanongkai, D., Pandurangan, G., Peleg, D., Wattenhofer, R.: Distributed verification and hardness of distributed approximation. In: Proc. of the Symp. on Theory of Comp. (STOC), pp. 363–372 (2011)
Elkin, M.: A faster distributed protocol for constructing a minimum spanning tree. In: Pro. of ACM-SIAM Symp. on Disc. Alg. (SODA), pp. 359–368 (2004)
Gallager, R.G., Humblet, P.A., Spira, P.M.: A distributed algorithm for minimum-weight spanning trees. ACM Trans. on Prog. Lang. and Sys. 5(1), 66–77 (1983)
Garay, J., Kutten, S., Peleg, D.: A sub-linear time distributed algorithm for minimum-weight spanning trees. In: Proc. of the Symp. on Found. of Comp. Sci. (FOCS), pp. 659–668 (1993)
Kutten, S., Peleg, D.: Fast distributed construction of k-dominating sets and applications. In: The Proc. of the Int’l Symp. on Princ. of Dist. Comp. (PODC), pp. 238–251 (1995)
Nanongkai, D.: Distributed approximation algorithms for weighted shortest paths. In: Proc. of the Symp. on Theory of Comp. (STOC), pp. 565–573 (2014)
Nesetril, J., Milkova, E., Nesetrilova, H.: Otakar boruvka on minimum spanning tree problem translation of both the 1926 papers, comments, history. Discrete Mathematics 233(1), 3–36 (2001)
Peleg, D.: Distributed Computing: A Locality-sensitive Approach. Society for Industrial and Applied Mathematics, Philadelphia (2000)
Peleg, D., Rubinovich, V.: A near-tight lower bound on the time complexity of distributed MST construction. In: Proc. of the Symp. on Found. of Comp. Sci. (FOCS) (1999)
Plotkin, S.A., Shmoys, D.B., Tardos, É.: Fast approximation algorithms for fractional packing and covering problems. Mathematics of Operations Research 20(2), 257–301 (1995)
Topkis, D.M.: Concurrent broadcast for information dissemination. IEEE Transactions on Software Engineering 10, 1107–1112 (1985)
Young, N.E.: Sequential and parallel algorithms for mixed packing and covering. In: Proc. of the Symp. on Found. of Comp. Sci. (FOCS), pp. 538–546. IEEE (2001)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ghaffari, M. (2015). Distributed Broadcast Revisited: Towards Universal Optimality. In: Halldórsson, M., Iwama, K., Kobayashi, N., Speckmann, B. (eds) Automata, Languages, and Programming. ICALP 2015. Lecture Notes in Computer Science(), vol 9135. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-47666-6_51
Download citation
DOI: https://doi.org/10.1007/978-3-662-47666-6_51
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-47665-9
Online ISBN: 978-3-662-47666-6
eBook Packages: Computer ScienceComputer Science (R0)