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 2022-04-15 11:10
Service Chaining Based on Capacitated Shortest Path Tour Problem -- Solution Based on Deep Reinforcement Learning and Graph Neural Network --
Takanori Hara, Masahiro Sasabe (NAIST) NS2022-2
Abstract (in Japanese) (See Japanese page) 
(in English) The service chaining problem is one of the resource allocation problems in network functions virtualization (NFV) networks and aims at finding a service path from an origin node to a destination node while executing the virtual network functions at intermediate nodes in required order under the resource constraints. In our previous work, we modeled the service chaining problem as the capacitated shortest path tour problem (CSPTP) and formulated the CSPTP-based service chaining as an integer linear program. We also proposed a simple greedy algorithm and more sophisticated Lagrangian heuristics to efficiently solve the CSPTP-based service chaining. In this paper, we aim at realizing CSPTP-based service chaining that can learn demand trend and adapt to topology changes due to link failures by using both deep reinforcement learning and graph neural network. Through numerical results, we demonstrate the fundamental characteristics of the proposed scheme and adaptability to topology change with link failures.
Keyword (in Japanese) (See Japanese page) 
(in English) Network functions virtualization / service chaining / capacitated shortest path tour problem / deep reinforcement learning / graph neural network / / /  
Reference Info. IEICE Tech. Rep., vol. 122, no. 5, NS2022-2, pp. 7-12, April 2022.
Paper # NS2022-2 
Date of Issue 2022-04-08 (NS) 
ISSN Print edition: ISSN 0913-5685  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 NS2022-2

Conference Information
Committee NS  
Conference Date 2022-04-15 - 2022-04-15 
Place (in Japanese) (See Japanese page) 
Place (in English) kikai shinkou kaikan + online 
Topics (in Japanese) (See Japanese page) 
Topics (in English) Communication traffic theory, Traffic and quality evaluation, Network performance evaluation, QoS/QoE, Reliability and robustness, Traffic and quality management, AI and machine learning, Network and system operation management, High capacity, low latency, many connections, General 
Paper Information
Registration To NS 
Conference Code 2022-04-NS 
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 Deep Reinforcement Learning and Graph Neural Network 
Keyword(1) Network functions virtualization  
Keyword(2) service chaining  
Keyword(3) capacitated shortest path tour problem  
Keyword(4) deep reinforcement learning  
Keyword(5) graph neural network  
Keyword(6)  
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 ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
Speaker Author-1 
Date Time 2022-04-15 11:10:00 
Presentation Time 25 minutes 
Registration for NS 
Paper # NS2022-2 
Volume (vol) vol.122 
Number (no) no.5 
Page pp.7-12 
#Pages
Date of Issue 2022-04-08 (NS) 


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan