Efficient Distribution of Security Policy Filtering Rules in Software Defined Networks - Archive ouverte HAL Access content directly
Conference Papers Year :

Efficient Distribution of Security Policy Filtering Rules in Software Defined Networks

(1) , (2) , (1) , (3) , (4, 5)
1
2
3
4
5

Abstract

Software Defined Networks administrators can specify and smoothly deploy abstract network-wide policies, and then the controller acting as a central authority implements them in the flow tables of the network switches. The rule sets of these policies are specified in the forwarding tables, which are usually accessed using very expensive and power-hungry ternary content-addressable memory (TCAM). Consequently, a given table can only contain a limited number of rules. However, various applications need large rule sets to perform filtering on diverse flows. In this paper, we propose several algorithms for decomposing and distributing a rule set on network switches of limited flow tables size, while preserving the network policy semantics. Through experiments on several rule sets with single and multiple dimensions, we evaluate and analyse the performance of our rule placement techniques. Our results show that our proposals are efficient in practice.
Fichier principal
Vignette du fichier
main.pdf (613.86 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03036350 , version 1 (02-12-2020)

Identifiers

  • HAL Id : hal-03036350 , version 1

Cite

Ahmad Abboud, Rémi Garcia, Abdelkader Lahmadi, Michaël Rusinowitch, Adel Bouhoula. Efficient Distribution of Security Policy Filtering Rules in Software Defined Networks. NCA 2020 - 19th IEEE International Symposium on Network Computing and Applications, Nov 2020, Online conference, France. ⟨hal-03036350⟩
101 View
117 Download

Share

Gmail Facebook Twitter LinkedIn More