Robustness of star graph network under link failure

Information Sciences

Volumn 178, Issue 3, 2008, Pages 802-806

  Latifi, Shahram ^a   Saberinia, Ebrahim ^a   Wu, Xialong ^a  

^a University of Nevada Las Vegas   (United States)

Author keywords

Distributed systems; Interconnection networks; Link failure; Permutation; Reliability; Star graph

Indexed keywords

COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; FAILURE ANALYSIS; INTERCONNECTION NETWORKS; RELIABILITY ANALYSIS;

LINK FAILURE; PERMUTATION; STAR GRAPH NETWORKS;

GRAPH THEORY;

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

References (12)

1. Akers S.B., Harel D., and Krishnamurthy B. The star graph: an attractive alternative to the n-cube. Proceedings of the International Conference in Parallel Processing (1987) 393-400
2. Akers S.B., and Krishnamurthy B. A group-theoretic model for symmetric interconnection networks. IEEE Transactions on Computers 38 4 (1989) 555-566
3. Bagherzadeh N., Dowd M., and Nassif N. Embedding an arbitrary binary tree into the star graph. IEEE Transactions on Computers 45 4 (1996) 475-481
4. Becker B., and Simon H. How robust is the n-cube?. Information and Computation 77 2 (1988)
5. Bennes R., Latifi S., and Kimura N. A comparative study of job allocation and migration in the pancake network. Information Sciences 177 (2007) 2327-2335
6. 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
7. N. Imani, H. Sarbazi-Azad, S.G. Akl, On some combinatorial properties of star graph ISPAN 2005, in: Proceedings of the 8th International Symposium on Parallel Architectures, Algorithms and Networks, 2005, pp. 58-65.
8. Latifi S. On the fault-diameter of the star graph. Information Processing Letters 46 3 (1993) 143-150
9. Latifi S. A study of fault tolerance in star graph. Information Processing Letters 102 (2007) 196-200
10. Li T.K., Tan J.M., and Hsu L. Hyper Hamiltonian laceablility on edge fault star graph. Information Sciences 165 1-2 (2004) 59-71
11. Sur S., and Srimani P.K. A fault-tolerant routing algorithm for star graph interconnection network. International Conference in Parallel Processing 3 (1991) 267-270
12. Xu M., Hu X., and Zhu Q. Edge bipancyclicity of star graphs under edge-fault tolerant with edge faults. Applied Mathematics and Computation 183 (2006) 972-979