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 2013-09-27 10:55
Performance Analysis on Invertible Bloom Lookup Tables with Erasure Errors
Daichi Yugawa, Tadashi Wadayama (Nagoya Inst. of Tech.) IT2013-35
Abstract (in Japanese) (See Japanese page) 
(in English) The Invertible Bloom Lookup Tables (IBLT) is a data structure which supports insertion, deletion, retrieval and listing operations of the key-value pair. The most notable feature of the IBLT is the complete listing operation of the key-value pairs and there are applications such as set reconciliation based on the listing operation. In some cases, data stored in a recording device such as a hard disk drive or memories can be lost due to defects of the media or errors. In such an environment, it is crucial to know the error tolerance of the IBLT. In this paper, we assume an erasure channel model for the IBLT. We will present an analysis for the IBLT which reveals behaviors of the listing failure probability, which represents robustness ofthe IBLT. The analysis is based on the similarity between listing operation of IBLT and peeling algorithm of low-density parity check (LDPC) codes.Some computer experiments indicate that an upper bound on the listing failure probability based on the union bound accurately captures the error floor behaviors.
Keyword (in Japanese) (See Japanese page) 
(in English) data structure / hash function / stopping set / / / / /  
Reference Info. IEICE Tech. Rep., vol. 113, no. 228, IT2013-35, pp. 19-24, Sept. 2013.
Paper # IT2013-35 
Date of Issue 2013-09-20 (IT) 
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 IT2013-35

Conference Information
Committee IT  
Conference Date 2013-09-27 - 2013-09-27 
Place (in Japanese) (See Japanese page) 
Place (in English) Culture Resort Festone (Okinawa) 
Topics (in Japanese) (See Japanese page) 
Topics (in English) error correcting codes, general 
Paper Information
Registration To IT 
Conference Code 2013-09-IT 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Performance Analysis on Invertible Bloom Lookup Tables with Erasure Errors 
Sub Title (in English)  
Keyword(1) data structure  
Keyword(2) hash function  
Keyword(3) stopping set  
Keyword(4)  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Daichi Yugawa  
1st Author's Affiliation Nagoya Institute of Technology (Nagoya Inst. of Tech.)
2nd Author's Name Tadashi Wadayama  
2nd Author's Affiliation Nagoya Institute of Technology (Nagoya Inst. of Tech.)
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 2013-09-27 10:55:00 
Presentation Time 25 minutes 
Registration for IT 
Paper # IT2013-35 
Volume (vol) vol.113 
Number (no) no.228 
Page pp.19-24 
#Pages 6 
Date of Issue 2013-09-20 (IT) 

[Return to Top Page]

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