Two-dimensional packet classification and filter conflict resolution in the internet
From MaRDI portal
Publication:2272209
DOI10.1007/S00224-007-9050-5zbMATH Open1176.68021OpenAlexW2110795461MaRDI QIDQ2272209FDOQ2272209
Authors: Andy Kwok, Chung Keung Poon
Publication date: 6 August 2009
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-007-9050-5
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
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network design and communication in computer systems (68M10)
Cites Work
- Dynamic Perfect Hashing: Upper and Lower Bounds
- 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
- Internet packet filter management and rectangle geometry
- Dynamic rectangular intersection with priorities
- Title not available (Why is that?)
- Space efficient dynamic stabbing with fast queries
- Tight(er) worst-case bounds on dynamic searching and priority queues
- Title not available (Why is that?)
- Fast packet classification for two-dimensional conflict-free filters
Cited In (5)
- Internet packet filter management and rectangle geometry
- Fast and scalable conflict detection for packet classifiers.
- Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching
- Title not available (Why is that?)
- 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)