IDEAS home Printed from https://ideas.repec.org/a/gam/jftint/v14y2022i9p263-d913422.html
   My bibliography  Save this article

Trade-offs between Risk and Operational Cost in SDN Failure Recovery Plan

Author

Listed:
  • Saeed A. Astaneh

    (Faculty of Business and Information Technology, University of Ontario Institute of Technology, Oshawa, ON L1G 0C5, Canada)

  • Shahram Shah Heydari

    (Faculty of Business and Information Technology, University of Ontario Institute of Technology, Oshawa, ON L1G 0C5, Canada)

  • Sara Taghavi Motlagh

    (Faculty of Business and Information Technology, University of Ontario Institute of Technology, Oshawa, ON L1G 0C5, Canada)

  • Alireza Izaddoost

    (Department of Computer Science, California State University, Dominguez Hills, Carson, CA 90747, USA)

Abstract

We consider the problem of SDN flow optimization in the presence of a dynamic probabilistic link failures model. We introduce a metric for path risk, which can change dynamically as network conditions and failure probabilities change. As these probabilities change, the end-to-end path survivability probability may drop, i.e., its risk may rise. The main objective is to reroute at-risk end-to-end flows with the minimum number of flow operation so that a fast flow recovery is guaranteed. We provide various formulations for optimizing network risk versus operational costs and examine the trade-offs in flow recovery and the connections between operational cost, path risk, and path survival probability. We present our suboptimal dynamic flow restoration methods and evaluate their effectiveness against the Lagrangian relaxation approach. Our results show a significant improvement in operational cost against a shortest-path approach.

Suggested Citation

  • Saeed A. Astaneh & Shahram Shah Heydari & Sara Taghavi Motlagh & Alireza Izaddoost, 2022. "Trade-offs between Risk and Operational Cost in SDN Failure Recovery Plan," Future Internet, MDPI, vol. 14(9), pages 1-15, September.
    • Handle: RePEc:gam:jftint:v:14:y:2022:i:9:p:263-:d:913422
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/14/9/263/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/1999-5903/14/9/263/
    Download Restriction: no
    ---><---

    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:gam:jftint:v:14:y:2022:i:9:p:263-:d:913422. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.