|
|
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 (Joint) |
2021-03-04 10:10 |
Online |
Online |
A Study on Spraying Heavy Hitters for Fast Stateful Packet Processing in Multi-threaded NDN Software Routers Junji Takemasa (Osaka Univ.), Atsushi Tagami (KDDI Research, Inc.), Yuki Koizumi, Toru Hasegawa (Osaka Univ.) IN2020-61 |
In Named Data Networking (NDN), a request packet is forwarded according to a content name, and the corresponding respons... [more] |
IN2020-61 pp.43-48 |
IN, CCS (Joint) |
2020-08-03 13:25 |
Online |
Online |
A Study on Recovery from Packet Forwarding Errors Caused by Mutual-Exclusion-free PIT of a Multi-core NDN Router Ryo Koyama (Osaka Univ.), Junji Takemasa (KDDI Research, Inc.), Yuki Koizumi (Osaka Univ.), Atsushi Tagami (KDDI Research, Inc.), Toru Hasegawa (Osaka Univ.) IN2020-14 |
A Named Data Networking (NDN) router stores incoming faces from which Interest packets are received at a Pending Interes... [more] |
IN2020-14 pp.31-36 |
CPSY, IPSJ-EMB, IPSJ-SLDM, DC [detail] |
2014-03-16 13:40 |
Okinawa |
|
Evaluation of Performance Improvement Rate on Multi-core Tender Takahiro Yamamoto, Toshihiro Yamauchi, Hideo Taniguchi (Okayama Univ.) CPSY2013-115 DC2013-102 |
Multi-core processors are widely used in modern embeded systems because higher and higher processing throughput is requi... [more] |
CPSY2013-115 DC2013-102 pp.277-282 |
COMP |
2008-12-03 10:05 |
Gunma |
Gunma Univ. |
Game Theoretic Analysis of Malicious Faults Which are Undetectable by Local Checks Jun Kiniwa, Kensaku Kikuta (Univ. Hyogo) COMP2008-47 |
We consider a malicious adversary which generates multiple undetectable
faults by local checks.
Though the possibili... [more] |
COMP2008-47 pp.7-14 |
DE, DC |
2007-10-15 15:45 |
Tokyo |
Kikai-Shinko-Kaikan Bldg |
A Token-Based Mutal Exclusion for General Distributed Hash Table Tetsuji Oonishi, Masato Kitakami (Chiba Univ.) DE2007-121 DC2007-18 |
A peer-to-peer (P2P) network has only equal peer nodes which work as both "clients" and "servers" to the other nodes on ... [more] |
DE2007-121 DC2007-18 pp.37-42 |
|
|
|
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]
|