A new reliability evaluation measure, global clustering reliability (GCR), is proposed. Firstly, the common measures used in invulnerability and survivability evaluation of mobile communication networks are discussed,...A new reliability evaluation measure, global clustering reliability (GCR), is proposed. Firstly, the common measures used in invulnerability and survivability evaluation of mobile communication networks are discussed, and the shortcomings of these measures are pointed out. Then a new reliability evaluation measure, GCR, which is applicable to mobile communication networks, is proposed. And some properties and theorem about this measure are put forward. Finally, simulation calculation of reliability evaluation that uses this measure to 12 kinds of topological networks is accomplished. And the comparison between this measure and link connected factor (LCF) measure is also given. The results proved that the design of GCR is reasonable, its computation is rapid, moreover, it can take into account of invalidation of both nodes and links, and it has good physical meanings展开更多
For networks that are directed or can be represented by a directed network,reversing one or more of the uni-directional links may provide the ability to reconnect a network that has been disconnected by link failure, ...For networks that are directed or can be represented by a directed network,reversing one or more of the uni-directional links may provide the ability to reconnect a network that has been disconnected by link failure, In this paper,a new approach to reconfigure such networks is proposed.We develop a linear time algorithm which,when reachability has been destroyed by the removal of a single link,optimally restores teachability through the reversal of selected links.Multi-link failure reconnectability is discussed and an algorithm with polynomial complexity is given which provides a nearly optimum solution to reconnect the network.We show that the reliability of a network that allows reversals is at least twice more than that in which reversals are not permitted.Unfortunately,the reconnection of some networks cannot be established.Therefore,we discuss the maximization of reachability of such networks so that each node can reach maximum number of the other nodes.展开更多
文摘A new reliability evaluation measure, global clustering reliability (GCR), is proposed. Firstly, the common measures used in invulnerability and survivability evaluation of mobile communication networks are discussed, and the shortcomings of these measures are pointed out. Then a new reliability evaluation measure, GCR, which is applicable to mobile communication networks, is proposed. And some properties and theorem about this measure are put forward. Finally, simulation calculation of reliability evaluation that uses this measure to 12 kinds of topological networks is accomplished. And the comparison between this measure and link connected factor (LCF) measure is also given. The results proved that the design of GCR is reasonable, its computation is rapid, moreover, it can take into account of invalidation of both nodes and links, and it has good physical meanings
文摘For networks that are directed or can be represented by a directed network,reversing one or more of the uni-directional links may provide the ability to reconnect a network that has been disconnected by link failure, In this paper,a new approach to reconfigure such networks is proposed.We develop a linear time algorithm which,when reachability has been destroyed by the removal of a single link,optimally restores teachability through the reversal of selected links.Multi-link failure reconnectability is discussed and an algorithm with polynomial complexity is given which provides a nearly optimum solution to reconnect the network.We show that the reliability of a network that allows reversals is at least twice more than that in which reversals are not permitted.Unfortunately,the reconnection of some networks cannot be established.Therefore,we discuss the maximization of reachability of such networks so that each node can reach maximum number of the other nodes.
