Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1 results

  • MARKOV CHAIN METHOD FOR COMPUTING THE RELIABILITY OF HAMMOCK NETWORKS

  • Marilena Jianu, Daniel Ciuiu, Leonard Dăuş, Mihail Jianu
  • Journal:
    Probability in the Engineering and Informational Sciences / Volume 36 / Issue 2 / April 2022
    Published online by Cambridge University Press:
    20 November 2020, pp. 276-293

  • In this paper, we develop a new method for evaluating the reliability polynomial of a hammock network. The method is based on a homogeneous absorbing Markov chain and provides the exact reliability for networks of width less than 5 and arbitrary length. Moreover, it produces a lower bound for the reliability polynomial for networks of width greater than or equal to 5. To investigate how sharp this lower bound is, we compare our method with other approximation methods and it proves to be the most accurate in terms of absolute as well as relative error. Using the fundamental matrix, we also calculate the average time to absorption, which provides the mean length of a network that is expected to work.