DocumentCode
2718345
Title
The Effect of Node Failures in Substar Reliability of a Star Network- a Combinatorial Approach
Author
Latifi, Shahram ; Palaniappan, Venka
Author_Institution
Electr. & Comput. Eng. Dept., UNLV, Las Vegas, NV
fYear
2007
fDate
21-23 May 2007
Firstpage
166
Lastpage
170
Abstract
The star graph is a hierarchical graph, and rich in containing substars (or graphs with smaller size but with the same topological properties as the original). Given a set of faulty nodes, we determine the ability to recover substars of a given dimension from the original network. A study of the number of faulty nodes that are required to damage every subnetwork of a given size is also presented.
Keywords
graph theory; multiprocessor interconnection networks; network theory (graphs); reliability theory; combinatorial approach; hierarchical graph; node failure; star graph; substar network reliability; substars; Algorithm design and analysis; Combinatorial mathematics; Computer network reliability; Computer networks; Fault tolerance; Hypercubes; Multiprocessor interconnection networks; Network topology; Prediction algorithms; Process design;
fLanguage
English
Publisher
ieee
Conference_Titel
Advanced Information Networking and Applications, 2007. AINA '07. 21st International Conference on
Conference_Location
Niagara Falls, ON
ISSN
1550-445X
Print_ISBN
0-7695-2846-5
Type
conf
DOI
10.1109/AINA.2007.135
Filename
4220890
Link To Document