Substar reliability analysis in star networks

Document Type



In this paper, we derive an upper bound on the (n − 1)-star reliability in an Sn using the probability fault model. Approximate (n − 1)-star reliability results are also obtained using the fixed partitioning. The numerical results show that the (n − 1)-star reliabilities under the probability fault model and the fixed partitioning are in good agreement especially for the low value of the node reliability. The numerical results are also shown to be consistent with and close to the simulation results. Conservative comparisons are made where possible between the reliability of similar size star graphs and hypercubes.


Computer networks--Reliability; Hypercube networks (Computer networks); Reliability (Engineering)--Mathematical models


Digital Communications and Networking | Electrical and Computer Engineering | Systems and Communications


Use Find in Your Library, contact the author, or interlibrary loan to garner a copy of the item. Publisher policy does not allow archiving the final published version. If a post-print (author's peer-reviewed manuscript) is allowed and available, or publisher policy changes, the item will be deposited.

UNLV article access

Search your library