| IEICE Technical Committee Submission System Conference Paper's Information |
Online Proceedings [Sign in] Tech. Rep. Archives |
| Go Top Page | Go Previous | [Japanese] / [English] |
| Paper Abstract and Keywords | ||
| Presentation | 2021-09-09 12:40 Service Chaining Based on Capacitated Shortest Path Tour Problem -- Solution Based on Lagrangian Relaxation and Shortest Path Tour Algorithm -- Takanori Hara, Masahiro Sasabe (NAIST)  NS2021-60 |
|
| Abstract | (in Japanese) | (See Japanese page) |
| (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) |
| (in English) | Network functions virtualization / service chaining / integer linear programming / capacitated shortest path tour problem / Lagrangian relaxation / subgradient algorithm / / | |
| Reference Info. | IEICE Tech. Rep., vol. 121, no. 170, NS2021-60, pp. 18-23, Sept. 2021. | |
| Paper # | NS2021-60 | |
| Date of Issue | 2021-09-02 (NS) | |
| ISSN | Online edition: ISSN 2432-6380 | |
| Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) | |
| Download PDF | NS2021-60 |
|
| Conference Information | |
| Committee | IN NS CS NV |
| Conference Date | 2021-09-09 - 2021-09-10 |
| 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. |
| Paper Information | |
| Registration To | NS |
| Conference Code | 2021-09-IN-NS-CS-NV |
| Language | Japanese |
| 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 |
| Keyword(7) | |
| Keyword(8) | |
| 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) |
| 3rd Author's Name | |
| 3rd Author's Affiliation | () |
| 4th Author's Name | |
| 4th Author's Affiliation | () |
| 5th Author's Name | |
| 5th Author's Affiliation | () |
| 6th Author's Name | |
| 6th Author's Affiliation | () |
| 7th Author's Name | |
| 7th Author's Affiliation | () |
| 8th Author's Name | |
| 8th Author's Affiliation | () |
| 9th Author's Name | |
| 9th Author's Affiliation | () |
| 10th Author's Name | |
| 10th Author's Affiliation | () |
| 11th Author's Name | |
| 11th Author's Affiliation | () |
| 12th Author's Name | |
| 12th Author's Affiliation | () |
| 13th Author's Name | |
| 13th Author's Affiliation | () |
| 14th Author's Name | |
| 14th Author's Affiliation | () |
| 15th Author's Name | |
| 15th Author's Affiliation | () |
| 16th Author's Name | |
| 16th Author's Affiliation | () |
| 17th Author's Name | |
| 17th Author's Affiliation | () |
| 18th Author's Name | |
| 18th Author's Affiliation | () |
| Speaker | Author-1 |
| Date Time | 2021-09-09 12:40:00 |
| Presentation Time | 25 minutes |
| Registration for | NS |
| Paper # | NS2021-60 |
| Volume (vol) | vol.121 |
| Number (no) | no.170 |
| Page | pp.18-23 |
| #Pages | 6 |
| Date of Issue | 2021-09-02 (NS) |
[Return to Top Page]