|
|
All Technical Committee Conferences (Searched in: All Years)
|
|
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Descending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
IN, NS, CS, NV (Joint) |
2021-09-09 12:40 |
Online |
Online |
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 |
Network functions virtualization (NFV) can speedily and flexibly deploy network services by replacing traditional networ... [more] |
NS2021-60 pp.18-23 |
|
|
|
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]
|