Fault-tolerant broadcasting in binary jumping networks

  • Yijie Han
  • Yoshihide Igarashi
  • Kumiko Kanai
  • Kinya Miura
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 650)


The following results are shown. Let N be the number of processors in the network. When N is a power of 2, Iog2N+f+1 rounds suffice for broadcasting in the binary jumping network if at most f processors and/or links have failed and f≤log2N−1. For an arbitrary N, ⌈log2N⌋ + f+2 rounds suffice for broadcasting in the binary jumping network if at most f processors and/or links have failed and f≤⌈log2N⌋−2. It is also shown that the vertex connectivity of the binary jumping network with N nodes is ⌈log2N⌋.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Alon, N., Barak, A., Mauber, U.: On disseminating information reliably without broadcasting. the 7th International Conference on Distributed Computing Systems, 74–81 (1987)Google Scholar
  2. 2.
    Bermond, J-C., Peyrat, C.: Broadcasting in de Bruijn networks. Congressus numerantium 66 (1988) 283–292Google Scholar
  3. 3.
    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–260Google Scholar
  4. 4.
    Han, Y., Finkel, R.: An optimal scheme for disseminating information. Proceedings of 1988 International Conference on Parallel Processing, Chicago, Illinois, 198–203 (1988)Google Scholar
  5. 5.
    Imase, M., Soneoka, T., Okada, K.: Connectivity of regular directed graphs with small diameters. IEEE Trans. on Computers 34 (1985) 267–273Google Scholar
  6. 6.
    Johnsson, S. L., Ching-Tien Ho: Optimal broadcasting and personalized communication in hypercubes. IEEE Trans. on Computers 38 (1989) 1249–1268CrossRefGoogle Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    Liestman, A. L.: Fault-tolerant broadcast graphs. NETWORKS 15 (1985) 159–171Google Scholar
  9. 9.
    Ramanathan, P., Shin, K. G.: Reliable broadcasting in hypercube multiprocessors. IEEE Trans. on Computers 37 (1988) 1654–1657CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Yijie Han
    • 1
  • Yoshihide Igarashi
    • 2
  • Kumiko Kanai
    • 3
  • Kinya Miura
    • 2
  1. 1.Department of Computer ScienceUniversity of Hong KongHong Kong
  2. 2.Department of Computer ScienceGunma UniversityKiryuJapan
  3. 3.Research and Development CenterToshiba CorporationKawasakiJapan

Personalised recommendations