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 2015-12-03 14:35
Hash-table and Balanced-tree based FIB Architecture for CCN Routers Reducing Memory Accesses
Kenta Shimazaki (Waseda Univ.), Takashi Aoki, Takahiro Hatano, Takuya Otsuka, Akihiko Miyazaki (NTT), Toshitaka Tsuda, Yong-Jin Park, Nozomu Togawa (Waseda Univ.) VLD2015-75 DC2015-71
Abstract (in Japanese) (See Japanese page) 
(in English) In conventional IP network, an IP router just forwards a packet to
another router.
Recently, Content Centric Networking (CCN) is paid
attention to, where CCN routers do not only forward a packet to
another router but it also has a network server function.
A CCN router has a forwarding table called FIB (Forwarding Information Base) but its memory access can become a bottleneck.
In this paper, we propose FIB data structure for CCN routers which can reduce the number of memory accesses. Our proposed FIB is constructed by effectively utilizing a hash table and a balanced binary-search tree.
By using our FIB, the number of memory accesses cannot much
increase even if hash collisions occur.
Experimental results show that our proposed FIB can reduce the number of memory accesses by 5.9% and 88.1% compared to those implemented by using an n-ary tree and a hash table, respectively.
Keyword (in Japanese) (See Japanese page) 
(in English) content centric networking (CCN) / forwarding information base (FIB) / memory access / router / / / /  
Reference Info. IEICE Tech. Rep., vol. 115, no. 338, VLD2015-75, pp. 243-248, Dec. 2015.
Paper # VLD2015-75 
Date of Issue 2015-11-24 (VLD, DC) 
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 VLD2015-75 DC2015-71

Conference Information
Committee VLD DC IPSJ-SLDM CPSY RECONF ICD CPM  
Conference Date 2015-12-01 - 2015-12-03 
Place (in Japanese) (See Japanese page) 
Place (in English) Nagasaki Kinro Fukushi Kaikan 
Topics (in Japanese) (See Japanese page) 
Topics (in English) Design Gaia 2015 -New Field of VLSI Design- 
Paper Information
Registration To VLD 
Conference Code 2015-12-VLD-DC-SLDM-CPSY-RECONF-ICD-CPM 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Hash-table and Balanced-tree based FIB Architecture for CCN Routers Reducing Memory Accesses 
Sub Title (in English)  
Keyword(1) content centric networking (CCN)  
Keyword(2) forwarding information base (FIB)  
Keyword(3) memory access  
Keyword(4) router  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Kenta Shimazaki  
1st Author's Affiliation Waseda University (Waseda Univ.)
2nd Author's Name Takashi Aoki  
2nd Author's Affiliation Nippon Telegraph and Telephone Corporation (NTT)
3rd Author's Name Takahiro Hatano  
3rd Author's Affiliation Nippon Telegraph and Telephone Corporation (NTT)
4th Author's Name Takuya Otsuka  
4th Author's Affiliation Nippon Telegraph and Telephone Corporation (NTT)
5th Author's Name Akihiko Miyazaki  
5th Author's Affiliation Nippon Telegraph and Telephone Corporation (NTT)
6th Author's Name Toshitaka Tsuda  
6th Author's Affiliation Waseda University (Waseda Univ.)
7th Author's Name Yong-Jin Park  
7th Author's Affiliation Waseda University (Waseda Univ.)
8th Author's Name Nozomu Togawa  
8th Author's Affiliation Waseda University (Waseda Univ.)
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 2015-12-03 14:35:00 
Presentation Time 25 minutes 
Registration for VLD 
Paper # VLD2015-75, DC2015-71 
Volume (vol) vol.115 
Number (no) no.338(VLD), no.339(DC) 
Page pp.243-248 
#Pages 6 
Date of Issue 2015-11-24 (VLD, DC) 

[Return to Top Page]

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