Abstract | ||
---|---|---|
In this paper, we derive an upper bound on the (n-1)-star reliability in an S"n 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. |
Year | DOI | Venue |
---|---|---|
2008 | 10.1016/j.ins.2007.11.015 | Inf. Sci. |
Keywords | Field | DocType |
substar reliability analysis,similar size star graph,star reliability,probability fault model,star networks,low value,node reliability,conservative comparison,numerical result,fixed partitioning,good agreement,star reliability result,reliability analysis,reliability,star graph,fault model,upper bound | Reliability block diagram,Graph,Discrete mathematics,Star network,Computer science,Upper and lower bounds,Star (graph theory),Fault model,Hypercube | Journal |
Volume | Issue | ISSN |
178 | 10 | 0020-0255 |
Citations | PageRank | References |
20 | 0.73 | 22 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Xiaolong Wu | 1 | 128 | 18.86 |
Shahram Latifi | 2 | 1255 | 139.96 |