A Modified Universal Generating Function Algorithm for the Acyclic Binary-State Network Reliability

2012 ◽  
Vol 61 (3) ◽  
pp. 702-709 ◽  
Author(s):  
Wei-Chang Yeh
2019 ◽  
Vol 36 (2) ◽  
pp. 186-201 ◽  
Author(s):  
Soni Bisht ◽  
S.B. Singh

PurposeThe purpose of this paper is to evaluate various reliability measures like reliability, expected lifetime (mean time to failure), signature reliability and compare networks based on the different flows.Design/methodology/approachThe reliability characteristics of complex bridge networks have been evaluated using different algorithms with the help of universal generating function (UGF). Further, the signature reliability of the considered networks has been determined using Owen’s method.FindingsThe present paper proposes an efficient algorithm to compute the reliability indices of complex bridge networks having i.i.d. lifetime components (nodes, edges) with the help of UGF and Owen’s method. This study reveals that a slight change in the complex bridge network affects the reliability significantly. Finally, by the reliability structure function, proposed algorithms are used to find the signature and MTTF. From signature, we have determined the different failure probabilities corresponding to edges of the network.Originality/valueIn this work, we have evaluated reliability characteristics and signature reliability of the complex bridge networks using UGF method and Owen’s method respectively unlike done in the past.


Author(s):  
Vaibhav Bisht ◽  
S. B. Singh

Shuffle Exchange Networks (SENs) are considered as an appropriate interconnection network because they consist of switching elements of small size and possess a straight forward and simple configuration. In this paper, we have proposed a method for analyzing reliability of 4×4 SEN, 4×4 SEN+1 and 4×4 SEN+2. The reliability has been obtained on the basis of three indices, namely, terminal reliability, broadcast reliability and network reliability by using universal generating function (UGF) method. This study also examines effect of adding the additional stages in 4×4 shuffle exchange networks (SENs).


2013 ◽  
Vol 2013 ◽  
pp. 1-12 ◽  
Author(s):  
Zhao Wu ◽  
Naixue Xiong ◽  
Yannong Huang ◽  
Qiong Gu ◽  
Chunyang Hu ◽  
...  

At present the cloud computing is one of the newest trends of distributed computation, which is propelling another important revolution of software industry. The cloud services composition is one of the key techniques in software development. The optimization for reliability and performance of cloud services composition application, which is a typical stochastic optimization problem, is confronted with severe challenges due to its randomness and long transaction, as well as the characteristics of the cloud computing resources such as openness and dynamic. The traditional reliability and performance optimization techniques, for example, Markov model and state space analysis and so forth, have some defects such as being too time consuming and easy to cause state space explosion and unsatisfied the assumptions of component execution independence. To overcome these defects, we propose a fast optimization method for reliability and performance of cloud services composition application based on universal generating function and genetic algorithm in this paper. At first, a reliability and performance model for cloud service composition application based on the multiple state system theory is presented. Then the reliability and performance definition based on universal generating function is proposed. Based on this, a fast reliability and performance optimization algorithm is presented. In the end, the illustrative examples are given.


Sign in / Sign up

Export Citation Format

Share Document