%0 Conference Proceedings
%T Optimal Service Function Chain Composition in Network Functions Virtualization
%+ Universidad de Antioquia = University of Antioquia [Medellín, Colombia]
%+ University of Antwerp (UA)
%+ Universidade Federal do Rio Grande do Sul [Porto Alegre] (UFRGS)
%A Ocampo, Andrés, F.
%A Gil-Herrera, Juliver
%A Isolani, Pedro, H.
%A Neves, Miguel, C.
%A Botero, Juan, F.
%A Latré, Steven
%A Zambenedetti, Lisandro
%A Barcellos, Marinho, P.
%A Gaspary, Luciano, P.
%Z Part 2: Management of Cloud Environments and Services
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 11th IFIP International Conference on Autonomous Infrastructure, Management and Security (AIMS)
%C Zurich, Switzerland
%Y Daphne Tuncer
%Y Robert Koch
%Y Rémi Badonnel
%Y Burkhard Stiller
%I Springer International Publishing
%3 Security of Networks and Services in an All-Connected World
%V LNCS-10356
%P 62-76
%8 2017-07-10
%D 2017
%R 10.1007/978-3-319-60774-0_5
%K Network Function Virtualization
%K Virtual Network Functions
%K Service Function Chain
%K VNFs chain composition
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X Network Functions Virtualization (NFV) is an emerging initiative where virtualization is used to consolidate Network Functions (NFs) onto high volume servers (HVS), switches, and storage. In addition, NFV provides flexibility as Virtual Network Functions (VNFs) can be moved to different locations in the network. One of the major challenges of NFV is the allocation of demanded network services in the network infrastructures, commonly referred to as the Network Functions Virtualization - Resource Allocation (NFV-RA) problem. NFV-RA is divided into three stages: (i) Service Function Chain (SFC) composition, (ii) SFC embedding and (iii) SFC scheduling. Up to now, existing NFV-RA approaches have mostly tackled the SFC embedding stage taking the SFC composition as an assumption. Few approaches have faced the composition of the SFCs using heuristic approaches that do not guarantee optimal solutions. In this paper, we solve the first stage of the problem by characterizing the service requests in terms of NFs and optimally building the SFC using an Integer Linear Programming (ILP) approach.
%G English
%Z TC 6
%Z WG 6.6
%2 https://inria.hal.science/hal-01806068/document
%2 https://inria.hal.science/hal-01806068/file/452969_1_En_5_Chapter.pdf
%L hal-01806068
%U https://inria.hal.science/hal-01806068
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC6
%~ IFIP-AIMS
%~ IFIP-WG6-6
%~ IFIP-LNCS-10356