View : 58 Download: 0

Packet classification using a bloom filter in a leaf-pushing area-based quad-trie

Title
Packet classification using a bloom filter in a leaf-pushing area-based quad-trie
Authors
Lim H.Byun H.Y.
Ewha Authors
임혜숙
SCOPUS Author ID
임혜숙scopus
Issue Date
2015
Journal Title
ANCS 2015 - 11th 2015 ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Keywords
area-based quad-trieBloom filterleaf-pushingpacket classification
Publisher
Institute of Electrical and Electronics Engineers Inc.
Indexed
SCOPUS scopus
Abstract
Packet classification is one of the most essential functions that Internet routers should perform at wire-speed for every incoming packet. An area-based quad-trie (AQT) for packet classification has an issue in search performance since many rule nodes can be encountered in a search procedure. A leaf-pushing AQT improves the search performance of the AQT by making a single rule node exist in each search path. This paper proposes a new algorithm to improve the search performance of the leaf-pushing AQT further. The proposed algorithm builds a leaf-pushing AQT using a Bloom filter and a hash table stored in on-chip memories. The level of a rule node and a pointer to a rule database are identified by sequentially querying the Bloom filter and by accessing the hash table, respectively. © 2015 IEEE.
DOI
10.1109/ANCS.2015.7110131
ISBN
9781467366335
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