Abstract
This paper revisits the study of (minimum) broadcast graphs, i.e., graphs enabling fast information dissemination from every source node to all the other nodes (and having minimum number of edges for this property). This study is performed in the framework of compact distributed data structures, that is, when the broadcast protocols are bounded to be encoded at each node as an ordered list of neighbors specifying, upon reception of a message, in which order this message must be passed to these neighbors. We show that this constraint does not limit the power of broadcast protocols, as far as the design of (minimum) broadcast graphs is concerned. Specifically, we show that, for every n, there are n-node graphs for which it is possible to design protocols encoded by lists yet enabling broadcast in \(\lceil \log _2n\rceil \) rounds from every source, which is optimal even for general (i.e., non space-constrained) broadcast protocols. Moreover, we show that, for every n, there exist such graphs with the additional property that they are asymptotically as sparse as the sparsest graphs for which \(\lceil \log _2n\rceil \)-round broadcast protocols exist, up to a constant multiplicative factor. Concretely, these graphs have \(O(n\cdot L(n))\) edges, where L(n) is the number of leading 1 s in the binary representation of \(n-1\), and general minimum broadcast graphs are known to have \(\varOmega (n\cdot L(n))\) edges.
P. Fraigniaud—Additional support from ANR project DUCAT (ref. ANR-20-CE48-0006).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Diks, K., Pelc, A.: Broadcasting with universal lists. Networks 27(3), 183–196 (1996)
Farley, A.M., Hedetniemi, S.T., Mitchell, S.M., Proskurowski, A.: Minimum broadcast graphs. Discret. Math. 25(2), 189–193 (1979)
Fraigniaud, P., Lazard, E.: Methods and problems of communication in usual networks. Discret. Appl. Math. 53(1–3), 79–133 (1994)
Gholami, M.S., Harutyunyan, H.A.: Broadcast graphs with nodes of limited memory. In: 13th International Conference on Complex Networks (CompleNet), pp. 29–42 (2022)
Gholami, M.S., Harutyunyan, H.A.: Fully-adaptive model for broadcasting with universal lists. In: 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), pp. 92–99 (2022)
Grigni, M., Peleg, D.: Tight bounds on minimum broadcast networks. SIAM J. Discret. Math. 4(2), 207–222 (1991)
Harutyunyan, H.A., Liestman, A.L., Makino, K., Shermer, T.C.: Nonadaptive broadcasting in trees. Networks 57(2), 157–168 (2011)
Hedetniemi, S.M., Hedetniemi, S.T., Liestman, A.L.: A survey of gossiping and broadcasting in communication networks. Networks 18(4), 319–349 (1988)
Hromkovic, J., Klasing, R., Pelc, A., Ruzicka, P., Unger, W.: Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg (2005). https://doi.org/10.1007/b137871
Kim, J., Chwa, K.: Optimal broadcasting with universal lists based on competitive analysis. Networks 45(4), 224–231 (2005)
Rosenthal, A., Scheuermann, P.: Universal rankings for broadcasting in tree networks. In: 25th Allerton Conference on Communication, Control and Computing, pp. 641–649 (1987)
Slater, P.J., Cockayne, E.J., Hedetniemi, S.T.: Information dissemination in trees. SIAM J. Comput. 10(4), 692–701 (1981)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Fraigniaud, P., Harutyunyan, H.A. (2024). Source-Oblivious Broadcast. In: Chen, X., Li, B. (eds) Theory and Applications of Models of Computation. TAMC 2024. Lecture Notes in Computer Science, vol 14637. Springer, Singapore. https://doi.org/10.1007/978-981-97-2340-9_12
Download citation
DOI: https://doi.org/10.1007/978-981-97-2340-9_12
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-97-2339-3
Online ISBN: 978-981-97-2340-9
eBook Packages: Computer ScienceComputer Science (R0)