Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLiberati, Francesco-
dc.contributor.authorGiuseppi, Alessandro-
dc.contributor.authorPietrabissa, Antonio-
dc.contributor.authorSuraci, Vincenzo-
dc.contributor.authorDi Giorgio, Alessandro-
dc.contributor.authorTrubian, Marco-
dc.contributor.authorDietrich, David-
dc.contributor.authorPapadimitriou, Panagiotis-
dc.contributor.authorDelli Priscoli, Francesco-
dc.description.abstractThis 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.en_US
dc.sourceInternational Journal of Network Managementen_US
dc.subjectFRASCATI::Engineering and technology::Electrical engineering, Electronic engineering, Information engineeringen_US
dc.titleStochastic and exact methods for service mapping in virtualized network infrastructuresen_US
dc.contributor.departmentΤμήμα Εφαρμοσμένης Πληροφορικήςen_US
Appears in Collections:Department of Applied Informatics

Files in This Item:
File Description SizeFormat 
wiley.pdfPaper833,24 kBAdobe PDFThumbnail

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.