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. Pentico, David W., 2007. "Assignment problems: A golden anniversary survey," European Journal of Operational Research, Elsevier, vol. 176(2), pages 774-793, January.
    2. 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.
    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. 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.
    2. 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.
    3. 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).

    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. Kin-Ping Hui, 2011. "Cooperative Cross-Entropy method for generating entangled networks," Annals of Operations Research, Springer, vol. 189(1), pages 205-214, September.
    5. Ágoston, Kolos Csaba & Biró, Péter & Kováts, Endre & Jankó, Zsuzsanna, 2022. "College admissions with ties and common quotas: Integer programming approach," European Journal of Operational Research, Elsevier, vol. 299(2), pages 722-734.
    6. 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.
    7. Cai, Zhiqiang & Si, Shubin & Sun, Shudong & Li, Caitao, 2016. "Optimization of linear consecutive-k-out-of-n system with a Birnbaum importance-based genetic algorithm," Reliability Engineering and System Safety, Elsevier, vol. 152(C), pages 248-258.
    8. Agatz, Niels & Erera, Alan & Savelsbergh, Martin & Wang, Xing, 2012. "Optimization for dynamic ride-sharing: A review," European Journal of Operational Research, Elsevier, vol. 223(2), pages 295-303.
    9. Yokoya, Daisuke & Duin, Cees W. & Yamada, Takeo, 2011. "A reduction approach to the repeated assignment problem," European Journal of Operational Research, Elsevier, vol. 210(2), pages 185-193, April.
    10. Li, Xiangyong & Wei, Kai & Aneja, Y.P. & Tian, Peng, 2017. "Design-balanced capacitated multicommodity network design with heterogeneous assets," Omega, Elsevier, vol. 67(C), pages 145-159.
    11. Walteros, Jose L. & Vogiatzis, Chrysafis & Pasiliao, Eduardo L. & Pardalos, Panos M., 2014. "Integer programming models for the multidimensional assignment problem with star costs," European Journal of Operational Research, Elsevier, vol. 235(3), pages 553-568.
    12. Mike Hewitt & George Nemhauser & Martin W. P. Savelsbergh, 2013. "Branch-and-Price Guided Search for Integer Programs with an Application to the Multicommodity Fixed-Charge Network Flow Problem," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 302-316, May.
    13. Jardar Andersen & Marielle Christiansen & Teodor Gabriel Crainic & Roar Grønhaug, 2011. "Branch and Price for Service Network Design with Asset Management Constraints," Transportation Science, INFORMS, vol. 45(1), pages 33-49, February.
    14. Krumke, Sven O. & Thielen, Clemens, 2013. "The generalized assignment problem with minimum quantities," European Journal of Operational Research, Elsevier, vol. 228(1), pages 46-55.
    15. Batel Ziv & Yisrael Parmet, 2022. "Improving nonconformity responsibility decisions: a semi-automated model based on CRISP-DM," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 13(2), pages 657-667, April.
    16. Talmor, Irit, 2022. "Solving the problem of maximizing diversity in public sector teams," Socio-Economic Planning Sciences, Elsevier, vol. 81(C).
    17. Zheng, Feifeng & Cheng, Yongxi & Xu, Yinfeng & Liu, Ming, 2013. "Competitive strategies for an online generalized assignment problem with a service consecution constraint," European Journal of Operational Research, Elsevier, vol. 229(1), pages 59-66.
    18. Á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.
    19. Qing Han, 2013. "Managing Emergencies Optimally Using a Random Neural Network-Based Algorithm," Future Internet, MDPI, vol. 5(4), pages 1-20, October.
    20. 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.

    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.