View : 66 Download: 0
Binary search on levels using a Bloom filter for IPv6 address lookup
- Binary search on levels using a Bloom filter for IPv6 address lookup
- Lim K.; Park K.; Lim H.
- Ewha Authors
- SCOPUS Author ID
- Issue Date
- Journal Title
- ANCS'09: Symposium on Architecture for Networking and Communications Systems
- 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.
- Appears in Collections:
- 엘텍공과대학 > 전자공학과 > Journal papers
- Files in This Item:
There are no files associated with this item.
- RIS (EndNote)
- XLS (Excel)
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.