Substar Reliability Analysis in Star Networks

Information Sciences

Volumn 178, Issue 10, 2008, Pages 2337-2348

  Wu, Xiaolong ^a   Latifi, Shahram ^a  

^a University of Nevada Las Vegas   (United States)

Author keywords

Disjoint substar; Partitioning; Probability fault model; Reliability; Star graph; Substar reliability

Indexed keywords

COMPUTER NETWORKS; FAULT TOLERANCE; MATHEMATICAL MODELS; PROBABILITY DISTRIBUTIONS;

PROBABILITY FAULT MODELS; SUBSTAR RELIABILITY;

RELIABILITY ANALYSIS;

EID: 40249093472     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2007.11.015     Document Type: Article

References (31)

1. S.B. Akers, B. Krishnamurthy, A group-theoretic model for symmetric interconnection networks, in: Proc. the International Conference on Parallel Processing, 1986, pp. 216-223.
2. S.B. Akers, D. Horel, B. Krishnamurthy, The star network: an attractive alternative to the n-cube, in: Proc. the International Conference on Parallel Processing, 1987, pp. 393-400.
3. S.B. Akers, B. Krishnamurthy, The fault tolerance of star networks, in: Proc. the 2nd International Conference on Supercomputing, 1987, pp. 270-276.
4. Bagherzadeh N., Dowd M., and Nassif N. Embedding an arbitrary binary tree into star graph. IEEE Transactions on Computers 45 4 (1996) 475-481
5. Billinton R., and Allan R. Reliability Evaluation of Engineering Systems. second ed. (1992), Plenum Press
6. Chang Y., and Bhuyan L. A combinatorial analysis of subcube reliability in hypercube. IEEE Transactions on Computers 44 7 (1995) 952-956
7. Das C., and Kim J. A unified task-based dependability model for hypercube computers. IEEE Transactions on Parallel and Distributed Systems 3 3 (1992) 312-324
8. Das R.K. Adaptive fault tolerant routing in star graph. Proc. the Distributed Computing-IWDC 3326 (2004) 385-390
9. Day K., and Tripathi A. A comparative study of topologies properties of hypercubes and star networks. IEEE Transactions on Parallel and Distributed Systems 5 1 (1994) 31-38
10. K. Day, A.E. Al-Ayyoub, Reliable communication in faulty star networks, in: Proc. the International Parallel and Distributed Processing Symposium, 2002, pp. 260-266.
11. Fujita S. A fault-tolerant broadcast scheme in the star graph under the single-port, half-duplex communication model. IEEE Transactions on Computers 48 10 (1999) 1123-1126
12. Hsieh S.Y., Chen G.H., and Ho C.W. Longest fault-free paths in star graphs with edge faults. IEEE Transactions on Computers 50 10 (2001) 960-971
13. Hsieh S.Y., Chen G.H., and Ho C.W. Longest fault-free paths in star graphs with vertex faults. Theoretical Computer Science 262 1-2 (2001) 215-227
14. Hsieh S.Y., Chen G.H., and Ho C.W. Hamiltonian-laceability of star graphs. Networks 36 4 (2000) 225-232
15. Hsieh S.Y. Embedding longest fault-free paths onto star graphs with more vertex faults. Theoretical Computer Science 337 (2005) 370-378
16. N. Imani, H. Sarbazi-Azad, S.G. Akl, On some combinatorial properties of star graph, in: Proc. the 8th International Symposium on Parallel Architectures, Algorithms and Networks, 2005, pp. 58-65.
17. A.E. Kiasari, H. Sarbazi-Azad, A comparative performance analysis of n-cubes and star graph, in: Proc. the 20th International Parallel and Distributed Processing Symposium, 2006, pp. 25-29.
18. Latifi S. On the fault-diameter of the star network. Information Processing Letters 46 3 (1993) 143-150
19. S. Latifi, S. Rai, A robustness measure for hypercube networks, in: Proc. the 36th Midwest Symposium on Circuits and Systems, August 1993, pp. 546-549.
20. Latifi S. On embedding rings into a star-related network. Information Sciences 99 (1997) 21-35
21. Latifi S. A study of fault tolerance in star graph. Information Processing Letters 102 5 (2007) 196-200
22. Latifi S., Saberinia E., and Wu X.L. Robustness of star graph network under link failure. Information Sciences 178 (2008) 802-806
23. Li T.K., Tan J.M., and Hsu L. Hyper hamiltonian laceability on edge fault star graph. Information Sciences 165 1-3 (2004) 59-71
24. Misic J., and Jovanovic Z. Routing function and deadlock avoidance in a star graph interconnection network. Journal of Parallel and Distributed Computing 22 (1994) 216-228
25. Nassif N., and Bagherzadeh N. A grid embedding into the star graph for image analysis solutions. Information Processing Letters 60 5 (1996) 255-260
26. S.M. Rezazad, H. Sabazi-Azad, Fault-tolerant routing in the star graph, in: Proc. the 18th International Conference on Advanced Information Networking and Application 2, 2004, pp. 503-506.
27. Soh S., Rai S., and Trahan J.L. Improved lower bounds on the reliability of hypercube architectures. IEEE Transactions on Parallel and Distributed Systems 5 4 (1994) 364-378
28. Sur S., and Srimani P.K. Topological properties of star graph. Computers and Mathematics with Applications 25 12 (1993) 87-98
29. X.L. Wu, S. Latifi, Y. Jiang, A combinatorial analysis of distance reliability in star network, in: Proc. the 21st IEEE International Parallel and Distributed Processing Symposium IPDPS, March 2007, pp. 1-6.
30. X.L. Wu, S. Latifi, Y. Jiang, Markov reliability modelling of star network, in: Proc. the 2007 International Conference on Parallel and Distributed Processing Techniques and Applications, June 2007.
31. Zheng J., Latifi S., Regentova E., Luo K., and Wu X.L. Diagnosability of star graphs under the comparison diagnosis model. Information Processing Letters 93 1 (2005) 29-36