View : 53 Download: 0

On adding bloom filters to longest prefix matching algorithms

Title
On adding bloom filters to longest prefix matching algorithms
Authors
Lim H.Lim K.Lee N.Park K.-H.
Ewha Authors
임혜숙
SCOPUS Author ID
임혜숙scopus
Issue Date
2014
Journal Title
IEEE Transactions on Computers
ISSN
0018-9340JCR Link
Citation
vol. 63, no. 2, pp. 411 - 423
Indexed
SCI; SCIE; SCOPUS WOS scopus
Abstract
binary search on levels; Bloom filter; Internet; IP address lookup; leaf pushing; longest prefix matching; multihashing; router
DOI
10.1109/TC.2012.193
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