An Analytic-Deterministic Model for Traffic Prioritization in Software Defined Networks with Network Calculus

Abstract

Different classes of packets traffic require specific performance of network resources in terms of Quality of Service metrics. The models proposed to ensure end-to-end QoS have not been well implemented due to their complexity and lack of scalability. The Software Defined Networks feature an innovative paradigm that aims to make the networks programmable. This paradigm allows to know the state of the network and its topology in real time, which makes possible the reconfiguration of routes and allocating resources dynamically. This paper proposes an analytical-deterministic model that allows to prioritize IP packets traffic, taking advantage of SDN and basing the prioritization policies over definitions found in the Network Calculus mathematical theory. The results show the feasibility of using this theory as a tool in the packet flows policing in order to ensure QoS on a software defined network.