Column Generation Based Algorithm for Service Chaining Relaxing Visit Order and Routing Constraints

Takehiro Sato, Atsushi Kikuchi, Ryoichi Shinkuma, Eiji Oki

研究成果: Conference contribution

抄録

Service chaining is a method for providing desired network services to users by concatenating virtualized network functions (VNFs) in the network. There have been studies on service chain provisioning models that relax the visit order of VNFs and routing constraints. These models make it difficult to obtain an optimal solution in a practical time due to the huge number of decision variables associated with the problem. A heuristic approach that obtains a nearly-optimal solution within a practical time is needed. This paper proposes a column generation based heuristic algorithm for the service chain provisioning problem that relaxes the VNF visit order and routing constraints. The proposed algorithm divides the problem into a VNF placement problem and a routing problem and applies the column generation technique to solve the latter. Numerical results show that the proposed algorithm shortens the computation time compared to directly solving the original integer linear programming problem in exchange for some increase in the cost for VNF placement and link utilization.

本文言語English
ホスト出版物のタイトル2020 IEEE Global Communications Conference, GLOBECOM 2020 - Proceedings
出版社Institute of Electrical and Electronics Engineers Inc.
ISBN(電子版)9781728182988
DOI
出版ステータスPublished - 2020 12
外部発表はい
イベント2020 IEEE Global Communications Conference, GLOBECOM 2020 - Virtual, Taipei, Taiwan, Province of China
継続期間: 2020 12 72020 12 11

出版物シリーズ

名前2020 IEEE Global Communications Conference, GLOBECOM 2020 - Proceedings
2020-January

Conference

Conference2020 IEEE Global Communications Conference, GLOBECOM 2020
国/地域Taiwan, Province of China
CityVirtual, Taipei
Period20/12/720/12/11

ASJC Scopus subject areas

  • メディア記述
  • モデリングとシミュレーション
  • 器械工学
  • 人工知能
  • コンピュータ ネットワークおよび通信
  • ハードウェアとアーキテクチャ
  • ソフトウェア
  • 安全性、リスク、信頼性、品質管理

フィンガープリント

「Column Generation Based Algorithm for Service Chaining Relaxing Visit Order and Routing Constraints」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル