Fault tolerance for hypercube networks via independent spanning trees

Author

Umrao, L.S. ; Mahato, D.P. ; Singh, R.S.

Author_Institution

Dept. of Comput. Sci. & Eng., Indian Inst. of Technol. (BHU), Varanasi, India

fYear

2014

fDate

11-13 Dec. 2014

Firstpage

191

Lastpage

195

Abstract

Independent spanning trees (ISTs) may be used for message broadcasting in any interconnection networks, which provides preferential performances. It can be used to enhance the fault tolerance, bandwidth, and security. In this way, the designs of ISTs for various types of topologies have been widely analysed. There is a hypothesis on ISTs: any n-connected network has n ISTs rooted at any node. In this paper, we first analysed the algorithm then parallel construct the ISTs in hypercubes. We give an algorithm for ISTs which can be applied to solve any node broadcast problem for hypercubes. Then, simulation results showed that fault tolerance is effective in reliable broadcasting and concedes 11%-23% fault tolerance for successful broadcasting.

Keywords

broadcasting; fault tolerance; hypercube networks; trees (mathematics); ISTs; fault tolerance; hypercube networks; independent spanning trees; interconnection networks; message broadcasting; node broadcast problem; topologies; Broadcasting; Fault tolerance; Fault tolerant systems; Grid computing; Hypercubes; Vegetation;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel, Distributed and Grid Computing (PDGC), 2014 International Conference on

Conference_Location

Solan

Print_ISBN

978-1-4799-7682-9

Type

conf

DOI

10.1109/PDGC.2014.7030740

Filename

7030740