A Hybrid Flow/Packet Level Model for Predictive Service Function Chain Selection in SDN
conference paper
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 flowbased
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.
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 flowbased
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.
Topics
Predictive selectionService function chainSoftware defined networkVarying background trafficNetwork function virtualizationQuality of serviceBackground trafficFlow based algorithmsFlow packetsHybrid flowPredictive selectionService function chainService functionsSoftware-defined networksVarying background
TNO Identifier
968094
ISSN
18678211
ISBN
9783030925109
Publisher
Springer Science and Business Media Deutschland GmbH
Source title
Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST, 14th International Conference on Performance Evaluation Methodologies and Tools, VALUETOOLS 2021, 30 October 2021 through 31 October 2021
Editor(s)
Q.Xia, L. zhao
Pages
93-106
Files
To receive the publication files, please send an e-mail request to TNO Repository.