Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 임혜숙 | * |
dc.date.accessioned | 2016-08-28T11:08:14Z | - |
dc.date.available | 2016-08-28T11:08:14Z | - |
dc.date.issued | 2009 | * |
dc.identifier.isbn | 9781605586304 | * |
dc.identifier.other | OAK-13403 | * |
dc.identifier.uri | https://dspace.ewha.ac.kr/handle/2015.oak/229403 | - |
dc.description.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. | * |
dc.description.sponsorship | ACM Special Interest Group on Computer Architecture (SIGARCH);TC on Computer Arhitecture (IEEE-CS\TCCA);ACM Special Interest Group on Data Communication (SIGCOMM) | * |
dc.language | English | * |
dc.title | Binary search on levels using a Bloom filter for IPv6 address lookup | * |
dc.type | Conference Paper | * |
dc.relation.index | SCOPUS | * |
dc.relation.startpage | 185 | * |
dc.relation.lastpage | 186 | * |
dc.relation.journaltitle | ANCS'09: Symposium on Architecture for Networking and Communications Systems | * |
dc.identifier.doi | 10.1145/1882486.1882534 | * |
dc.identifier.scopusid | 2-s2.0-77951727116 | * |
dc.author.google | Lim K. | * |
dc.author.google | Park K. | * |
dc.author.google | Lim H. | * |
dc.contributor.scopusid | 임혜숙(7403095209) | * |
dc.date.modifydate | 20240419140241 | * |