Skip to main content
SpringerLink
Log in

Estimated and exact system reliabilities of a maintainable computer network

  • Published:
Journal of Systems Science and Systems Engineering Aims and scope Submit manuscript

Abstract

This paper presents an algorithm to evaluate estimated and exact system reliabilities for a computer network in the cloud computing environment. From the quality of service (QOS) viewpoint, the computer network should be maintained when falling to a specific state such that it cannot afford enough capacity to satisfy demand. Moreover, the transmission time should be concerned as well. Thus, the data can be sent through several disjoint minimal paths simultaneously to shorten the transmission time. Under the maintenance budget B and time constraint T, we evaluate the system reliability that d units of data can be sent from the cloud to the client through multiple paths. Two procedures are integrated in the proposed algorithm-an estimation procedure for estimated system reliability and an adjusting procedure utilizing the branch-and-bound approach for exact system reliability. Subsequently, the estimated system reliability with lower bound and upper bound, and exact system reliability are computed by applying the recursive sum of disjoint products (RSDP) algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alexopoulos, C. (1995). A note on state-space decomposition methods for analyzing stochastic flow networks. IEEE Transactions on Reliability, 44(2): 354–357

    Article  Google Scholar 

  2. Aven, T. (1985). Reliability evaluation of multistate systems with multistate components. IEEE Transactions on Reliability, 34(5): 473–479

    Article  MATH  MathSciNet  Google Scholar 

  3. Bodin, L.D., Golden, B.L., Assad, A.A. & Ball, M.O. (1982). Routing and scheduling of vehicles and crews: the state of the art. Computers and Operations Research, 10(22): 63–211

    MathSciNet  Google Scholar 

  4. Chen, Y.L. & Chin, Y.H. (1990). The quickest path problem. Computers and Operations Research, 17(2): 153–161

    Article  MATH  MathSciNet  Google Scholar 

  5. Chen, G.H. & Hung, Y.C. (1993). On the quickest path problem. Information Processing Letters, 46(3): 125–128

    Article  MATH  MathSciNet  Google Scholar 

  6. Chen, G.H. & Hung, Y.C. (1994). Algorithms for the constrained quickest path problem and the enumeration of quickest paths. Computers and Operations Research, 21(2): 113–118

    Article  MATH  Google Scholar 

  7. Chen, Y.L. & Tang, K. (1998). Minimum time paths in a network with mixed time constraints. Computers and Operations Research, 25(10): 793–805

    Article  MATH  MathSciNet  Google Scholar 

  8. Clímaco, J.C.N., Pascoal, M.M.B., Craveirinha, J.M.F. & Captivo, M.E.V. (2007). Internet packet routing: application of a K-quickest path algorithm. European Journal of Operational Research, 181(3): 1045–1054

    Article  MATH  MathSciNet  Google Scholar 

  9. Golden, B.L. & Magnanti, T.L. (1977). Deterministic network optimization: a bibliography. Networks, 7(2): 149–183

    Article  MATH  MathSciNet  Google Scholar 

  10. Hewitt, C. (2008). ORGs for scalable, robust, privacy-friendly client cloud computing. IEEE Internet Computing, 12(5): 96–99

    Article  Google Scholar 

  11. Hudson, J.C. & Kapur, K.C. (1985). Reliability bounds for multistate systems with multistate components. Operations Research, 33(1): 153–160

    Article  MATH  Google Scholar 

  12. Hung, Y.C. & Chen, G.H. (1992). Distributed algorithms for the quickest path problem. Parallel Computing, 18(7): 823–834

    Article  MATH  MathSciNet  Google Scholar 

  13. Jane, C.C., Lin, J.S. & Yuan, J. (1993). On reliability evaluation of a limited-flow network in terms of minimal cutsets. IEEE Transactions on Reliability, 42(3): 354–361

    Article  MATH  Google Scholar 

  14. Jin, T. & Coit, D.W. (2003). Network reliability estimates using linear & quadratic unreliability of minimal cuts. Reliability Engineering & System Safety, 82(1): 41–48

    Article  Google Scholar 

  15. Kelso, R. (2001). Innovative bandwidth arrangements for the Australian education and training sector; Stage 1: assessment of overseas approaches. RMIT University, AU. Available via DIALOG. http://www.dest.gov.au/. Cited April 14, 2011

  16. Lee, D.T. & Papadopoulou, E. (1993). The all-pairs quickest path problem. Information Processing Letters, 45(5): 261–267

    Article  MATH  MathSciNet  Google Scholar 

  17. Lin, J.S., Jane, C.C. & Yuan, J. (1995). On reliability evaluation of a capacitated-flow network in terms of minimal pathsets. Networks, 25(3): 131–138

    Article  MATH  Google Scholar 

  18. Lin, Y.K. (2004). Reliability of a stochastic-flow network with unreliable branches & nodes under budget constraints. IEEE Transactions on Reliability, 53(3): 381–387

    Article  Google Scholar 

  19. Lin, Y.K. (2007). On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint. European Journal of Operational Research, 176(1): 347–360

    Article  MATH  MathSciNet  Google Scholar 

  20. Lin, Y.K. (2010). Spare routing reliability for a stochastic flow network through two minimal path under budget constraint. IEEE Transactions on Reliability, 59(1): 2–10

    Article  Google Scholar 

  21. Martins, E.D.Q.V. & Santos, J.L.E.D. (1997). An algorithm for the quickest path problem. Operations Research Letters, 20(4): 195–198

    Article  MATH  MathSciNet  Google Scholar 

  22. Moreb, A.A. (2007). Allocating repairable system’s reliability subject to minimal total cost — an integer programming approach. Journal of Systems Science and Systems Engineering, 16(4): 499–506

    Article  Google Scholar 

  23. Park, C.K., Lee, S. & Park, S. (2004). A label-setting algorithm for finding a quickest path. Computers and Operations Research, 31(4): 2405–2418

    Article  MATH  MathSciNet  Google Scholar 

  24. Pascoal, M.M.B., Captivo, M.E.V. & Clímaco, J.C.N. (2005). An algorithm for ranking quickest simple paths. Computers and Operations Research, 32(3): 509–520

    Article  MATH  Google Scholar 

  25. Ramirez-Marquez, J., Coit, D.W. & Tortorella, M. (2006). A generalized multistate-based path vector approach for multistate two-terminal reliability. IIE Transactions, 38(6): 477–488

    Article  Google Scholar 

  26. Ramirez-Marquez, J. & Coit, D.W. (2007). Optimization of system reliability in the presence of common cause failures. Reliability Engineering & System Safety, 92(10): 1421–1434

    Article  Google Scholar 

  27. Sethi, S.P., Yeh, H.M., Zhang, R. & Jardine, A.K.S. (2008). Optimal maintenance and replacement of extraction machinery. Journal of Systems Science and Systems Engineering, 17(4): 416–431

    Article  Google Scholar 

  28. Xue, J. (1985). On multistate system analysis. IEEE Transactions on Reliability, 34(4): 329–337

    Article  Google Scholar 

  29. Yarlagadda, R. & Hershey, J. (1991). Fast algorithm for computing the reliability of communication network. International Journal of Electronics, 70(3): 549–564

    Article  MathSciNet  Google Scholar 

  30. Yeh, W.C. (2004). Multistate network reliability evaluation under the maintenance cost constraint. International Journal of Production Economics, 88(1): 73–83

    Article  Google Scholar 

  31. Yue, W., Gu, J.& Tang, X. (2004). A performance evaluation index system for multimedia communication networks and forecasting for web-based network traffic. Journal of Systems Science and Systems Engineering, 13(1): 78–97

    Article  Google Scholar 

  32. Zuo, M.J., Tian, Z. & Huang, H.Z. (2007). An efficient method for reliability evaluation of multistate networks given all minimal path vectors. IIE Transactions, 39(8): 811–817

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Management, National Taiwan University of Science & Technology, Taipei, 106, Taiwan, China

    Yi-Kuei Lin & Ping-Chen Chang

