View : 624 Download: 0

Full metadata record

DC Field Value Language
dc.contributor.author임혜숙*
dc.date.accessioned2016-08-28T11:08:17Z-
dc.date.available2016-08-28T11:08:17Z-
dc.date.issued2010*
dc.identifier.issn0272-1732*
dc.identifier.otherOAK-13440*
dc.identifier.urihttps://dspace.ewha.ac.kr/handle/2015.oak/229438-
dc.description.abstractTuple pruning for packet classification provides fast search and a low implementation complexity. The tuple pruning algorithm reduces the search space to a subset of tuples determined by individual field lookups that cause off-chip memory accesses. The authors propose a tuple-pruning algorithm that reduces the search space through Bloom filter queries, which do not require off-chip memory accesses. © 2006 IEEE.*
dc.languageEnglish*
dc.titleTuple pruning using bloom filters for packet classification*
dc.typeConference Paper*
dc.relation.issue3*
dc.relation.volume30*
dc.relation.indexSCI*
dc.relation.indexSCIE*
dc.relation.indexSCOPUS*
dc.relation.startpage48*
dc.relation.lastpage58*
dc.relation.journaltitleIEEE Micro*
dc.identifier.doi10.1109/MM.2010.44*
dc.identifier.wosidWOS:000279673200006*
dc.identifier.scopusid2-s2.0-77954613180*
dc.author.googleLim H.*
dc.author.googleKim S.Y.*
dc.contributor.scopusid임혜숙(7403095209)*
dc.date.modifydate20240419140241*
Appears in Collections:
공과대학 > 전자전기공학전공 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

BROWSE