Optimal Service Function Chain Placement Modeling for Minimizing Setup and Operation Cost

被引:0
|
作者
Xu, Yansen [1 ]
Kafle, Ved P. [1 ,2 ]
机构
[1] Univ Electrocommun, Chofu, Tokyo, Japan
[2] Natl Inst Informat & Commun Technol, Tokyo, Japan
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A service function chaining (SFC) problem is to find out a set of nodes and paths in substrate networks for the placement of virtual network functions (VNFs) so that end-to-end bandwidth and latency requirements are satisfied. We define setup and operation cost, and formulate the SFC placement problem as an Integer Linear Programming (ILP) model with the objective to minimize the overall costs of setup and operation, while satisfying the bandwidth and CPU constraints of each node. We evaluate performance with different objectives of SFC such as latency minimization and maintenance of the order of VNFs in the SFC.
引用
收藏
页数:3
相关论文
共 50 条
  • [1] Service Function Chain Placement for Joint Cost and Latency Optimization
    Mohammad Ali Khoshkholghi
    Michel Gokan Khan
    Kyoomars Alizadeh Noghani
    Javid Taheri
    Deval Bhamare
    Andreas Kassler
    Zhengzhe Xiang
    Shuiguang Deng
    Xiaoxian Yang
    Mobile Networks and Applications, 2020, 25 : 2191 - 2205
  • [2] Service Function Chain Placement for Joint Cost and Latency Optimization
    Khoshkholghi, Mohammad Ali
    Khan, Michel Gokan
    Noghani, Kyoomars Alizadeh
    Taheri, Javid
    Bhamare, Deval
    Kassler, Andreas
    Xiang, Zhengzhe
    Deng, Shuiguang
    Yang, Xiaoxian
    MOBILE NETWORKS & APPLICATIONS, 2020, 25 (06): : 2191 - 2205
  • [3] Optimal Placement of Service Function in Service Function Chaining
    Ko, Haneul
    Suh, Dongeun
    Baek, Hosung
    Pack, Sangheon
    Kwak, Jiyoung
    2016 EIGHTH INTERNATIONAL CONFERENCE ON UBIQUITOUS AND FUTURE NETWORKS (ICUFN), 2016, : 102 - 105
  • [4] Optimal Bus Stop Spacing for Minimizing Transit Operation Cost
    Li, Huan
    Bertini, Robert L.
    TRAFFIC AND TRANSPORTATION STUDIES, 2008, : 553 - 564
  • [5] Probabilistic Service Function Placement and Dynamic Service Function Chain Formation
    Laxmana, Anusha
    Nagaraja, Prathviraj
    Udupa Nagara Vinayaka, Sayinath
    IEEE ACCESS, 2024, 12 : 121261 - 121268
  • [6] Cost-aware Placement and Chaining of Service Function Chain with VNF Instance Sharing
    Guo, Hantao
    Wang, Ying
    Li, Zifan
    Qiu, Xuesong
    An, Hengbin
    Yu, Peng
    Yuan, Ningcheng
    NOMS 2020 - PROCEEDINGS OF THE 2020 IEEE/IFIP NETWORK OPERATIONS AND MANAGEMENT SYMPOSIUM 2020: MANAGEMENT IN THE AGE OF SOFTWARIZATION AND ARTIFICIAL INTELLIGENCE, 2020,
  • [7] Online Service Function Chain Placement for Cost-Effectiveness and Network Congestion Control
    Shang, Xiaojun
    Liu, Zhenhua
    Yang, Yuanyuan
    IEEE TRANSACTIONS ON COMPUTERS, 2022, 71 (01) : 27 - 39
  • [8] Minimizing Cost and Power loss by Optimal Placement of Capacitor using ETAP
    Chopade, Pravin
    Bikdash, Marwan
    PROCEEDINGS SSST 2011: 43RD IEEE SOUTHEASTERN SYMPOSIUM ON SYSTEM THEORY, 2011, : 24 - 29
  • [9] Minimizing the Embedding Cost of Service Function Chains with Adjustable Order
    Zheng, Pengxin
    Chen, Quan
    Wang, Feng
    Li, Longqu
    Cheng, Lianglun
    WIRELESS SENSOR NETWORKS, CWSN 2022, 2022, 1715 : 162 - 181
  • [10] Optimal Routing in Supply Chain Aimed at Minimizing Vehicle Cost and Supply
    Hajghasem, Mahtab
    Shojaie, Amir Abbas
    1ST INTERNATIONAL CONFERENCE ON APPLIED ECONOMICS AND BUSINESS, 2016, 36 : 353 - 362