DSpace at EWHA: On adding bloom filters to longest prefix matching algorithms

Browse

My Repository

DSpace at EWHA엘텍공과대학 전자공학과 Journal papers

View : 237 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: 임혜숙

Issue Date: 2014

Journal Title: IEEE Transactions on Computers

ISSN: 0018-9340

Citation: IEEE Transactions on Computers vol. 63, no. 2, pp. 411 - 423

Indexed: SCI; SCIE; SCOPUS

Document Type: Article

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:

Export: RIS (EndNote); XLS (Excel); XML

Show full item record

Find@EWHA

qrcode

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

: search

BROWSE