Stochastic and exact methods for service mapping in virtualized network infrastructures. Issue 6 (28th July 2017)

• Record Type: Journal Article
• Authors: Liberati, Francesco; Giuseppi, Alessandro; Pietrabissa, Antonio; Suraci, Vincenzo; Di Giorgio, Alessandro; Trubian, Marco; Dietrich, David; Papadimitriou, Panagiotis; Delli Priscoli, Francesco
• Other Names: Badonnel Rémi guestEditor.; Kinoshita Kazuhiko guestEditor.; Tuncer Daphné guestEditor.; Song Sejun guestEditor.
• Is Part Of: International journal of network management. Volume 27:Issue 6(2017)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2017-07-28
• Subjects: Computer networks -- Management -- Periodicals; 004.6
• DOI: 10.1002/nem.1985
• Languages: English
• ISSNs: 1055-7148

Abstract

Summary: 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. Abstract : A service mapping module is designed, in the context of a general network function virtualization architecture, and 2 distinct algorithms for service mapping are presented, based, respectively, on reinforcement learning and on integer linear programming. 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.