Downloads: 11

Files in This Item:
File Description SizeFormat 
ACCESS.2019.2934725.pdf1.46 MBAdobe PDFView/Open
Title: Virtual Network Function Placement for Service Chaining by Relaxing Visit Order and Non-Loop Constraints
Authors: Hyodo, Naoki
Sato, Takehiro  kyouindb  KAKEN_id  orcid https://orcid.org/0000-0002-6253-0942 (unconfirmed)
Shinkuma, Ryoichi  kyouindb  KAKEN_id
Oki, Eiji  kyouindb  KAKEN_id  orcid https://orcid.org/0000-0003-2177-5027 (unconfirmed)
Author's alias: 佐藤, 丈博
新熊, 亮一
大木, 英司
Issue Date: 2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Journal title: IEEE Access
Volume: 7
Start page: 165399
End page: 165410
Abstract: Network Function Virtualization (NFV) is a paradigm that virtualizes traditional network functions and instantiates Virtual Network Functions (VNFs) as software instances separate from hardware appliances. Service Chaining (SC), seen as one of the major NFV use cases, provides customized services to users by concatenating VNFs. A VNF placement model for SC that relaxes the visit order constraints of requested VNFs has been considered. Relaxing the VNF visit order constraints reduces the number of VNFs which need to be placed in the network. However, since the model does not permit any loop within an SC path, the efficiency of utilization of computation resources deteriorates in some topologies. This paper proposes a VNF placement model for SC which minimizes the cost for placing VNFs and utilizing link capacity while allowing both relaxation of VNF visit order constraints and configuration of SC paths including loops. The proposed model determines routes of requested SC paths, which can have loops, by introducing a logical layered network generated from an original physical network. This model is formulated as an Integer Linear Programming (ILP) problem. A heuristic algorithm is introduced for the case that the ILP problem is not tractable. Simulation results show that the proposed model provides SC paths with smaller cost compared to the conventional model.
Rights: This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see http://creativecommons.org/licenses/by/4.0/.
URI: http://hdl.handle.net/2433/259086
DOI(Published Version): 10.1109/ACCESS.2019.2934725
Appears in Collections:Journal Articles

Show full item record

Export to RefWorks


Export Format: 


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.