Constructing a reliability dominating set of a new family of networks

被引:2
|
作者
Li, Feng [1 ,3 ]
Zhao, Hai-Xing [2 ]
Xu, Zong-Ben [1 ,3 ]
机构
[1] Institute of Information and System Sciences, School of Mathematics and Statistics, Xi'an Jiaotong University
[2] College of Computer Science, Qinghai Normal University
[3] Key Laboratory for Intelligent Networks and Network Security of Ministry of Education, Xi'an Jiaotong University
来源
Jisuanji Xuebao/Chinese Journal of Computers | 2013年 / 36卷 / 06期
关键词
Connectivity; Dominating set; Network reliability; Reliability polynomial;
D O I
10.3724/SP.J.1016.2013.01246
中图分类号
O144 [集合论]; O157 [组合数学(组合学)];
学科分类号
070104 ;
摘要
The research of network reliability is also called the research of fault-tolerant network which includes two aspects: reliability analysis and reliability design. Sometimes the reliability design of a network is called reliability synthesize. The main aim of reliability analysis is to compute the failure probability of networks. While, constructing a network with a minimum failure probability is the main aim of reliability design. In many applications, the topological structure of a network can be modeled as a undirected graph G with the same interconnection as the network. In this paper, we mainly investigate the reliability problem of a network with edge failure. Let Ω(n, e) be a family of networks which are constituted by all connected undirected networks with n vertices and e edges, then the notation Ω(n, e) is called the family of networks. Generally speaking, there must exist a network which has a better reliability than any other in this family of networks. In fact there is no uniformly optimal reliable network in some families of networks, but there exist some networks which are more reliable than others in this family of networks. Then these certain networks can be used to evaluate the reliability of the whole family of networks, and the set of such these networks are called reliability dominating set of the family of networks. This paper characterize a reliability dominating set of a new family of networks Ω(n, n(n-1) 2-n+5 2), where n is positive odd and n ≥ 8.
引用
收藏
页码:1246 / 1253
页数:7
相关论文
共 22 条
  • [11] Xu J.-M., Theory of Combination Networks, (2006)
  • [12] Boesch F.T., On unreliability polynomials and graph connectivity in reliable network synthesis, Journal of Graph Theory, 10, 3, pp. 339-352, (1986)
  • [13] Boesch F.T., Synthesis of reliable networks survey, IEEE Transactions on Reliability, 35, 3, pp. 240-246, (1986)
  • [14] Boesch F., Li X., Suffle C., On the existence of uniformly optimally reliable networks, Networks, 21, 2, pp. 181-194, (1991)
  • [15] Myrvold W., Cheung K., Page L., Perry J., Uniformly most reliable networks do not always exist, Networks, 21, 4, pp. 417-419, (1991)
  • [16] Wang G., A proof of Boesch's conjecture, Networks, 24, 5, pp. 277-284, (1994)
  • [17] Gordon G., Jager E., Distinguished vertices in probabilistic rooted graphs, Networks, 55, 3, pp. 181-186, (2010)
  • [18] Yang J.S., Chang J.M., Independent spanning trees on folded hyper-stars, Networks, 56, 4, pp. 272-281, (2011)
  • [19] Crainic T.G., Fu X.R., Gendreau M., Rei W., Progressive hedging-based metaheuristics for stochastic network design, Networks, 58, 2, pp. 114-124, (2011)
  • [20] Faudree R.J., Gould R.J., Powell J.S., Property p<sub>d,m</sub> and efficient design of reliable networks, Networks, 60, 3, pp. 167-178, (2012)