IDEAS home Printed from https://ideas.repec.org/a/sae/risrel/v227y2013i1p80-85.html
   My bibliography  Save this article

Assessing reliability within error rate and time constraint for a stochastic node-imperfect computer network

Author

Listed:
  • Yi-Kuei Lin
  • Cheng-Fu Huang

Abstract

In order to maintain the stability of a computer network, the assessment of system reliability is an important issue for the supervisor. A computer network can be modeled as a network topology with edges and nodes, in which each edge denotes a transmission line such as coaxial cables or fiber cables, and each node denotes a transmission station such as router or switch. For a real-life computer network, the capacity of each component (edge or node) should be stochastic owing to complete failure, partial failure, etc. Hence, the computer network with imperfect components is also stochastic and is named a stochastic node-imperfect computer network. Different from the quickest path problem considering deterministic capacity, this article concentrates on a stochastic node-imperfect computer network to evaluate the probability that d units of data can be transmitted within tolerable error rate and time constraint. Such a probability, called system reliability, is a performance indicator to provide to managers for further improvement. An efficient algorithm in terms of the approach of minimal paths to evaluate the system reliability is proposed.

Suggested Citation

  • Yi-Kuei Lin & Cheng-Fu Huang, 2013. "Assessing reliability within error rate and time constraint for a stochastic node-imperfect computer network," Journal of Risk and Reliability, , vol. 227(1), pages 80-85, February.
    • Handle: RePEc:sae:risrel:v:227:y:2013:i:1:p:80-85
    DOI: 10.1177/1748006X12468685
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1748006X12468685
    Download Restriction: no
    File URL: https://libkey.io/10.1177/1748006X12468685?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
    ---><---

    References listed on IDEAS

    as
    1. Climaco, Joao C.N. & Pascoal, Marta M.B. & Craveirinha, Jose M.F. & Captivo, M. Eugenia V., 2007. "Internet packet routing: Application of a K-quickest path algorithm," European Journal of Operational Research, Elsevier, vol. 181(3), pages 1045-1054, September.
    2. Yeh, Wei-Chang, 2004. "Multistate network reliability evaluation under the maintenance cost constraint," International Journal of Production Economics, Elsevier, vol. 88(1), pages 73-83, March.
    3. Yeh, Wei-Chang, 2005. "A new approach to evaluate reliability of multistate networks under the cost constraint," Omega, Elsevier, vol. 33(3), pages 203-209, June.
    Full references (including those not matched with items on IDEAS)

    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. Lin, Yi-Kuei, 2007. "Reliability of a computer network in case capacity weight varying with arcs, nodes and types of commodity," Reliability Engineering and System Safety, Elsevier, vol. 92(5), pages 646-652.
    3. 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.
    4. Yi-Kuei Lin & Cheng-Fu Huang, 2016. "Reliability evaluation according to a routing scheme for multi-state computer networks under assured accuracy rate," Annals of Operations Research, Springer, vol. 244(1), pages 221-240, September.
    5. Lin, Yi-Kuei & Yeh, Cheng-Ta, 2012. "Determining the optimal double-component assignment for a stochastic computer network," Omega, Elsevier, vol. 40(1), pages 120-130, January.
    6. Lin, Yi-Kuei, 2007. "Performance evaluation for the logistics system in case that capacity weight varies from arcs and types of commodity," International Journal of Production Economics, Elsevier, vol. 107(2), pages 572-580, June.
    7. 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.
    8. Niu, Yi-Feng & Song, Yi-Fan & Xu, Xiu-Zhen & Zhao, Xia, 2022. "Efficient reliability computation of a multi-state flow network with cost constraint," Reliability Engineering and System Safety, Elsevier, vol. 222(C).
    9. Yeh, Wei-Chang, 2006. "The k-out-of-n acyclic multistate-node networks reliability evaluation using the universal generating function method," Reliability Engineering and System Safety, Elsevier, vol. 91(7), pages 800-808.
    10. Xu, Xiu-Zhen & Niu, Yi-Feng & Song, Yi-Fan, 2021. "Computing the reliability of a stochastic distribution network subject to budget constraint," Reliability Engineering and System Safety, Elsevier, vol. 216(C).
    11. Melchiori, Anna & Sgalambro, Antonino, 2020. "A branch and price algorithm to solve the Quickest Multicommodity k-splittable Flow Problem," European Journal of Operational Research, Elsevier, vol. 282(3), pages 846-857.
    12. 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.
    13. Yi-Kuei Lin & Lance Fiondella & Ping-Chen Chang, 2022. "Reliability of time-constrained multi-state network susceptible to correlated component faults," Annals of Operations Research, Springer, vol. 311(1), pages 239-254, April.
    14. Ashutosh Sharma & Rajiv Kumar & Manar Wasif Abu Talib & Saurabh Srivastava & Razi Iqbal, 2019. "Network modelling and computation of quickest path for service-level agreements using bi-objective optimization," International Journal of Distributed Sensor Networks, , vol. 15(10), pages 15501477198, October.
    15. Cancela, Héctor & Petingi, Louis, 2007. "Properties of a generalized source-to-all-terminal network reliability model with diameter constraints," Omega, Elsevier, vol. 35(6), pages 659-670, December.
    16. Yi-Kuei Lin & Thi-Phuong Nguyen & Louis Cheng-Lu Yeng, 2019. "Reliability evaluation of a multi-state air transportation network meeting multiple travel demands," Annals of Operations Research, Springer, vol. 277(1), pages 63-82, June.
    17. Calvete, Herminia I. & del-Pozo, Lourdes & Iranzo, José A., 2018. "Dealing with residual energy when transmitting data in energy-constrained capacitated networks," European Journal of Operational Research, Elsevier, vol. 269(2), pages 602-620.
    18. 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).
    19. 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.
    20. Tayyebi, Javad & Mitra, Ankan & Sefair, Jorge A., 2023. "The continuous maximum capacity path interdiction problem," European Journal of Operational Research, Elsevier, vol. 305(1), pages 38-52.

    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:sae:risrel:v:227:y:2013:i:1:p:80-85. 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: SAGE Publications (email available below). General contact details of provider: .

    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.