The Small, the Fast, and the Lazy (SFL): A General Approach for Fast and Flexible Packet Classification

Hager, Sven; Brack, Samuel; Scheuermann, Björn

doi:10.1109/lcn.2016.125

Cited by 3 publications

(1 citation statement)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hager et al 26 tackle optimizing RM under changing network policies, ie, policy updates that take place either through insertion or through deletion. The work proposes to augment existing firewalls with a special buffer maintaining the list of updates to the policy.…”

Section: Recent Advances In Firewall Matching Optimizationmentioning

confidence: 99%

On optimizing firewall performance in dynamic networks by invoking a novel swapping window–based paradigm

Mohan

Yazidi

Feng

et al. 2018

Int J Communication

View full text Add to dashboard Cite

Designing and implementing efficient firewall strategies in the age of the internet of things is far from trivial. This is because, as time proceeds, an increasing number of devices will be connected, accessed, and controlled on the internet.Additionally, an ever-increasingly amount of sensitive information will be stored on various networks. A good and efficient firewall strategy will attempt to secure this information and to also manage the large amount of inevitable network traffic that these devices create. The goal of this paper is to propose a framework for designing optimized firewalls for the internet of things. This paper deals with 2 fundamental challenges/problems encountered in such firewalls.The first problem is associated with the so-called rule matching time problem.Here, we propose a simple condition for performing the swapping of the firewall's rules; using which, we can guarantee the firewall's consistency and integrity and also ensure a greedy reduction in the matching time. Unlike the state of the art, our swapping condition considers rules that are not necessarily consecutive, using a novel concept referred to as a "swapping window." The second contribution of our paper is a novel "batch"-based traffic estimator that provides network statistics to the firewall placement optimizer. The traffic estimator is a subtle but modified batch-based embodiment of the Stochastic Learning Weak Estimator. Further, by performing a rigorous suite of experiments, we demonstrate that both algorithms are capable of optimizing the constraints imposed for obtaining an efficient firewall. KEYWORDSbatch update, firewall optimization, learning automata, matching time, nonstationary environments, weak estimators John Oommen is a Chancellor's Professor, Fellow of the IEEE, and Fellow of the IAPR. He is also an Adjunct Professor at Agder University College in Grimstad, Norway. Int J Commun Syst. 2018;31:e3773. wileyonlinelibrary.com/journal/dac Wild card 192.0.* Address range 192.0.0.0-192.0.255.255 Range 192.0.2.2-192.0.2.150 The given range of addresses Single 192.0.2.2 A single given IP address

show abstract

Section: Recent Advances In Firewall Matching Optimizationmentioning

confidence: 99%