| Presentation | 2021-09-09 Service Chaining Based on Capacitated Shortest Path Tour Problem Takanori Hara, Masahiro Sasabe, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Network functions virtualization (NFV) can speedily and flexibly deploy network services by replacing traditional network appliances with generic hardware and virtual network functions (VNFs). A certain network service can be interpreted as a sequence of VNFs, i.e., service (function) chain. The service chaining problem aims at finding an appropriate service path from the origin to the destination while executing the VNFs at the intermediate nodes in the required order under the resource constraint. In our previous work, focusing on the similarity between the service chaining problem and the shortest path tour problem (SPTP), we formulated the service chaining problem as the capacitated SPTP (CSPTP) based ILP, where CSPTP is an extended version of the SPTP with the node and link capacity constraints. In this paper, to address both computational complexity and optimality of resource allocation, we propose an efficient algorithm for online service chaining by combining the Lagrangian relaxation for the CSPTP-based ILP and the existing SPTP algorithm. Through simulation results, we show the fundamental characteristics of the proposed algorithm in terms of the optimality of resource allocation and the computational complexity. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Network functions virtualization / service chaining / integer linear programming / capacitated shortest path tour problem / Lagrangian relaxation / subgradient algorithm |
| Paper # | NS2021-60 |
| Date of Issue | 2021-09-02 (NS) |
| Conference Information | |
| Committee | IN / NS / CS |
|---|---|
| Conference Date | 2021/9/9(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Online |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | Session management (SIP/IMS), Interoperability/Standardization, NGN/NwGN/Future networks, Cloud/Data center networks, SDN (OpenFlow, etc.)/NFV, IPv6, Machine learning, etc. |
| Chair | Kenji Ishida(Hiroshima City Univ.) / Akihiro Nakao(Univ. of Tokyo) / Jun Terada(NTT) |
| Vice Chair | Kunio Hato(Internet Multifeed) / Tetsuya Oishi(NTT) / Daisuke Umehara(Kyoto Inst. of Tech.) |
| Secretary | Kunio Hato(NTT) / Tetsuya Oishi(Univ. of Nagasaki) / Daisuke Umehara(Nagaoka Univ. of Tech.) |
| Assistant | / Kotaro Mihara(NTT) / Takahiro Yamaura(Toshiba) / Yuta Ida(Yamaguchi Univ.) |
| Paper Information | |
| Registration To | Technical Committee on Information Networks / Technical Committee on Network Systems / Technical Committee on Communication Systems |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Service Chaining Based on Capacitated Shortest Path Tour Problem |
| Sub Title (in English) | Solution Based on Lagrangian Relaxation and Shortest Path Tour Algorithm |
| Keyword(1) | Network functions virtualization |
| Keyword(2) | service chaining |
| Keyword(3) | integer linear programming |
| Keyword(4) | capacitated shortest path tour problem |
| Keyword(5) | Lagrangian relaxation |
| Keyword(6) | subgradient algorithm |
| 1st Author's Name | Takanori Hara |
| 1st Author's Affiliation | Nara Institute of Science and Technology(NAIST) |
| 2nd Author's Name | Masahiro Sasabe |
| 2nd Author's Affiliation | Nara Institute of Science and Technology(NAIST) |
| Date | 2021-09-09 |
| Paper # | NS2021-60 |
| Volume (vol) | vol.121 |
| Number (no) | NS-170 |
| Page | pp.pp.18-23(NS), |
| #Pages | 6 |
| Date of Issue | 2021-09-02 (NS) |