Skip to main content
Springer Nature Link
Log in

Broadcast in the Locally k-Subcube-Connected Hypercube Networks with Faulty Tolerance

  • Conference paper
Networking and Mobile Computing (ICCNMC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3619))

Included in the following conference series:

Abstract

It is of great interests to develop algorithms to find the routing path for broadcast in a hypercube with a large number of faulty nodes while the network remains connected. In this paper, we introduce a broadcasting algorithm on locally k-subcube-connected hypercube networks under the above situation, based on the conception of locally k-subcube-connected hypercube. Our algorithm is distributed and local-information-based, namely, in the network each node knows only its neighbors’ status and no global information is required in the network. Our broadcasting algorithm can tolerant the upper bound 2n − − 1-2n − − k for faulty nodes under the condition of locally k-subcube-connected hypercube. This is a much larger bound on the number of faulty nodes compared to the previous broadcast algorithms which the number of faulty nodes be bounded by O(n) in hypercube Hn. More over, our algorithm can find nearly optimal length path in hypercube Hn in linear time.

This work supported by the Natural Science Foundation of China under Grant No.60373063.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Chen, J., Wang, G., Chen, S.: Locally Subcube-Connected Hypercube Networks: Theoretical Analysis and Experimental Results. IEEE Transactions on Computers 51(5), 530–540 (2002)

    Article  Google Scholar 

  2. Lee, T.C., Hayes, J.P.: A Fault-Tolerant Communication Scheme for Hypercube Computer. IEEE Trans. Computers 41(10), 1242–1256 (1992)

    Article  MathSciNet  Google Scholar 

  3. Chiu, G.-M., Wu, S.-P.: A Fault-Tolerant Routing Strategy in Hypercube Multicomputers. IEEE Trans. Computers 45(2), 143–155 (1996)

    Article  MATH  Google Scholar 

  4. Chen, M.-S., Shin, K.G.: Adaptive Fault-Tolerant Routing in Hypercube Multicomputers. IEEE Transactions on Computers 39(12) (1990)

    Google Scholar 

  5. Esfahanian, A.H.: Generalized Measures of Fault Tolerance with Application to n-Cube Networks. IEEE Trans. Computers 38(11), 1586–1591 (1989)

    Article  Google Scholar 

  6. Latifi, S.: Combinatorial Analysis of the Fault Diameter of the n-cube. IEEE Trans.Computers 42(1), 27–33 (1993)

    Article  MathSciNet  Google Scholar 

  7. Gu, Q.-P., Peng, S.: Optimal Algorithms for Node-to-Node Fault Tolerant Routing in Hypercubes. The Computer J. 39(7), 626–629 (1996)

    Article  Google Scholar 

  8. Gu, Q.-P., Peng, S.: k-Pairwise Cluster Fault Tolerant Routing in Hypercubes. IEEE Trans. Computers 46(9), 1042–1049 (1997)

    Article  MathSciNet  Google Scholar 

  9. Wu, J., Fernandez, E.B.: Reliable broadcasting in faulty hypercube computers. Microprocessing and Microprogramming 39, 43–53 (1993)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Shandong Normal University, Ji’nan, 250014, China

    Fangai Liu & Ying Song

Authors
  1. Fangai Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ying Song
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. National Laboratory for Parallel and Distributed Processing, NUDT, 410073, Changsha, Hunan, China

    Xicheng Lu

  2. Department of Radiology, State University of New York at Stony Brook, L-4, 120 Health Sciences Center, 11793-8460, Stony Brook, New York,  

    Wei Zhao

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, F., Song, Y. (2005). Broadcast in the Locally k-Subcube-Connected Hypercube Networks with Faulty Tolerance. In: Lu, X., Zhao, W. (eds) Networking and Mobile Computing. ICCNMC 2005. Lecture Notes in Computer Science, vol 3619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11534310_34

Download citation

  • DOI: https://doi.org/10.1007/11534310_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28102-3

  • Online ISBN: 978-3-540-31868-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics