Optimal Network Service Chain Provisioning - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles IEEE/ACM Transactions on Networking Year : 2018

Optimal Network Service Chain Provisioning


Service chains consist of a set of network services, such as firewalls or application delivery controllers, which are interconnected through a network to support various applications. While it is not a new concept, there has been an extremely important new trend with the rise of Software-Defined Network (SDN) and Network Function Virtualization (NFV). The combination of SDN and NFV can make the service chain and application provisioning process much shorter and simpler. In this paper, we study the provisioning of service chains jointly with the number/location of Virtual Network Functions (VNFs). While chains are often built to support multiple applications, the question arises as how to plan the provisioning of service chains in order to avoid data passing through unnecessary network devices or servers and consuming extra bandwidth and CPU cycles. It requires choosing carefully the number and the location of the VNFs. We propose an exact mathematical model using decomposition methods whose solution is scalable in order to conduct such an investigation. We conduct extensive numerical experiments, and show we can solve exactly the routing of service chain requests in a few minutes for networks with up to 50 nodes, and traffic requests between all pairs of nodes. Detailed analysis is then made on the best compromise between minimizing the bandwidth requirement and minimizing the number of VNFs and optimizing their locations using different data sets.
Fichier principal
Vignette du fichier
2018-TON_NFV_Placement.pdf (1.33 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01920951 , version 1 (13-11-2018)



Nicolas Huin, Brigitte Jaumard, Frédéric Giroire. Optimal Network Service Chain Provisioning. IEEE/ACM Transactions on Networking, 2018, 26 (3), pp.1320 - 1333. ⟨10.1109/TNET.2018.2833815⟩. ⟨hal-01920951⟩
107 View
437 Download



Gmail Facebook Twitter LinkedIn More