IDEAS home Printed from https://ideas.repec.org/a/spr/ijsaem/v8y2017i2d10.1007_s13198-017-0657-x.html
   My bibliography  Save this article

Sum of disjoint product approach for reliability evaluation of stochastic flow networks

Author

Listed:
  • Esha Datta

    (Indian Institute of Technology Kharagpur)

  • Neeraj Kumar Goyal

    (Indian Institute of Technology Kharagpur)

Abstract

Computer and telecommunication networks are stochastic in nature, as each node and arc may have multiple capacity states besides complete failure. Various two-terminal reliability estimation algorithms for such stochastic flow networks are available in literature. These algorithms generate d-minimal cuts from minimal cut-sets of the network, where d is required demand. Different techniques are available in literature to evaluate exact reliability from such d-minimal cuts such as the recursive inclusion–exclusion method. The recursive inclusion–exclusion method has certain redundant computations while evaluating network reliability. This paper proposes a sum of disjoint products technique to minimize redundant computations in exact reliability computation from flow vectors. MATLAB simulation is performed to evaluate the performance of the proposed method and compare it with the existing methods for benchmark networks available in literature. Simulation results show that the proposed method require lesser computational efforts and memory.

Suggested Citation

  • Esha Datta & Neeraj Kumar Goyal, 2017. "Sum of disjoint product approach for reliability evaluation of stochastic flow networks," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 8(2), pages 1734-1749, November.
    • Handle: RePEc:spr:ijsaem:v:8:y:2017:i:2:d:10.1007_s13198-017-0657-x
    DOI: 10.1007/s13198-017-0657-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13198-017-0657-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s13198-017-0657-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Jane, Chin-Chia & Yuan, John, 2001. "A sum of disjoint products algorithm for reliability evaluation of flow networks," European Journal of Operational Research, Elsevier, vol. 131(3), pages 664-675, June.
    2. Lin, Yi-Kuei, 2006. "Evaluate the performance of a stochastic-flow network with cost attribute in terms of minimal cuts," Reliability Engineering and System Safety, Elsevier, vol. 91(5), pages 539-545.
    3. Michael O. Ball & J. Scott Provan, 1988. "Disjoint Products and Efficient Computation of Reliability," Operations Research, INFORMS, vol. 36(5), pages 703-715, October.
    4. Yeh, Wei-Chang, 2007. "An improved sum-of-disjoint-products technique for the symbolic network reliability analysis with known minimal paths," Reliability Engineering and System Safety, Elsevier, vol. 92(2), pages 260-268.
    5. Yan, Zhou & Qian, Meng, 2007. "Improving efficiency of solving d-MC problem in stochastic-flow network," Reliability Engineering and System Safety, Elsevier, vol. 92(1), pages 30-39.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Esha Datta & Neeraj Kumar Goyal, 2019. "Evaluation of stochastic flow networks susceptible to demand requirements between multiple sources and multiple destinations," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 10(5), pages 1302-1327, October.
    2. Schäfer, Lukas & García, Sergio & Srithammavanh, Vassili, 2018. "Simplification of inclusion–exclusion on intersections of unions with application to network systems reliability," Reliability Engineering and System Safety, Elsevier, vol. 173(C), pages 23-33.
    3. Esha Datta & Neeraj Goyal, 2023. "An efficient sum of disjoint product method for reliability evaluation of stochastic flow networks using d-MPs," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 14(4), pages 1228-1246, August.
    4. Huang, Cheng-Fu & Huang, Ding-Hsiang & Lin, Yi-Kuei, 2022. "Network reliability evaluation for multi-state computing networks considering demand as the non-integer type," Reliability Engineering and System Safety, Elsevier, vol. 219(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Kozyra, Paweł Marcin, 2023. "The usefulness of (d,b)-MCs and (d,b)-MPs in network reliability evaluation under delivery or maintenance cost constraints," Reliability Engineering and System Safety, Elsevier, vol. 234(C).
    2. Thi-Phuong Nguyen, 2021. "Assess the Impacts of Discount Policies on the Reliability of a Stochastic Air Transport Network," Mathematics, MDPI, vol. 9(9), pages 1-13, April.
    3. Yeh, Wei-Chang & Bae, Changseok & Huang, Chia-Ling, 2015. "A new cut-based algorithm for the multi-state flow network reliability problem," Reliability Engineering and System Safety, Elsevier, vol. 136(C), pages 1-7.
    4. Lin, Yi-Kuei, 2010. "Calculation of minimal capacity vectors through k minimal paths under budget and time constraints," European Journal of Operational Research, Elsevier, vol. 200(1), pages 160-169, January.
    5. Bigatti, A.M. & Pascual-Ortigosa, P. & Sáenz-de-Cabezón, E., 2021. "A C++ class for multi-state algebraic reliability computations," Reliability Engineering and System Safety, Elsevier, vol. 213(C).
    6. Jørund Gåsemyr & Bent Natvig, 2001. "Bayesian inference based on partial monitoring of components with applications to preventive system maintenance," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(7), pages 551-577, October.
    7. Jane, Chin-Chia & Laih, Yih-Wenn, 2010. "A dynamic bounding algorithm for approximating multi-state two-terminal reliability," European Journal of Operational Research, Elsevier, vol. 205(3), pages 625-637, September.
    8. Yeh, Wei-Chang & Tan, Shi-Yi & Zhu, Wenbo & Huang, Chia-Ling & Yang, Guang-yi, 2022. "Novel binary addition tree algorithm (BAT) for calculating the direct lower-bound of the highly reliable binary-state network reliability," Reliability Engineering and System Safety, Elsevier, vol. 223(C).
    9. Molinero, Xavier & Riquelme, Fabián & Serna, Maria, 2015. "Forms of representation for simple games: Sizes, conversions and equivalences," Mathematical Social Sciences, Elsevier, vol. 76(C), pages 87-102.
    10. Li, Jian & Dueñas-Osorio, Leonardo & Chen, Changkun & Shi, Congling, 2016. "Connectivity reliability and topological controllability of infrastructure networks: A comparative assessment," Reliability Engineering and System Safety, Elsevier, vol. 156(C), pages 24-33.
    11. Yeh, Wei-Chang, 2021. "Novel binary-addition tree algorithm (BAT) for binary-state network reliability problem," Reliability Engineering and System Safety, Elsevier, vol. 208(C).
    12. Ding-Hsiang Huang & Cheng-Fu Huang & Yi-Kuei Lin, 2019. "Reliability Evaluation for a Stochastic Flow Network Based on Upper and Lower Boundary Vectors," Mathematics, MDPI, vol. 7(11), pages 1-12, November.
    13. Lin, Yi-Kuei, 2010. "A stochastic model to study the system capacity for supply chains in terms of minimal cuts," International Journal of Production Economics, Elsevier, vol. 124(1), pages 181-187, March.
    14. Niu, Yi-Feng & Gao, Zi-You & Lam, William H.K., 2017. "Evaluating the reliability of a stochastic distribution network in terms of minimal cuts," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 100(C), pages 75-97.
    15. Yeh, Wei-Chang & Hao, Zhifeng & Forghani-elahabad, Majid & Wang, Gai-Ge & Lin, Yih-Lon, 2021. "Novel Binary-Addition Tree Algorithm for Reliability Evaluation of Acyclic Multistate Information Networks," Reliability Engineering and System Safety, Elsevier, vol. 210(C).
    16. Paweł Marcin Kozyra, 2020. "Analysis of minimal path and cut vectors in multistate monotone systems and use it for detection of binary type multistate monotone systems," Journal of Risk and Reliability, , vol. 234(5), pages 686-695, October.
    17. Chakraborty, Suparna & Goyal, N.K. & Mahapatra, S. & Soh, Sieteng, 2020. "A Monte-Carlo Markov chain approach for coverage-area reliability of mobile wireless sensor networks with multistate nodes," Reliability Engineering and System Safety, Elsevier, vol. 193(C).
    18. Lin, Yi-Kuei, 2010. "Reliability evaluation of a revised stochastic flow network with uncertain minimum time," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(6), pages 1253-1258.
    19. Cui, Hongjun & Wang, Fei & Ma, Xinwei & Zhu, Minqing, 2022. "A novel fixed-node unconnected subgraph method for calculating the reliability of binary-state networks," Reliability Engineering and System Safety, Elsevier, vol. 226(C).
    20. Majid Forghani-elahabad & Omar Mutab Alsalami, 2023. "Using a Node–Child Matrix to Address the Quickest Path Problem in Multistate Flow Networks under Transmission Cost Constraints," Mathematics, MDPI, vol. 11(24), pages 1-15, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:ijsaem:v:8:y:2017:i:2:d:10.1007_s13198-017-0657-x. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.