Work

Computing the reliability of hammock networks in quadratic time with respect to length

Year: 2025

Type: article

Abstract: The paper introduces an efficient algorithm for computing the reliability polynomial of hammock networks. A hammock network of length l and width w is made up of w × l identical devices that independently work with probability p (and fail with probability 1 − p ). A brute-force algorithm to compute its reliability polynomial would require a running time exponential in w × l . We introduce a new algorithm and prove that it is exponential in w (as expected), while being only quadratic in l . This allows us to compute, for the first time ever, the reliability polynomials of hammock networks of dimensions significantly larger than 8 (the largest reported in the literature).

Source: Reliability Engineering & System Safety

DOI: 10.1016/j.ress.2025.112121

Authors: Mihail Jianu, Mihail Jianu, Marilena Jianu, Marilena Jianu, Leonard Dăuş, Valeriu Beiu

Institutions: Technical University of Civil Engineering of Bucharest, Aurel Vlaicu University of Arad

Language: English

Topic: Reliability and Maintenance Optimization

Subfield: Safety, Risk, Reliability and Quality

Field: Engineering

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $4,830

Funders: Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii, Ministry of Education and Research, Romania