Towards a Set-Theoretic Model of Security Policies for Database-Defined Networks

Aziz, Benjamin (2026) Towards a Set-Theoretic Model of Security Policies for Database-Defined Networks. Science of Computer Programming. p. 103463. ISSN 01676423

Full text not available from this repository. (Request a copy)

Abstract

Database-defined networking advocates for the idea that a network can be abstracted as a number of data tables that can be manipulated in order to change the network’s configuration and state. Therefore, this introduces programmability into network management. This paper aims at demonstrating how such programmability can be useful in defining security policies for database-defined networking. The paper adopts a formal method based on set theory for the definition of three models of security policies; namely, policies as sets, policies as multisets and policies as partially ordered sets. The initial results demonstrate that these models can be enforced using various approaches, and leading to different levels of expressivity depending on the model chosen. We expect the initial results of this research to be of interest to the softwarised-networking research community, and the results open future directions particularly in terms of defining new models of policies, e.g. based on linearity of resources.

Item Type:	Article
Additional Information:	** Article version: AM ** Embargo end date: 31-12-9999 ** From Elsevier via Jisc Publications Router ** History: accepted 12-02-2026; issued 16-02-2026. ** Licence for AM version of this article: This article is under embargo with an end date yet to be finalised.
SWORD Depositor:	JISC Router
Depositing User:	JISC Router
Date Deposited:	25 Feb 2026 08:53
Last Modified:	25 Feb 2026 08:53
URI:	https://bnu.repository.guildhe.ac.uk/id/eprint/20836

Actions (login required)

Edit Item