IDEAS home Printed from https://ideas.repec.org/a/igg/jeis00/v10y2014i3p13-23.html
   My bibliography  Save this article

A Comparative Study of Different Approaches for Finding the Upper Boundary Points in Stochastic-Flow Networks

Author

Listed:
  • Seyed Mehdi Mansourzadeh

    (Department of Mathematics, University of Mazandaran, Babolsar, Iran)

  • Seyed Hadi Nasseri

    (Department of Mathematics, University of Mazandaran, Babolsar, Iran)

  • Majid Forghani-elahabad

    (Faculty of Mathematical Sciences, Sharif University of Technology, Tehran, Iran)

  • Ali Ebrahimnejad

    (Department of Mathematics, Qaemshahr Branch, Islamic Azad University, Qaemshahr, Iran)

Abstract

An information system network (ISN) can be modeled as a stochastic-flow network (SFN). There are several algorithms to evaluate reliability of an SFN in terms of Minimal Cuts (MCs). The existing algorithms commonly first find all the upper boundary points (called d-MCs) in an SFN, and then determine the reliability of the network using some approaches such as inclusion-exclusion method, sum of disjoint products, etc. However, most of the algorithms have been compared via complexity results or through one or two benchmark networks. Thus, comparing those algorithms through random test problems can be desired. Here, the authors first state a simple improved algorithm. Then, by generating a number of random test problems and implementing the algorithms in MATLAB, the proposed algorithm is demonstrated to be more efficient than some existing ones in medium-sized networks. The performance profile introduced by Dolan and More is used for analyzing the output of programs.

Suggested Citation

  • Seyed Mehdi Mansourzadeh & Seyed Hadi Nasseri & Majid Forghani-elahabad & Ali Ebrahimnejad, 2014. "A Comparative Study of Different Approaches for Finding the Upper Boundary Points in Stochastic-Flow Networks," International Journal of Enterprise Information Systems (IJEIS), IGI Global, vol. 10(3), pages 13-23, July.
    • Handle: RePEc:igg:jeis00:v:10:y:2014:i:3:p:13-23
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijeis.2014070102
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:igg:jeis00:v:10:y:2014:i:3:p:13-23. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.