Virtual Network Function Placement Model for Service Chaining to Relax Visit Order and Routing Constraints

Naoki Hyodo, Takehiro Sato, Ryoichi Shinkuma, Eiji Oki

研究成果: Conference contribution

3 被引用数 (Scopus)

抄録

Service chaining creates a desired service by the sequential concatenation of Virtual Network Functions (VNF). Relaxing the visit order constraints of requested VNFs and allowing the creation of loops in service chaining paths enable a reduction in the number of VNFs placed on the network. However, the problem of applying both techniques at the same time has never been studied. This paper proposes a VNF placement model that minimizes the costs associated with VNF placement and link utilization while supporting partially-ordered VNFs and service chaining paths with loops. We formulate the VNF placement model as an integer linear programming problem. Simulations quantitatively show that the proposed model reduces the cost compared to the conventional model.

本文言語English
ホスト出版物のタイトルProceedings of the 2018 IEEE 7th International Conference on Cloud Networking, CloudNet 2018
出版社Institute of Electrical and Electronics Engineers Inc.
ISBN(電子版)9781538668313
DOI
出版ステータスPublished - 2018 11 27
外部発表はい
イベント7th IEEE International Conference on Cloud Networking, CloudNet 2018 - Tokyo, Japan
継続期間: 2018 10 222018 10 24

出版物シリーズ

名前Proceedings of the 2018 IEEE 7th International Conference on Cloud Networking, CloudNet 2018

Conference

Conference7th IEEE International Conference on Cloud Networking, CloudNet 2018
国/地域Japan
CityTokyo
Period18/10/2218/10/24

ASJC Scopus subject areas

  • コンピュータ ネットワークおよび通信
  • 情報システムおよび情報管理
  • 安全性、リスク、信頼性、品質管理

フィンガープリント

「Virtual Network Function Placement Model for Service Chaining to Relax Visit Order and Routing Constraints」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル