Abstract
From the viewpoint of service level agreements, the transmission accuracy rate is one of critical performance indicators to assess internet quality for system managers and customers. Under the assumption that each arc’s capacity is deterministic, the quickest path problem is to find a path sending a specific of data such that the transmission time is minimized. However, in many real-life networks such as computer networks, each arc has stochastic capacity, lead time and accuracy rate. Such a network is named a multi-state computer network. Under both assured accuracy rate and time constraints, we extend the quickest path problem to compute the probability that d units of data can be sent through multiple minimal paths simultaneously. Such a probability named system reliability is a performance indicator to provide to managers for understanding the ability of system and improvement. An efficient algorithm is proposed to evaluate the system reliability in terms of the approach of minimal paths.
Similar content being viewed by others
References
Amer, P.D. (1982). A measurement center for the NBS local area computer network. IEEE Transactions on Computers, C-31: 723–729
Aven, T. (1985). Reliability evaluation of multistate systems with multistate components. IEEE Transactions on Reliability, R-34: 473–479
Chen, G.H. & Hung, Y.C. (1993). On the quickest path problem. Information Processing Letters, 46: 125–128
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: 113–118
Chen, Y.L. (1993). An algorithm for finding the k quickest paths in a network. Computers and Operations Research, 20: 59–65
Chen, Y.L. (1994). Finding the k quickest simples paths in a network. Information Processing Letters, 50: 89–92
Chen, Y.L. & Chin, Y.H. (1990). The quickest path problem. Computers and Operations Research, 17: 153–161
Chen, Y.L. & Tang, K. (1998). Minimum time paths in a network with mixed time constraints. Computers and Operations Research, 25: 793–805
Cheng, S.T. (1998). Topological optimization of a reliable communication network. IEEE Transactions on Reliability, 47: 225–233
Chlamtac, I. (1980). Issues in design and measurement of local area networking. In Proc. Comput. Measurement Group Conference CMG XI Dec: 32–34
Choi, B.Y., Park, J. & Zhang, Z.L. (2003). Adaptive random sampling for traffic load measurement. IEEE Int. Conf., on Communications (ICC’ 03), May, Anchorage, Alaska: 1552–1556
Clímaco JCN, Pascoal MMB, Craveirinha JMF, Captivo MEV (2007). Internet packet routing: application of a K-quickest path algorithm. European Journal of Operational Research, 181: 1045–1054
Chang, P.C. & Lin, Y.K. (2010). New challenges and opportunities in flexible and robust supply chain forecasting systems. International Journal of Production Economics, 128: 453–456
Feldmann, A., Greenberg, A., Reingold, N., Lund, C., Rexford, J. & True, F. (2001). Deriving traffic demands for operational IP networks: Methodology and experience. IEEE/ACM Transactions on Networking, 3: 265–279
Ford, L.R. & Fulkerson, D.R. (1962). Flows in Networks, Princeton University Press, New Jersy
Hung, Y.C. & Chen, G.H. (1992). Distributed algorithms for the quickest path problem. Parallel Computing, 18: 823–834
Jain, R. & Routhier, S.A. (1986). Packet trains: Measurements and a new model for computer network traffic. IEEE Journal on Selected Areas Communications, 4: 986–995
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: 354–361
Jedwab, J., Phaal, P. & Pinna, B. (1992). Traffic estimation for the largest sources, on a network, using packet sampling with limited storage. Technical Report, HPL-92-35, HP Labs Techniacl Report
Lee, D.T. & Papadopoulou, E. (1993). The all-pairs quickest path problem Information. Processing Letters, 45: 261–267
Levitin, G. & Lisnianski, A. (2001). A new approach to solving problems of multi-state system reliability optimization. Quality Reliability Engineering International, 17: 93–104
Lin, J.S., Jane, C.C. & Yuan, J. (1995). On reliability evaluation of a capacitated-flow network in terms of minimal pathsets. Network, 25: 131–138
Lin, Y.K. (2003). Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network. Computers and Operations Research, 30: 567–575
Lin, Y.K. (2007a). Reliability evaluation for an information network with node failure under cost constraint. IEEE Transactions on Systems, Man and Cybernetics — Part A, Systems and Humans, 37: 180–188
Lin, Y.K. (2007b). On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint. European Journal of Operational Research, 176: 347–360
Lin, Y.K. (2009). Time version of the shortest path problem in a stochastic-flow network. Journal of Computational and Applied Mathematics, 228: 150–157
Lin, Y.K. (2010). System reliability of a stochastic-flow network through two minimal paths under time threshold. International Journal of Production Economics, 124: 382–387
Lin, Y.K. & Chang, P.C. (2011). Estimated and exact system reliabilities of a maintainable computer network. Journal of Systems Science and Systems Engineering, 20: 229–248
Martins EDQV, JLED Santos (1997). An algorithm for the quickest path problem. Operations Research Letters, 20: 195–198
Meo, P.D., Iera, A., Terracina, G. & Ursino, D. (2005). A multi-agent system for managing the quality of service in telecommunications networks. Journal of Systems Science and Systems Engineering, 14: 129–158
Mori, T., Takine, T., Pan, J., Kawahara, R., Uchida, M. & Goto, S. (2007). Identifying heavy-hitter flows from sampled flow statistics. IEICE Transactions on Communications, E90-B: 3061–3072
Park, C.K., Lee, S. & Park, S. (2004). A label-setting algorithm for finding a quickest path. Computers and Operations Research, 31: 2405–2418
Pascoal MMB, Captivo MEV, Clímaco JCN (2005). An algorithm for ranking quickest simple paths. Computers and Operations Research, 32: 509–520
Sausen, P.S., Spohn, M.A. & Perkusich, A. (2010). Broadcast routing in wireless sensor networks with dynamic power management and multi-coverage backbones. Information Sciences, 180: 653–663
Xue, J. (1985). On multistate system analysis. IEEE Transactions on Reliability, R-34: 329–337
Yeh, W.C. (2004). Multistate network reliability evaluation under the maintenance cost constraints. International Journal of Production Economics, 88: 73–83
Yeh, W.C. (2005). A new approach to evaluating reliability of multistate networks under the cost constraint. Omega, 33: 203–209
Yeh, W.C. (2008). A simple minimal path method for estimating the weighted multi-commodity multistate unreliable networks reliability. Reliability Engineering and System Safety, 93: 125–136
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: 811–817
Author information
Authors and Affiliations
Corresponding author
Additional information
Yi-Kuei Lin is currently a Chair Professor and the Chairman of Industrial Management Department, National Taiwan University of Science and Technology, Taiwan, Republic of 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, Republic of China. He has the honor to get the Outstanding Research Awards from National Science Council of Taiwan in 2008 and 2010, respectively. His research interest includes performance evaluation, stochastic network reliability, operations research, and telecommunication management.
Cheng-Fu Huang is currently a Postdoctoral Fellow of Industrial Management Department, National Taiwan University of Science and Technology, Taiwan, Republic of China. He received his Bachelor degree in the Department of Industrial Engineering from Feng Chia University, Taiwan, in 2004; Master degree in the Department of Industrial Engineering and Management at National Chin-Yi University of Technology, Taiwan, in 2006; and the Ph.D. degree in the Department of Industrial Management in National Taiwan University of Science and Technology, Taiwan, in 2010. His research interest includes stochastic network reliability, performance evaluation, and quality management.
Rights and permissions
About this article
Cite this article
Lin, YK., Huang, CF. System reliability of assured accuracy rate for multi-state computer networks from service level agreements viewpoint. J. Syst. Sci. Syst. Eng. 23, 196–211 (2014). https://doi.org/10.1007/s11518-014-5240-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11518-014-5240-2