Abstract
Under the telephone model, the broadcasting time of most of the logarithmic networks (where the degree is fixed and the diameter logarithmic in the number of nodes) is not known, as the time of the known protocols is different from the known lower bounds. That is the case for de Bruijn. In this paper we present a technique enabling to derive better lower bounds on the broadcasting time of various networks, the technique is applied in the case of the de Bruijn graphs.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
George E. Andrews. The Theory of partitions, Encyclopedia of Mathematics and its applications. Volume 2. Addison-Wesley Publishing Company, 1976. Section: Number Theory.
C. Berge. Graphes. North Holland, 1981.
J-C. Bermond, P. Hell, A.L. Liestman, and J.G. Peters. Broadcasting in bounded degree graphs. SIAM journal of Discrete Mathematics, 5:10–24, 1992.
J-C. Bermond and C. Peyrat. Broadcasting in de Bruijn networks. Proceedings of the 19-th Southeastern conference on combinatorics, Graph theory and Computing, Congressus Numerantium, 66, 267–282, 1988.
J-C. Bermond, A. Marchetti, and X. Munoz. Improved broadcasting protocols for line digraphs. submitted to EUROPAR 96
J-C. Bermond and S. Perennes. Efficient broadcasting protocols on the de Bruijn and similar networks. In Proceedings of SIRROCO'95, 1995.
J. de Rumeur. Communications dans les Réseaux de Processeurs. Masson, 1994. To be translated.
P. Fraigniaud and E. Lazard. Methods and problems of communication in usual networks. Discrete Applied Mathematics, 53, Special issue on ”Broadcasting and gossiping”:79–133, 1995.
D. Gardy. The asymptotic behaviour of coefficients of large power of functions. In Serie formelles et combinatoire algébrique, pages 237–248, 1992.
M-C. Heydemann, J. Opatrny, and D. Sotteau. Broadcasting and spanning trees in de Bruijn and Kautz networks. Discrete Applied Math., 27–28:297–317, 1992.
R. Klasing, B. Monien, R. Peine, and E. Stohr. Broadcasting and gossiping in the Butterfly and de Bruijn networks. In Spinger Verlag, editor, Proc. STACS'92, volume Lectures Notes in Computer Science 577, pages 351–362, 1992.
A.L. Liestman and J.G. Peters. Broadcast networks of bounded degree. SIAM Journal of Disc. Math., 1(4), 1988.
S. Perennes. Broadcasting and gossiping on de Bruijn, shuffle exchange and similar networks. Technical report 93–53, I3S, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Perennes, S. (1996). Lower bounds on broadcasting time of de Bruijn networks. In: Bougé, L., Fraigniaud, P., Mignotte, A., Robert, Y. (eds) Euro-Par'96 Parallel Processing. Euro-Par 1996. Lecture Notes in Computer Science, vol 1123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61626-8_42
Download citation
DOI: https://doi.org/10.1007/3-540-61626-8_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61626-9
Online ISBN: 978-3-540-70633-5
eBook Packages: Springer Book Archive