Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
ETSI Industry Specification Group (ISG). Network Functions Virtualisation (NFV); Infrastructure Overview (2015)
Haleplidis, E., Pentikousis, K., Denazis, S., Salim, J.H., Meyer, D., Koufopavlou, O.: Software-defined networking (SDN): layers and architecture terminology. In: IETF Network Task Force, no. rfc 7426 (2015)
Hantouti, H., Benamar, N., Taleb, T., Laghrissi, A.: Traffic steering for service function changing. IEEE Commun. Surv. Tutor. 21(1), 487–507 (2018)
Halpern, J., Pignataro, C.: Service function chaining (SFC) architecture. In: IETF Network Task Force, no. rfc 7665 (2015)
Bhamare, D., Jain, R., Samaka, M., Erbad, A.: A survey on service function chaining. J. Netw. Comput. Appl 75, 138–155 (2016)
Herrera, J.G., Botero, J.F.: Resource allocation in NFV: a comprehensive survey. IEEE Trans. Netw. Serv. Manag 13(3), 518–532 (2016)
Xie, Y., Liu, Z., Wang, S., Wang, Y.: Service function chaining resource allocation: a survey (2016). ArXiv e-prints
Kleinrock, L.: Queueing Systems, Volume I: Theory. Wiley & Sons, Hoboken (1975)
Ellens, W., Mandjes, M., van den Berg, J., Worm, D., Blaszczuk, S.: Performance valuation using periodic system-state measurements. Perf. Eval. 93, 27–46 (2015)
Wetzels, F., van den Berg, J., Bosman, J., van der Mei, R.: Dynamic priority assignment for SLA compliance in service function chains. In: 26th International Conference on Telecommunications (ICT) (2019)
Kaczynski, W., Leemis, L.M., Drew, J.: Transient queueuing analyses. INFORMS J. Comput. 24(1), 10–28 (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Wetzels, F., van den Berg, H., van der Mei, R. (2021). A Hybrid Flow/Packet Level Model for Predictive Service Function Chain Selection in SDN. In: Zhao, Q., Xia, L. (eds) Performance Evaluation Methodologies and Tools. VALUETOOLS 2021. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 404. Springer, Cham. https://doi.org/10.1007/978-3-030-92511-6_6
Download citation
DOI: https://doi.org/10.1007/978-3-030-92511-6_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-92510-9
Online ISBN: 978-3-030-92511-6
eBook Packages: Computer ScienceComputer Science (R0)