IDEAS home Printed from https://ideas.repec.org/a/wly/intnem/v27y2017i6ne1985.html
   My bibliography  Save this article

Stochastic and exact methods for service mapping in virtualized network infrastructures

Author

Listed:
  • Francesco Liberati
  • Alessandro Giuseppi
  • Antonio Pietrabissa
  • Vincenzo Suraci
  • Alessandro Di Giorgio
  • Marco Trubian
  • David Dietrich
  • Panagiotis Papadimitriou
  • Francesco Delli Priscoli

Abstract

This paper presents a stochastic algorithm for virtual network service mapping in virtualized network infrastructures, based on reinforcement learning (RL). An exact mapping algorithm in line with the current state of the art and based on integer linear programming is proposed as well, and the performances of the two algorithms are compared. While most of the current works in literature report exact or heuristic mapping methods, the RL algorithm presented here is instead a stochastic one, based on Markov decision processes theory. The aim of the RL algorithm is to iteratively learn an efficient mapping policy, which could maximize the expected mapping reward in the long run. Based on the review of the state of the art, the paper presents a general model of the service mapping problem and the mathematical formulation of the 2 proposed strategies. The distinctive features of the 2 algorithms, their strengths, and possible drawbacks are discussed and validated by means of numeric simulations in a realistic emulated environment.

Suggested Citation

  • Francesco Liberati & Alessandro Giuseppi & Antonio Pietrabissa & Vincenzo Suraci & Alessandro Di Giorgio & Marco Trubian & David Dietrich & Panagiotis Papadimitriou & Francesco Delli Priscoli, 2017. "Stochastic and exact methods for service mapping in virtualized network infrastructures," International Journal of Network Management, John Wiley & Sons, vol. 27(6), November.
    • Handle: RePEc:wly:intnem:v:27:y:2017:i:6:n:e1985
    DOI: 10.1002/nem.1985
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nem.1985
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nem.1985?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:wly:intnem:v:27:y:2017:i:6:n:e1985. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1099-1190 .

    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.