Skip to main content
SpringerLink
Log in

Double resource optimization for a robust computer network subject to a transmission budget

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

To maintain a reliable computer network is now a challenge in our daily business operations especially when the transmission budget is limited. A computer network usually consists of transmission lines and transmission facilities, both of which may suffer failure, partial failure, or be in maintenance. Such a computer network is called a stochastic-flow network, since both kinds of resources are stochastic in nature. The problem of double resource optimization for a robust computer network subject to a transmission budget (DROCNTB) is to search for the exact minimum double-resource assignments under transmission-budget constraint such that the computer network keeps survived even under both kinds of failures. This paper develops an efficient algorithm to search for the exact optimal assignment for the DROCNTB problem. Several benchmark examples are explored and compared. The results show that the proposed algorithm is very efficient.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

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

    Article  Google Scholar 

  • Ball, M. O. (1986). Computational complexity of network reliability analysis: An overview. IEEE Transactions on Reliability, 35(3), 230–238.

    Article  Google Scholar 

  • Bidhandi, H. M., & Yusuff, R. M. (2011). Integrated supply chain planning under uncertainty using an improved stochastic approach. Applied Mathematical Modelling, 35, 2618–2630.

    Article  Google Scholar 

  • Chabrier, A., Danna, E., Le Pape, C., & Perron, L. (2004). Solving a network design problem. Annals of Operations Research, 130(1–4), 217–239.

    Article  Google Scholar 

  • Chan, Y., Yim, E., & Marsh, A. (1997). Exact and approximate improvement to the throughput of a stochastic network. IEEE Transactions on Reliability, 46(4), 473–486.

    Article  Google Scholar 

  • Chen, S. G. (2009). Performance evaluation for an ERP system in case of system failures. In: 16th ISPE international conference on concurrent engineering (pp. 361–369). Taiwan, Taipei.

  • Cheng, S. (1998). Topological optimization a reliable communication network. IEEE Transactions on Reliability, 47(1), 23–31.

    Google Scholar 

  • Coit, D., & Smith, A. (1996). Reliability optimization of series-parallel systems using genetic algorithm. IEEE Transactions on Reliability, 45(2), 254–266.

    Article  Google Scholar 

  • Colbourn, C. J. (1987). The combinatorics of network reliability. UK: Oxford University Press.

    Google Scholar 

  • Ford, L. R., & Fulkerson, D. R. (1962). Flows in networks. Princeton, NJ: Princeton University Press.

    Google Scholar 

  • Ghamlouche, I., Crainic, T. G., & Gendreau, M. (2004). Path relinking, cycle-based neighbour hoods and capacitated multicommodity network design. Annals of Operations Research, 131(1–4), 109–133.

    Article  Google Scholar 

  • Hsieh, C. C., & Chen, Y. T. (2005). Reliable and economic resource allocation in an unreliable flow network. Computers and Operations Research, 32, 613–628.

    Article  Google Scholar 

  • Hsieh, C. C., & Lin, M. H. (2003). Reliability-oriented multi-resource allocation in a stochastic-flow network. Reliability Engineering and System Safety, 81, 155–161.

    Article  Google Scholar 

  • Hui, K. P., Bean, N., Kraetzl, M., & Kroese, D. P. (2005). The cross-entropy method for network reliability estimation. Annals of Operations Research, 134(1), 101–118.

    Article  Google Scholar 

  • Jane, C. C., & Laih, Y. W. (2008). A practical algorithm for computing multi-state two-terminal reliability. IEEE Transactions on Reliability, 57(2), 295–302.

    Article  Google Scholar 

  • Levitin, G., & Lisnianski, A. (2001). A new approach to solving problems of multi-state system reliability optimization. Quality Reliability Engineering International, 17(2), 93–104.

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Lin, Y. K. (2001a). On reliability evaluation of a stochastic-flow network in terms of minimal cuts. Journal of Chinese Institute of Industrial Engineers, 18, 49–54.

    Article  Google Scholar 

  • Lin, Y. K. (2001b). A simple algorithm for reliability evaluation of a stochastic-flow network with node failure. Computers and Operations Research, 28(13), 1277–1285.

    Article  Google Scholar 

  • Lin, Y. K., & Yeh, C. T. (2011). Computer network reliability optimization under double-resource assignments subject to a transmission budget. Information Sciences, 181, 582–599.

    Article  Google Scholar 

  • Liu, Q., Zhang, H., Ma, X., & Zhao, Q. (2007). Genetic algorithm-based study on flow allocation in a multicommodity stochastic-flow network with unreliable nodes. In: The eighth ACIS international conference on software engineering, artificial intelligence, networking and parallel/distributed computing (pp. 576–581).Artificial Intelligence.

  • Murakami, K., & Kim, H. S. (1995). Joint optimization of capacity and flow assignment for self-healing atm networks. IEEE International Conference on Communications, 1, 216–220.

    Article  Google Scholar 

  • Oommen, B. J., & Roberts, T. D. (2000). Continuous learning automata solutions to the capacity assignment problem. IEEE Transactions on Computers, 49(6), 608–620.

    Article  Google Scholar 

  • Pentico, D. W. (2007). Assignment problems, a golden anniversary survey. European Journal of Operational Research, 176, 774–793.

    Article  Google Scholar 

  • Racer, M., & Amini, M. M. (1994). A robust heuristic for the generalized assignment problem. Annals of Operations Research, 50(1), 487–503.

    Article  Google Scholar 

  • Winston, W. L. (1995). Introduction to mathematical programming: Application and algorithms. California: Duxbury Press.

    Google Scholar 

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

    Google Scholar 

  • Yeh, W. C. (2001). A simple approach to search for all d-MCs of a limited-flow network. Reliability Engineering and System Safety, 71, 15–19.

    Article  Google Scholar 

  • Zantuti AF (2008) Algorithms for capacities and flow assignment problem in computer networks. In: 19th international conference on systems engineering, pp. 315–318.

  • 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.

    Article  Google Scholar 

Download references

Acknowledgments

This work was supported in part by the National Science Council, Taiwan, Republic of China, under Grant No. NSC 101-2221-E-236-006.

Author information

Authors and Affiliations

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

    Yi-Kuei Lin

  2. Department of Industrial Management, Tungnan University, New Taipei City, 222, Taiwan

    Shin-Guang Chen

Authors
  1. Yi-Kuei Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shin-Guang Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shin-Guang Chen.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lin, YK., Chen, SG. Double resource optimization for a robust computer network subject to a transmission budget. Ann Oper Res 244, 133–162 (2016). https://doi.org/10.1007/s10479-014-1742-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-014-1742-z

Keywords

Search

Navigation