IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v244y2016i1d10.1007_s10479-014-1742-z.html
   My bibliography  Save this article

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

Author

Listed:
  • Yi-Kuei Lin

    (National Taiwan University of Science and Technology)

  • Shin-Guang Chen

    (Tungnan University)

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.

Suggested Citation

  • Yi-Kuei Lin & Shin-Guang Chen, 2016. "Double resource optimization for a robust computer network subject to a transmission budget," Annals of Operations Research, Springer, vol. 244(1), pages 133-162, September.
    • Handle: RePEc:spr:annopr:v:244:y:2016:i:1:d:10.1007_s10479-014-1742-z
    DOI: 10.1007/s10479-014-1742-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-014-1742-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-014-1742-z?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Ilfat Ghamlouche & Teodor Crainic & Michel Gendreau, 2004. "Path Relinking, Cycle-Based Neighbourhoods and Capacitated Multicommodity Network Design," Annals of Operations Research, Springer, vol. 131(1), pages 109-133, October.
    2. Pentico, David W., 2007. "Assignment problems: A golden anniversary survey," European Journal of Operational Research, Elsevier, vol. 176(2), pages 774-793, January.
    3. K.-P. Hui & N. Bean & M. Kraetzl & Dirk Kroese, 2005. "The Cross-Entropy Method for Network Reliability Estimation," Annals of Operations Research, Springer, vol. 134(1), pages 101-118, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Chang, Ping-Chen & Huang, Ding-Hsiang & Lin, Yi-Kuei & Nguyen, Thi-Phuong, 2021. "Reliability and maintenance models for a time-related multi-state flow network via d-MC approach," Reliability Engineering and System Safety, Elsevier, vol. 216(C).
    2. Ping-Chen Chang, 2022. "Reliability evaluation and big data analytics architecture for a stochastic flow network with time attribute," Annals of Operations Research, Springer, vol. 311(1), pages 3-18, April.
    3. 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.

    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. Agarwal, Y.K. & Aneja, Y.P. & Jayaswal, Sachin, 2022. "Directed fixed charge multicommodity network design: A cutting plane approach using polar duality," European Journal of Operational Research, Elsevier, vol. 299(1), pages 118-136.
    2. Amit Kumar & Anila Gupta, 2013. "Mehar’s methods for fuzzy assignment problems with restrictions," Fuzzy Information and Engineering, Springer, vol. 5(1), pages 27-44, March.
    3. Pritibhushan Sinha, 2009. "Assignment problems with changeover cost," Annals of Operations Research, Springer, vol. 172(1), pages 447-457, November.
    4. Qingzhu Yao & Xiaoyan Zhu & Way Kuo, 2014. "A Birnbaum-importance based genetic local search algorithm for component assignment problems," Annals of Operations Research, Springer, vol. 212(1), pages 185-200, January.
    5. Ágoston, Kolos Csaba & Biró, Péter & Szántó, Richárd, 2018. "Stable project allocation under distributional constraints," Operations Research Perspectives, Elsevier, vol. 5(C), pages 59-68.
    6. Qing Han, 2013. "Managing Emergencies Optimally Using a Random Neural Network-Based Algorithm," Future Internet, MDPI, vol. 5(4), pages 1-20, October.
    7. Morrill, Thayer & Roth, Alvin E., 2024. "Top trading cycles," Journal of Mathematical Economics, Elsevier, vol. 112(C).
    8. Christian Billing & Florian Jaehn & Thomas Wensing, 2020. "Fair task allocation problem," Annals of Operations Research, Springer, vol. 284(1), pages 131-146, January.
    9. Diefenbach, Heiko & Emde, Simon & Glock, Christoph H., 2020. "Loading tow trains ergonomically for just-in-time part supply," European Journal of Operational Research, Elsevier, vol. 284(1), pages 325-344.
    10. Emiliya Lazarova & Peter Borm & Arantza Estévez-Fernández, 2016. "Transfers and exchange-stability in two-sided matching problems," Theory and Decision, Springer, vol. 81(1), pages 53-71, June.
    11. Igor Litvinchev & Socorro Rangel & Jania Saucedo, 2010. "A Lagrangian bound for many-to-many assignment problems," Journal of Combinatorial Optimization, Springer, vol. 19(3), pages 241-257, April.
    12. Ali Kadhem, Athraa & Abdul Wahab, Noor Izzri & Aris, Ishak & Jasni, Jasronita & Abdalla, Ahmed N., 2017. "Computational techniques for assessing the reliability and sustainability of electrical power systems: A review," Renewable and Sustainable Energy Reviews, Elsevier, vol. 80(C), pages 1175-1186.
    13. 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.
    14. Stefan Gollowitzer & Bernard Gendron & Ivana Ljubić, 2013. "A cutting plane algorithm for the Capacitated Connected Facility Location Problem," Computational Optimization and Applications, Springer, vol. 55(3), pages 647-674, July.
    15. 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.
    16. Ahmed Ghoniem & Tulay Flamand & Mohamed Haouari, 2016. "Optimization-Based Very Large-Scale Neighborhood Search for Generalized Assignment Problems with Location/Allocation Considerations," INFORMS Journal on Computing, INFORMS, vol. 28(3), pages 575-588, August.
    17. Sutton, Warren & Dimitrov, Stanko, 2013. "The U.S. Navy explores detailing cost reduction via Data Envelopment Analysis," European Journal of Operational Research, Elsevier, vol. 227(1), pages 166-173.
    18. Matusiak, M. & de Koster, M.B.M. & Saarinen, J., 2015. "Data-driven warehouse optimization," ERIM Report Series Research in Management ERS-2015-008-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    19. Boštjan Gabrovšek & Tina Novak & Janez Povh & Darja Rupnik Poklukar & Janez Žerovnik, 2020. "Multiple Hungarian Method for k -Assignment Problem," Mathematics, MDPI, vol. 8(11), pages 1-18, November.
    20. Guojun Hu & Junran Lichen & Pengxiang Pan, 2023. "Two Combinatorial Algorithms for the Constrained Assignment Problem with Bounds and Penalties," Mathematics, MDPI, vol. 11(24), pages 1-12, December.

    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:spr:annopr:v:244:y:2016:i:1:d:10.1007_s10479-014-1742-z. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.