Abstract
This work deals with a broadcasting on generalized de Bruijn digraphs. Broadcasting on digraphs corresponds to one on networks with monodirection communication links in practice. The efficiency of broadcasting is affected by network topology. Generalized de Bruijn digraph is one of useful network models. We propose protocols for broadcasting on generalized de Bruijn digraphs using Kronecker product of graphs. The protocol presented in this paper constructs a k-ramified tree.
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
J.-C. Bermond and C. Peyrat, De Bruijn and Kautz networks: a competitor for the hypercube?, Hypercube and Distributed Computers, (F. Andrè and J. P. Verjus, Eds.), Elsevier North-Hollamd, Amsterdam, 1989.
J.-C. Bermond and P. Fraigniaud, Broadcasting and gossiping in de Bruijn networks, SIAM J. Comp., 23(1994) 212–225.
J. Bruck, R. Cypher and C-H Ho, Multiple message Broadcasting with generalized Fibonacci trees, 4th IEEE Symposium on parallel and Distributed Processing, (1992) 424–431.
G.-M. Chiu, A fault-tolerant broadcasting algorithm for hypercubes, Info. Processing letters, 66(1998) 93–99.
K. Diks, S. Dobrev, E. Kranakis, A. Pelc and P. Ružička, Broadcasting in unlabeled hypercubes with a linear number of messages, Info. Processing letters, 66(1998) 181–186.
D. Z. Du and F. K. Hwang, Generalized de Bruijn digraphs, Networks, 18(1988) 27–38.
C. GowriSankaran, Broadcasting on recursively decomposable Cayley graphs, Discrete Appl. Math., 53(1994) 171–182.
S. T. Hedetniemi, S. Hedetniemi and A. Liestman, A survey of gossiping and broadcasting in communication networks, Networks, 18(1986) 319–349.
M. Imase and M. Itoh, Design to minimize diameter on buildin-block network, IEEE Trans. Comp., C-30 (1981) 439–442.
M. Imase and M. Itoh, A design for directed graphs with minimum diameter, IEEE Trans. Comp., C-32 (1983) 782–784.
S. Johnsson and C.-T. Ho, Optimum broadcasting and personalized communication in hypercubes, IEEE Trans. Comp., C-38 (1989) 1249–1268.
M. Mora, O. Serra and M. A. Fiol, General properties of c-circulant digraphs, Ars Comb., 25C (1998) 241–252.
F. T. Leighton, Introduction to parallel algorithms and architectures: arrays · trees · hypercubes, Morgan Kaufmann, San Mateo, 1992.
S. M. Reddy, D. K. Pradhan and J. Kuhl, Directed graphs with minimal diameter and maximum node connectivity, School of Engineering Oakland Univ. Tech. Report, 1980.
P. J. Slater, E.J. Cockayne and S.T. Hedetniemi, Information dissemination in trees, SIAM J. Comp., 10 (1981) 692–701.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kikuchi, Y., Osawa, S., Shibata, Y. (2002). Broadcasting in Generalized de Bruijn Digraphs. In: Ibarra, O.H., Zhang, L. (eds) Computing and Combinatorics. COCOON 2002. Lecture Notes in Computer Science, vol 2387. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45655-4_23
Download citation
DOI: https://doi.org/10.1007/3-540-45655-4_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43996-7
Online ISBN: 978-3-540-45655-1
eBook Packages: Springer Book Archive