Authors
  1. Yi-Kuei Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ping-Chen Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yi-Kuei Lin.

Additional information

This work was supported in part by the National Science Council of Taiwan under Grant No. NSC 99-2221-E-011-066-MY3.

Yi-Kuei Lin is currently a Chair Professor of Industrial Management Department, National Taiwan University of Science and Technology, Taiwan, China. He received a Bachelor degree in Applied Mathematics Department from National Chiao Tung University, Taiwan. He obtained his Master degree and Ph.D. degree in the Department of Industrial Engineering and Engineering Management at National Tsing Hua University, Taiwan, China. His research interest includes performance evaluation, stochastic network reliability, operations research and telecommunication management. He got the Outstanding Research Award from the National Science Council of Taiwan in 2008 and 2010, respectively. He has published more than 90 academic papers in refereed journals including European Journal of Operational Research; Computers and Operations Research; Reliability Engineering & System Safety; IEEE Transactions on Reliability; Journal of Production Economics; Applied Mathematics and Computation; Omega, etc.

Ping-Chen Chang is currently a Ph.D. candidate of Industrial Management Department, National Taiwan University of Science and Technology, Taiwan, China. He received a Bachelor degree in the Department of Industrial and Business Management from Chang Gung University, Taiwan, China. He obtained his Master degree in the Department of Industrial Engineering and Management at Yuan Ze University, Taiwan, China. His research interest includes performance evaluation and stochastic network reliability.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lin, YK., Chang, PC. Estimated and exact system reliabilities of a maintainable computer network. J. Syst. Sci. Syst. Eng. 20, 229–248 (2011). https://doi.org/10.1007/s11518-011-5161-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11518-011-5161-2

Keywords

Search

Navigation