Covering rectilinear polygons with axis-parallel rectangles
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Packet classification on multiple fields
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Internet packet filter management and rectangle geometry
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Dynamic rectangular intersection with priorities
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Space efficient dynamic stabbing with fast queries
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Packet classification in large ISPs: design and evaluation of decision tree classifiers
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
The generalized MDL approach for summarization
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Topological transformation approaches to optimizing TCAM-based packet classification systems
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
TCAM Razor: a systematic approach towards minimizing packet classifiers in TCAMs
IEEE/ACM Transactions on Networking (TON)
On constructing efficient shared decision trees for multiple packet filters
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
A traffic-aware top-N firewall ruleset approximation algorithm
Proceedings of the 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Network-wide deployment of intrusion detection and prevention systems
Proceedings of the 6th International COnference
Topological transformation approaches to TCAM-based packet classification
IEEE/ACM Transactions on Networking (TON)
Split: Optimizing Space, Power, and Throughput for TCAM-Based Classification
Proceedings of the 2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems
Unifying the Landscape of Cell-Probe Lower Bounds
SIAM Journal on Computing
Bidirectional range extension for TCAM-based packet classification
NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
Bit weaving: a non-prefix approach to compressing packet classifiers in TCAMs
IEEE/ACM Transactions on Networking (TON)
Policy transformation in software defined networks
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
Policy transformation in software defined networks
ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
Optimizing the "one big switch" abstraction in software-defined networks
Proceedings of the ninth ACM conference on Emerging networking experiments and technologies
A ternary unification framework for optimizing TCAM-based packet classification systems
ANCS '13 Proceedings of the ninth ACM/IEEE symposium on Architectures for networking and communications systems
| Hi-index | 0.00 |
We consider a geometric model for the problem of minimizing access control lists (ACLs) in network routers, a model that also has applications to rectilinear picture compression and figure drawing in common graphics software packages. Here the goal is to create a colored rectilinear pattern within an initially white rectangular canvas, and the basic operation is to choose a subrectangle and paint it a single color, overwriting all previous colors in the rectangle. Rectangle Rule List (RRL) minimization is the problem of finding the shortest list of rules needed to create a given pattern. ACL minimization is a restricted version of this problem where the set of allowed rectangles must correspond to pairs of IP address prefixes. Motivated by the ACL application, we study the special cases of RRL and ACL minimization in which all rectangles must be strips that extend either the full width or the full height of the canvas (strip-rules). We provide several equivalent characterizations of the patterns achievable using strip-rules and present polynomial-time algorithms for optimally constructing such patterns when, as in the ACL application, the only colors are black and white (permit or deny). We also show that RRL minimization is NP-hard in general and provide O(min(n1/3, OPT1/2))-approximation algorithms for general RRL and ACL minimization by exploiting our results about strip-rule patterns.