Chang et al., 2011 - Google Patents
Set pruning segment trees for packet classificationChang et al., 2011
View PDF- Document ID
- 1945714449929947080
- Author
- Chang Y
- Chen H
- Publication year
- Publication venue
- 2011 IEEE International Conference on Advanced Information Networking and Applications
External Links
Snippet
Nowadays, multi-field packet classification is one of the most important technologies to support various services in next generation routers. In this paper, we propose a segment tree based parallel SRAM-based pipelined architecture called Set Pruning Segment Trees …
- 230000015654 memory 0 abstract description 43
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/74—Address processing for routing
- H04L45/745—Address table lookup or address filtering
- H04L45/7457—Address table lookup or address filtering using content-addressable memories [CAM]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/74—Address processing for routing
- H04L45/745—Address table lookup or address filtering
- H04L45/7453—Address table lookup or address filtering using hashing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/02—Network architectures or network communication protocols for network security for separating internal from external traffic, e.g. firewalls
- H04L63/0227—Filtering policies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/14—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic
- H04L63/1408—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic by monitoring network traffic
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/74—Address processing for routing
- H04L45/742—Route cache and its operation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/02—Network architectures or network communication protocols for network security for separating internal from external traffic, e.g. firewalls
- H04L63/0209—Architectural arrangements, e.g. perimeter networks or demilitarized zones
- H04L63/0218—Distributed architectures, e.g. distributed firewalls
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/54—Organization of routing tables
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/48—Routing tree calculation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
- G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
- G06F17/30961—Trees
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/40—Wormhole routing
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP1515501B1 (en) | Data structure for range-specified algorithms | |
Jiang et al. | Large-scale wire-speed packet classification on FPGAs | |
Kounavis et al. | Directions in packet classification for network processors | |
Jiang et al. | A FPGA-based parallel architecture for scalable high-speed packet classification | |
Priya et al. | Hierarchical packet classification using a Bloom filter and rule-priority tries | |
Pao et al. | A multi-pipeline architecture for high-speed packet classification | |
Puš et al. | Fast and scalable packet classification using perfect hash functions | |
Perez et al. | Optimized packet classification for software-defined networking | |
Lim et al. | A new hierarchical packet classification algorithm | |
Tan et al. | MBitTree: A fast and scalable packet classification for software switches | |
Lim et al. | Two-dimensional packet classification algorithm using a quad-tree | |
Lee et al. | Utilizing 2-D leaf-pushing for packet classification | |
Chang et al. | CubeCuts: A novel cutting scheme for packet classification | |
Kekely et al. | Packet classification with limited memory resources | |
Chang et al. | Set pruning segment trees for packet classification | |
Erdem et al. | Clustered hierarchical search structure for large-scale packet classification on FPGA | |
Chang | Efficient multidimensional packet classification with fast updates | |
Li et al. | MEET-IP: Memory and energy efficient TCAM-based IP lookup | |
Nagpal et al. | A survey and taxonomy of various packet classification algorithms | |
Chang et al. | A high-speed and memory efficient pipeline architecture for packet classification | |
Jiang et al. | Decision forest: a scalable architecture for flexible flow matching on FPGA | |
Jiang et al. | Scalable packet classification: Cutting or merging? | |
Chang et al. | Layer partitioned search tree for packet classification | |
Khan et al. | Design and implementation of high performance architecture for packet classification | |
Huang et al. | A hybrid packet classification algorithm based on hash table and geometric space partition |