A ROUTING ALGORITHM FOR THE STAR INTERCONNECTION NETWORK IN THE PRESENCE OF FAULTS

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

REZAZAD M.; SARBAZI AZAD hamid

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING Year:2003 | Volume:1 | Issue:4 (b) Page(s): 11-18

Download Full-Text

Persian Verion

View:

1,501

Download:

Cites:

Information Journal Paper

Title

A ROUTING ALGORITHM FOR THE STAR INTERCONNECTION NETWORK IN THE PRESENCE OF FAULTS

Author(s)

REZAZAD M. | SARBAZI AZAD hamid | Issue Writer Certificate

Keywords

MULTICOMPUTERSQ4

INTERCONNECTION NETWORKSQ4

STARSQ4

HYPERCUBEQ4

FAULT-TOLERANT ROUTINGQ4

PERFORMANCE COMPARISONQ4

Abstract

This paper presents a fault tolerant routing algorithm for the star graph. The suggested algorithm is based on the concept of unsafety vectors, originally proposed for HYPERCUBEs. In this algorithm, each node starts by computing a first level unsafety set, composed of the set of unreachable neighbors. It then performs some exchanges with its neighbors to determine the unsafety nodes. After that, all nodes have the addresses of all faulty nodes. Based on the information gathered in each node, fault tolerant routing between a source node and a destination node is realized. We conducted a PERFORMANCE COMPARISON between the star and HYPERCUBE graph using the unsafety vectors routing algorithm under different working conditions. The results obtained through simulation experiments reveal that the HYPERCUBE is of superior performance compared to the star graph in the presence of low fault rates. But its performance under high fault rates falls short of that of the star graph.

Cites

No record.

References

No record.

Cite

APA: Copy

REZAZAD, M., & SARBAZI AZAD, hamid. (2003). A ROUTING ALGORITHM FOR THE STAR INTERCONNECTION NETWORK IN THE PRESENCE OF FAULTS. THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING, 1(4 (b)), 11-18. SID. https://sid.ir/paper/70638/en

Vancouver: Copy

REZAZAD M., SARBAZI AZAD hamid. A ROUTING ALGORITHM FOR THE STAR INTERCONNECTION NETWORK IN THE PRESENCE OF FAULTS. THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING[Internet]. 2003;1(4 (b)):11-18. Available from: https://sid.ir/paper/70638/en

IEEE: Copy

M. REZAZAD, and hamid SARBAZI AZAD, “A ROUTING ALGORITHM FOR THE STAR INTERCONNECTION NETWORK IN THE PRESENCE OF FAULTS,” THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING, vol. 1, no. 4 (b), pp. 11–18, 2003, [Online]. Available: https://sid.ir/paper/70638/en

Related Journal Papers