This paper is motivated by recent developments in SDN and NFV whereby service functions, distributed over a centralised controlled network, are connected to form a service function chain (SFC). Upon arrival of a new service request a decision has to be made to which one of SFCs the request must be routed. This decision is based on (1) actual state information about the background traffic through the SFC nodes, and (2) a prediction of the fraction of time that the SFC is in overflow during the course of the new flow in the system. In this paper, we propose a new method for assigning an incoming flow to an SFC. For that, we propose and compare two methods: a simple flow-based algorithm and a more refined hybrid flow/packet-based algorithm. By extensive simulations, we show that the simple flow-based algorithm works particularly well if the network is not overloaded upon new flow arrival. Moreover, the results show that the flow/packet-based algorithm enhances the flow-based algorithm as it handles initial overload significantly better. We conclude that the prediction-based SFC selection is a powerful method to meet QoS requirements in a software defined network with varying background traffic.

, , ,
doi.org/10.1007/978-3-030-92511-6_6
Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering
14th EAI International Conference on Performance Evaluation Methodologies and Tools, VALUETOOLS 2021
Centrum Wiskunde & Informatica, Amsterdam, The Netherlands

Wetzels, F.P.M, van den Berg, J.L, & van der Mei, R.D. (2021). A hybrid flow/packet level model for predictive service function chain selection in SDN. In EAI International Conference on Performance Evaluation Methodologies and Tools (pp. 93–106). doi:10.1007/978-3-030-92511-6_6