View : 111 Download: 0

Binary search on levels using a Bloom filter for IPv6 address lookup

Title
Binary search on levels using a Bloom filter for IPv6 address lookup
Authors
Lim K.Park K.Lim H.
Ewha Authors
임혜숙
SCOPUS Author ID
임혜숙scopus
Issue Date
2009
Journal Title
ANCS'09: Symposium on Architecture for Networking and Communications Systems
Indexed
SCOPUS scopus
Abstract
This paper proposes a new IP address lookup using a Bloom filter. The proposed algorithm is based on binary search on trie levels, and a Bloom filter pre-filters the levels which do not have matching nodes in performing the binary search on levels. Hence the number of memory access which affects the search performance is greatly reduced. Simulation result shows that an IPv6 address lookup can be performed with 1 - 3 memory accesses in average for an IPv6 routing data set with 1096 prefixes. © 2010 ACM.
DOI
10.1145/1882486.1882534
ISBN
9781605586304
Appears in Collections:
엘텍공과대학 > 전자공학과 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE