@inproceedings{f53d91b4a81442ada7c6b534e7a76ad1,
title = "Optimal traffic engineering and placement of virtual machines in SDNs with service chaining",
abstract = "In this paper, we investigate the service capacity of a software-defined network with network function virtualization and service chaining. To obtain and achieve the service capacity, we formulate a mixed integer linear programming problem to jointly optimize the placement of virtual machines and the steering of network flows. In addition, we propose the greedy linear programming relaxation algorithm for efficiently obtaining solutions in three phases based on auxiliary linear programming problems and augmented service paths. We justify the usage of the proposed approach by analytical results and simulation results.",
keywords = "linear programming, network capacity, network function virtualization, optimal placement, service chaining, software-defined network, traffic engineering",
author = "Rung-Hung Gau",
year = "2017",
month = aug,
day = "7",
doi = "10.1109/NETSOFT.2017.8004105",
language = "English",
series = "2017 IEEE Conference on Network Softwarization: Softwarization Sustaining a Hyper-Connected World: en Route to 5G, NetSoft 2017",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
booktitle = "2017 IEEE Conference on Network Softwarization",
address = "United States",
note = "2017 IEEE Conference on Network Softwarization, NetSoft 2017 ; Conference date: 03-07-2017 Through 07-07-2017",
}