Small forwarding tables for fast routing lookups
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Scalable high speed IP routing lookups
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Fast address lookups using controlled prefix expansion
ACM Transactions on Computer Systems (TOCS)
IP lookups using multiway and multicolumn search
IEEE/ACM Transactions on Networking (TON)
Packet classification on multiple fields
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Logic Minimization Algorithms for VLSI Synthesis
Logic Minimization Algorithms for VLSI Synthesis
Routing Table Compaction in Ternary CAM
IEEE Micro
Survey and taxonomy of packet classification techniques
ACM Computing Surveys (CSUR)
A 2-Level TCAM Architecture for Ranges
IEEE Transactions on Computers
O(logW) multidimensional packet classification
IEEE/ACM Transactions on Networking (TON)
High-speed packet classification using binary search on length
Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems
Computing the minimum DNF representation of Boolean functions defined by intervals
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Simple efficient TCAM based range classification
INFOCOM'10 Proceedings of the 29th conference on Information communications
Tree-based minimization of TCAM entries for packet classification
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
Space-Efficient TCAM-Based Classification Using Gray Coding
IEEE Transactions on Computers
Survey and taxonomy of IP address lookup algorithms
IEEE Network: The Magazine of Global Internetworking
Algorithms for packet classification
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
The coexistence of range based and prefix based fields within the filtering policy is one of the most important cause that makes the packet filtering problem difficult to solve and the proposed hybrid solutions hard to implement. Packet filters must support rule sets involving any type of conditions and must scale the number of rules, the number of fields, and the field sizes in order to avoid being outdated by future internet developments. Since the prefix-based solutions are the most efficient, we try to efficiently incorporate ranges in such data structure using of the new concept of signed prefixes that helps to guarantee homogeneity when matching on multiple packet header fields of distinct types. The proposed two-staged prefix-based model is able to achieve good performance in a practical environment and it scales well as the filtering list size increases and contains a large variety of range specifications.