The difficulty of efficiently reordering the rules in an Access Control List is considered and the essential optimisation problem formulated. The complexity of exact and sophisticated heuristics is noted along with their unsuitability for real time implementation embedded in the hardware of the network device. A simple alternative is proposed, in which a very limited rule reordering is considered following the processing of each packet. Simulation results are given from a range of traffic types. The method is shown to achieve savings that make its use worthwhile for lists longer than a given number of rules. This number is dependent on traffic characteristics but generally around 25 for typical network conditions.
Grout, V., Davies, J., & McGinn, J. (2007) ‘An argument for simple embedded ACL optimisation’. Computer Communications, 30(2), 280-287
Digital Commons Citation
Grout, Vic; Davies, John N.; and McGinn, John, "An argument for simple embedded ACL optimisation" (2007). Computing. Paper 1.