View : 250 Download: 0

Full metadata record

DC Field Value Language
dc.contributor.author임혜숙-
dc.date.accessioned2016-08-28T11:08:50Z-
dc.date.available2016-08-28T11:08:50Z-
dc.date.issued2014-
dc.identifier.issn0018-9340-
dc.identifier.otherOAK-11203-
dc.identifier.urihttp://dspace.ewha.ac.kr/handle/2015.oak/227638-
dc.description.abstractbinary search on levels; Bloom filter; Internet; IP address lookup; leaf pushing; longest prefix matching; multihashing; router-
dc.languageEnglish-
dc.titleOn adding bloom filters to longest prefix matching algorithms-
dc.typeArticle-
dc.relation.issue2-
dc.relation.volume63-
dc.relation.indexSCI-
dc.relation.indexSCIE-
dc.relation.indexSCOPUS-
dc.relation.startpage411-
dc.relation.lastpage423-
dc.relation.journaltitleIEEE Transactions on Computers-
dc.identifier.doi10.1109/TC.2012.193-
dc.identifier.wosidWOS:000333469900012-
dc.identifier.scopusid2-s2.0-84892409793-
dc.author.googleLim H.-
dc.author.googleLim K.-
dc.author.googleLee N.-
dc.author.googlePark K.-H.-
dc.contributor.scopusid임혜숙(7403095209)-
dc.date.modifydate20210122081004-
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