Abstract
The following results are shown. Let N be the number of processors in the network. When N is a power of 2, Iog2 N+f+1 rounds suffice for broadcasting in the binary jumping network if at most f processors and/or links have failed and f≤log2 N−1. For an arbitrary N, ⌈log2 N⌋ + f+2 rounds suffice for broadcasting in the binary jumping network if at most f processors and/or links have failed and f≤⌈log2 N⌋−2. It is also shown that the vertex connectivity of the binary jumping network with N nodes is ⌈log2 N⌋.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Alon, N., Barak, A., Mauber, U.: On disseminating information reliably without broadcasting. the 7th International Conference on Distributed Computing Systems, 74–81 (1987)
Bermond, J-C., Peyrat, C.: Broadcasting in de Bruijn networks. Congressus numerantium 66 (1988) 283–292
Carlsson S., Igarashi, Y., Kanai, K., Lingas, A., Miura, K., Petersson, O.: Information disseminating schemes for fault tolerance in hypercubes. IEICE Trans. on Fundamentals of Electronics, Communications and Computer Science E75-A (1992) 255–260
Han, Y., Finkel, R.: An optimal scheme for disseminating information. Proceedings of 1988 International Conference on Parallel Processing, Chicago, Illinois, 198–203 (1988)
Imase, M., Soneoka, T., Okada, K.: Connectivity of regular directed graphs with small diameters. IEEE Trans. on Computers 34 (1985) 267–273
Johnsson, S. L., Ching-Tien Ho: Optimal broadcasting and personalized communication in hypercubes. IEEE Trans. on Computers 38 (1989) 1249–1268
Kanai, K., Miura, K., Igarashi, Y.: Fault tolerance of Han-Finkel's scheme for disseminating information. IPSJ Technical Report, Algorithms 91-AL-24-2 (1991)
Liestman, A. L.: Fault-tolerant broadcast graphs. NETWORKS 15 (1985) 159–171
Ramanathan, P., Shin, K. G.: Reliable broadcasting in hypercube multiprocessors. IEEE Trans. on Computers 37 (1988) 1654–1657
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Han, Y., Igarashi, Y., Kanai, K., Miura, K. (1992). Fault-tolerant broadcasting in binary jumping networks. In: Ibaraki, T., Inagaki, Y., Iwama, K., Nishizeki, T., Yamashita, M. (eds) Algorithms and Computation. ISAAC 1992. Lecture Notes in Computer Science, vol 650. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56279-6_67
Download citation
DOI: https://doi.org/10.1007/3-540-56279-6_67
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56279-5
Online ISBN: 978-3-540-47501-9
eBook Packages: Springer Book Archive