• Feb 07, 2023 News!JACN will adopt Article-by-Article Work Flow. The benefit of article-by-article workflow is that a delay with one article may not delay the entire issue. Once a paper steps into production, it will be published online soon.   [Click]
  • May 30, 2022 News!JACN Vol.10, No.1 has been published with online version.   [Click]
  • Dec 24, 2021 News!Volume 9 No 1 has been indexed by EI (inspec)!   [Click]
General Information
    • ISSN: 1793-8244 (Print)
    • Abbreviated Title:  J. Adv. Comput. Netw.
    • Frequency: Semiyearly
    • DOI: 10.18178/JACN
    • Editor-in-Chief: Professor Haklin Kimm
    • Executive Editor: Ms. Cherry Chan
    • Abstracting/ Indexing: EBSCO, ProQuest, and Google Scholar.
    • E-mail: jacn@ejournal.net
    • APC: 500USD
Professor Haklin Kimm
East Stroudsburg University, USA
I'm happy to take on the position of editor in chief of JACN. We encourage authors to submit papers on all aspects of computer networks.

JACN 2016 Vol.4(2): 100-106 ISSN: 1793-8244
DOI: 10.18178/JACN.2016.4.2.211

Stochastic Link-Fault-Tolerant Routing in Hypercubes

Lam Boi Ngoc, Bui Thi Thuan, Yuki Hirai, and Keiichi Kaneko

Abstract—Recently, parallel processing systems are enthusiastically studied, and many topologies for their inter- connection networks have been proposed. A hypercube was one of such popular topologies for interconnection networks, and it still provides fundamental structures for practical super- computers such as the NASA Pleiades and the NOAA Zeus and theoretical hierarchical topologies based on it. In this paper, we propose a link-fault-tolerant routing algorithm in hypercubes based on routing probabilities. The probability represents routing ability of a node for an arbitrary node located at a specific distance. Each node selects one of its neighbor nodes to send the message by considering their routing probabilities. We also conducted a computer experiment to evaluate performance of our algorithm.

Index Terms—Routing probability, fault tolerance, dependable computing, interconnection network, parallel processing.

Lam Boi Ngoc is with the Faculty of Mathematics and Computer Science, Ho Chi Minh University of Science, Ho Chi Minh City, Viet Nam (e-mail: boingoclam5893@gmail.com).
Bui Thi Thuan, Yuki Hirai, and Keiichi Kaneko are with Graduate School of Engineering, Tokyo University of Agriculture and Technology, Tokyo 184-8588, Japan (e-mail: k1kaneko@cc.tuat.ac.jp).


Cite:Lam Boi Ngoc, Bui Thi Thuan, Yuki Hirai, and Keiichi Kaneko, "Stochastic Link-Fault-Tolerant Routing in Hypercubes," Journal of Advances in Computer Networks vol. 4, no. 2, pp. 100-106, 2016.

Copyright © 2008-2024. Journal of Advances in Computer Networks.  All rights reserved.
E-mail: jacn@ejournal.net