Information: Join today and make your research activities more affordable! Technical workshop participation fees and annual registration fees are available at member rates.
Notice: [Important] Announcement of Changes to Registration Fee Payment and Manuscript Upload Procedures for IEICE Technical Meetings
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 2026-03-04 13:00
Reducing Route Lookup Latency Using Route Caching and Pinning in IPFS
Kana Fukuoka, Noriaki Kamiyama (Ritsumeikan Univ.) NS2025-270
Abstract (in Japanese) (See Japanese page) 
(in English) In recent years, IPFS (InterPlanetary File System) has gained attention as a foundational technology for a decentralized web that does not rely on centralized servers. IPFS is a system where peers on a P2P network communicate autonomously, efficiently acquiring and sharing data through content-oriented addressing. It is anticipated to serve as an infrastructure superior to traditional HTTP in terms of fault tolerance and censorship resistance. However, content discovery in IPFS relies on iterative queries using a Distributed Hash Table (DHT) based on the Kademlia protocol. This approach suffers from significant delays before locating peers holding the desired content. Specifically, as the network scales, the number of hops required for discovery increases at a rate of $O(log N)$. Additionally, frequent node joins and leaves cause timeouts during discovery, further exacerbating the delay.

Therefore, this paper proposes a method combining “path caching feature” of Provider Record (PR) with “pinning functionality” using dedicated peers to reduce DHT discovery delays. This approach applies path caching for early discovery of highly popular content and pinning using always-online dedicated peers for moderately popular content, preventing re-searches due to peer departures. Simulation results show a reduction in the average number of search hops, with significant improvement observed particularly for moderately popular content. Furthermore, it was demonstrated that both functions complement each other effectively to reduce search latency even in high-churn environments.
Keyword (in Japanese) (See Japanese page) 
(in English) IPFS / Caching / Pinning / / / / /  
Reference Info. IEICE Tech. Rep., vol. 125, no. 385, NS2025-270, pp. 292-297, March 2026.
Paper # NS2025-270 
Date of Issue 2026-02-25 (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 NS2025-270

Conference Information
Committee IN NS  
Conference Date 2026-03-04 - 2026-03-06 
Place (in Japanese) (See Japanese page) 
Place (in English) Okinawa-Ken Shichoson Jichi Kaikan 
Topics (in Japanese) (See Japanese page) 
Topics (in English) General 
Paper Information
Registration To NS 
Conference Code 2026-03-IN-NS 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Reducing Route Lookup Latency Using Route Caching and Pinning in IPFS 
Sub Title (in English)  
Keyword(1) IPFS  
Keyword(2) Caching  
Keyword(3) Pinning  
Keyword(4)  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Kana Fukuoka  
1st Author's Affiliation Ritsumeikan University (Ritsumeikan Univ.)
2nd Author's Name Noriaki Kamiyama  
2nd Author's Affiliation Ritsumeikan University (Ritsumeikan Univ.)
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 ()
21st Author's Name  
21st Author's Affiliation ()
22nd Author's Name  
22nd Author's Affiliation ()
23rd Author's Name  
23rd Author's Affiliation ()
24th Author's Name  
24th Author's Affiliation ()
25th Author's Name  
25th Author's Affiliation ()
26th Author's Name / /
26th Author's Affiliation ()
()
27th Author's Name / /
27th Author's Affiliation ()
()
28th Author's Name / /
28th Author's Affiliation ()
()
29th Author's Name / /
29th Author's Affiliation ()
()
30th Author's Name / /
30th Author's Affiliation ()
()
31st Author's Name / /
31st Author's Affiliation ()
()
32nd Author's Name / /
32nd Author's Affiliation ()
()
33rd Author's Name / /
33rd Author's Affiliation ()
()
34th Author's Name / /
34th Author's Affiliation ()
()
35th Author's Name / /
35th Author's Affiliation ()
()
36th Author's Name / /
36th Author's Affiliation ()
()
Speaker Author-1 
Date Time 2026-03-04 13:00:00 
Presentation Time 25 minutes 
Registration for NS 
Paper # NS2025-270 
Volume (vol) vol.125 
Number (no) no.385 
Page pp.292-297 
#Pages 6 
Date of Issue 2026-02-25 (NS) 

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan