Dynamic priority assignment for SLA compliance in service function chains
conference paper
In service function chaining, data flows from a particular application or user travel along a pre-defined sequence of network functions. Appropriate service function chaining resource allocation is required to comply with the service level required by the application. In this paper, we introduce a dynamic priority assignment for flows that compete for service using a particular network function in a chain. Using the recent results of the performance metrics of transient birth-death processes, we analyse this priority assignment and develop an optimal strategy for selecting a (cheap) low-or (expensive) high-priority service, given the flow's service level agreement requirements. A decision table can, thus, be created to facilitate the fast, online priority scheduling of newly arriving flows requesting service. © 2019 IEEE.
Topics
Priority allocationService function chain resource allocationSLA violation durationSoftware defined networkingDecision tablesResource allocationSoftware defined networkingTransfer functionsDynamic priority assignmentPerformance metricsPriority schedulingService functionsService Level AgreementsSLA violation durationTelecommunication services
TNO Identifier
869353
ISBN
9781730000000
Publisher
Institute of Electrical and Electronics Engineers Inc.
Article nr.
8798785
Source title
2019 26th International Conference on Telecommunications, ICT 2019, 26th International Conference on Telecommunications, ICT 2019, 8 April 2019 through 10 April 2019
Pages
160-166
Files
To receive the publication files, please send an e-mail request to TNO Repository.