Faster Compression of Patterns to Rectangle Rule Lists
| Autor: | Gruia Calinescu, Nathan De Graaf, Ian Albuquerque Raymundo Da Silva |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
business.industry
Computer science Order (ring theory) 020206 networking & telecommunications Access control 02 engineering and technology Grid Row and column spaces Binary logarithm Data structure 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing business Rectangle method Algorithm Scope (computer science) |
| Zdroj: | Algorithmic Aspects in Information and Management ISBN: 9783030046170 AAIM |
| DOI: | 10.1007/978-3-030-04618-7_16 |
| Popis: | Access Control Lists (ACLs) are an essential security component in network routers. ACLs can be geometrically modeled as a two-dimensional black and white grid; our interest is in the most efficient way to represent such a grid. The more general problem is that of Rectangle Rule Lists (RRLs), which is finding the least number of rectangles needed to generate a given pattern. The scope of this paper focuses on a restricted version of RRLs in which only rectangles that span the length or width of the grid are considered. Applegate et al.’s paper “Compressing Rectilinear Pictures and Minimizing Access Control Lists" gives an algorithm for finding an optimal solutions for strip-rule RRLs in \(O(n^3)\) time, where n is the total number of rows and columns in the grid. Following the structure of Applegate et al.’s algorithm, we simplify the solution, remove redundancies in data structures, and exploit overlapping sub-problems in order to achieve an optimal solution for strip-rule RRLs in \(O(n^2 \) log n) time. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|