Abstract
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.
Original language | English |
---|---|
Title of host publication | 2019 26th International Conference on Telecommunications, ICT 2019 |
Place of Publication | Piscataway, NJ |
Publisher | IEEE |
Pages | 160-166 |
Number of pages | 7 |
ISBN (Electronic) | 978-1-7281-0273-3 |
ISBN (Print) | 978-1-7281-0274-0, 978-1-7281-0272-6 |
DOIs | |
Publication status | Published - Apr 2019 |
Externally published | Yes |
Event | 26th International Conference on Telecommunications, ICT 2019 - Hanoi, Viet Nam Duration: 8 Apr 2019 → 10 Apr 2019 Conference number: 26 |
Conference
Conference | 26th International Conference on Telecommunications, ICT 2019 |
---|---|
Abbreviated title | ICT |
Country | Viet Nam |
City | Hanoi |
Period | 8/04/19 → 10/04/19 |
Keywords
- Priority allocation
- Service function chain resource allocation
- SLA violation duration
- Software defined networking