Idioma:

Service Function Chain Composition, Placement, and Assignment in Data Centers

Wang, Zenan ; Zhang, Jiao ; Huang, Tao ; Liu, Yunjie

IEEE eTransactions on network and service management, 2019-12, Vol.16 (4), p.1638-1650 [Periódico revisado por pares]

New York: IEEE

Texto completo disponível

Citações Citado por

Enviar para

Título:
Service Function Chain Composition, Placement, and Assignment in Data Centers
Autor: Wang, Zenan ; Zhang, Jiao ; Huang, Tao ; Liu, Yunjie
Assuntos: Chains ; Composition ; Computer simulation ; Data centers ; Heuristic algorithms ; Heuristic methods ; Integer programming ; Job shop scheduling ; Linear programming ; Mathematical analysis ; Mathematical model ; Mathematical models ; Network function virtualization ; Operators (mathematics) ; Placement ; Resource allocation ; Resource management ; Servers ; SFC composition ; virtual network function assignment ; virtual network function placement ; Virtual networks
É parte de: IEEE eTransactions on network and service management, 2019-12, Vol.16 (4), p.1638-1650
Descrição: With the development of network function virtualization (NFV), service function chains (SFCs) are deployed via virtual network functions (VNFs). In general, the SFCs are served via composition and then deployed into data center infrastructures. However, most of the existing works neglect SFC composition. Furthermore, they consider that VNF instances are independently deployed for each SFC, which may underutilize the computational power of servers. We consider, for each required VNF in the chain, the operator can either place it on a new instance or assign it to an established instance if the residual resource of that instance is sufficient. Such a deployment scheme can leverage resources more efficiently and we define it as SFC placement and assignment. In this paper, we first combine SFC composition, placement and assignment together to enhance resource allocation. We present the system model and formulate the problem as 0-1 integer programming. We aim to improve the VNF instance utilization as well as reduce the link consumption. A heuristic approach called Jcap is developed to solve the problem in two stages. The simulations show that Jcap achieves competitive performance with the optimal results obtained from mathematical model.
Editor: New York: IEEE
Idioma: Inglês

Voltar para lista de resultados

Realização: Logos de Redes Sociais:

Service Function Chain Composition, Placement, and Assignment in Data Centers

Wang, Zenan ; Zhang, Jiao ; Huang, Tao ; Liu, Yunjie

New York: IEEE

Buscando em bases de dados remotas. Favor aguardar.