Compressing rectilinear pictures and minimizing access control lists

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 1066-1075

  Applegate, David A ^a   Calinescu, Gruia ^b   Johnson, David S ^a   Karloff, Howard ^a   Ligett, Katrina ^c   Wang, Jia ^a  

^a AT AND T LABS RESEARCH   (United States)

^b Illinois Institute of Technology   (United States)

^c Carnegie Mellon University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPLICATION PROGRAMS; APPROXIMATION ALGORITHMS; COLOR; DRAWING (GRAPHICS); GEOMETRY; POLYNOMIAL APPROXIMATION; ROUTERS;

ACCESS CONTROL LISTS; BASIC OPERATION; GEOMETRIC MODELING; IN NETWORKS; IP-ADDRESS PREFIX; NP-HARD; POLYNOMIAL-TIME ALGORITHMS;

ACCESS CONTROL;

EID: 84969211536     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. [AR99] V. S. Anil Kumar and H. Ramesh. Covering rectilinear polygons with axis-parallel rectangles. In Proc. 31st Ann. ACM Symposium on Theory of Computing, pages 445-454, New York, NY, 1999. ACM.
2. [BD97] P. Berman and B. DasGupta. Complexities of efficient solutions of rectilinear polygon cover problems. Algorithmica, 17:331-356, 1997.
3. [Cis01] Cisco Systems. Controlling network access with access control lists (Chapter 10). In Catalyst 6500 Series Switch and Cisco 7600 Series Firewall Services Module Configuration Guide, 2001. Available at http://www.cisco.com/univercd/cc/td/doc/pro duct/lan/cat6000/mod icn/fwsm/fwsm 2 2/fwsm cfg? mngacl.pdf.
4. [CL05] E. Cohen and C. Lund. Packet classification in large ISPs: Design and evaluation of decision tree classifiers. In Proc. ACM Sigmetrics '05, pages 73-84, 2005.
5. [DKVZ99] R. Daves, C. King, S. Venkatachary, and B. Zill. Constructing optimal IP routing tables. In Proc. IEEE INFOCOM 1999, pages 88-97, 1999.
6. [EM01] David Eppstein and S. Muthukrishnan. Internet packet filter management and rectangle geometry. In Proc. 12th Ann. ACM-SIAM Symp. of Discrete Algorithms, pages 827-835, Philadelphia, PA, 2001. SIAM.
7. [Ful05] E. W. Fulp. Optimization of network firewall policies using directed acyclic graphs. In Proc. IEEE Internet Management Conf., 2005.
8. [GM99] P. Gupta and N. McKeown. Packet classification on multiple fields. In Proc. Conf. on Applications, Technologies, Architectures, and Protocols for Comp. Communication (SIGCOMM), pages 147-160, New York, NY, 1999. ACM.
9. [KMT03] H. Kaplan, E. Molad, and R. E. Tarjan. Dynamic rectangular intersection with priorities. In Proc. 35th Ann. ACM Symposium on Theory of Computing, pages 639-648, New York, NY, 2003. ACM.
10. +02] L. V. S. Lakshmanan, R. T. Ng, C. X. Wang, X. Zhou, and T. J. Johnson. The generalized MDL approach for summarization. In Proc. Int. Conf. on Very Large Databases (VLDB'02), pages 766-777, 2002.
11. [Mas78] W. J. Masek. Some NP-complete set covering problems. Unpublished manuscript, 1978.
12. [SSW03] S. Suri, T. Sandholm, and P. Warkhede. Compressing two-dimensional routing tables. Algorithmica, 35:287-300, 2003.
13. [TC03] June 2003. TopCoder Match Summary, Single Round Match 150, http://www.topcoder.com/index?t=statistics&c=srm150 prob.
14. [Tho03] M. Thorup. Space efficient dynamic stabbing with fast queries. In Proc. 35th Ann. ACM Symposium on Theory of Computing, pages 649-658, New York, NY, 2003. ACM.