Two-dimensional packet classification and filter conflict resolution in the internet
From MaRDI portal
Publication:2272209
Recommendations
- Fast packet classification for two-dimensional conflict-free filters
- Fast and scalable conflict detection for packet classifiers.
- Internet packet filter management and rectangle geometry
- Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching
- scientific article; zbMATH DE number 2089954
Cites work
- scientific article; zbMATH DE number 4211552 (Why is no real title available?)
- scientific article; zbMATH DE number 140460 (Why is no real title available?)
- Dynamic Perfect Hashing: Upper and Lower Bounds
- Dynamic rectangular intersection with priorities
- Fast packet classification for two-dimensional conflict-free filters
- Internet packet filter management and rectangle geometry
- Log-logarithmic worst-case range queries are possible in space theta(N)
- Making data structures persistent
- Optimal bounds for the predecessor problem and related problems
- Space efficient dynamic stabbing with fast queries
- Tight(er) worst-case bounds on dynamic searching and priority queues
Cited in
(5)- Internet packet filter management and rectangle geometry
- Fast and scalable conflict detection for packet classifiers.
- scientific article; zbMATH DE number 2089954 (Why is no real title available?)
- Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching
- Fast packet classification for two-dimensional conflict-free filters
This page was built for publication: Two-dimensional packet classification and filter conflict resolution in the internet
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2272209)