Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 임혜숙 | * |
dc.date.accessioned | 2016-08-27T04:08:09Z | - |
dc.date.available | 2016-08-27T04:08:09Z | - |
dc.date.issued | 2016 | * |
dc.identifier.issn | 0018-9340 | * |
dc.identifier.issn | 1557-9956 | * |
dc.identifier.other | OAK-18542 | * |
dc.identifier.uri | https://dspace.ewha.ac.kr/handle/2015.oak/218194 | - |
dc.description.abstract | IP address lookup operation determines the longest prefix matching each incoming destination address. As a fundamental operation for packet forwarding at Internet routers, search speed for routing table lookup is the most important performance metric. Previous researches have shown that the search performance of trie-based algorithms can be improved by adding on-chip Bloom filters. In these algorithms, an on-chip Bloom filter identifies the membership of a node in an off-chip trie, and the number of trie accesses is reduced, because the Bloom filter can filter out accesses to non-existing nodes in the trie. In this paper, we propose a new method of utilizing a Bloom filter for the IP address lookup problem. In the previous Bloom filter-based approach, false positiveness has to be identified by accessing the off-chip trie for every positive result, since false positives can produce wrong results. In our proposed approach, the false positiveness of a Bloom filter is not necessarily identified by making false positives not mislead the search. Hence the number of off-chip trie accesses are significantly reduced. Simulation results show that the best matching prefix can be found with a single off-chip access in average and in the worst-case with the reasonable size of a Bloom filter in our proposed method. | * |
dc.language | English | * |
dc.publisher | IEEE COMPUTER SOC | * |
dc.subject | Internet | * |
dc.subject | router | * |
dc.subject | IP address lookup | * |
dc.subject | trie | * |
dc.subject | longest prefix matching | * |
dc.subject | Bloom filter | * |
dc.subject | binary search on levels | * |
dc.subject | leaf pushing | * |
dc.title | New Approach for Efficient IP Address Lookup Using a Bloom Filter in Trie-Based Algorithms | * |
dc.type | Article | * |
dc.relation.issue | 5 | * |
dc.relation.volume | 65 | * |
dc.relation.index | SCIE | * |
dc.relation.index | SCOPUS | * |
dc.relation.startpage | 1558 | * |
dc.relation.lastpage | 1565 | * |
dc.relation.journaltitle | IEEE TRANSACTIONS ON COMPUTERS | * |
dc.identifier.doi | 10.1109/TC.2015.2444850 | * |
dc.identifier.wosid | WOS:000374891300019 | * |
dc.identifier.scopusid | 2-s2.0-84963944176 | * |
dc.author.google | Mun, Ju Hyoung | * |
dc.author.google | Lim, Hyesook | * |
dc.contributor.scopusid | 임혜숙(7403095209) | * |
dc.date.modifydate | 20240419140241 | * |