Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 임혜숙 | * |
dc.date.accessioned | 2016-08-28T11:08:17Z | - |
dc.date.available | 2016-08-28T11:08:17Z | - |
dc.date.issued | 2010 | * |
dc.identifier.issn | 0272-1732 | * |
dc.identifier.other | OAK-13440 | * |
dc.identifier.uri | https://dspace.ewha.ac.kr/handle/2015.oak/229438 | - |
dc.description.abstract | Tuple 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.language | English | * |
dc.title | Tuple pruning using bloom filters for packet classification | * |
dc.type | Conference Paper | * |
dc.relation.issue | 3 | * |
dc.relation.volume | 30 | * |
dc.relation.index | SCI | * |
dc.relation.index | SCIE | * |
dc.relation.index | SCOPUS | * |
dc.relation.startpage | 48 | * |
dc.relation.lastpage | 58 | * |
dc.relation.journaltitle | IEEE Micro | * |
dc.identifier.doi | 10.1109/MM.2010.44 | * |
dc.identifier.wosid | WOS:000279673200006 | * |
dc.identifier.scopusid | 2-s2.0-77954613180 | * |
dc.author.google | Lim H. | * |
dc.author.google | Kim S.Y. | * |
dc.contributor.scopusid | 임혜숙(7403095209) | * |
dc.date.modifydate | 20240419140241 | * |