|
|
All Technical Committee Conferences (Searched in: Recent 10 Years)
|
|
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Descending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
NS |
2022-04-15 11:10 |
Tokyo |
kikai shinkou kaikan + online (Tokyo, Online) (Primary: On-site, Secondary: Online) |
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 |
The service chaining problem is one of the resource allocation problems in network functions virtualization (NFV) networ... [more] |
NS2022-2 pp.7-12 |
|
|
|
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)
|
[Return to Top Page]
[Return to IEICE Web Page]
|