Abstract
In service function chaining (SFC), an ordered list of service functions (SFs) is specified for network services, and those SFs should be placed in appropriate service nodes (SNs) to satisfy the given service latency requirement. In this paper, we formulate an integer non-linear programming (INLP) problem for the optimal placement of SFs when the latency requirement for network services and network conditions (e.g., link latency and SN capacity) are given. Evaluation results show that the optimal placement can achieve lower latency than conventional schemes.
| Original language | English |
|---|---|
| Title of host publication | ICUFN 2016 - 8th International Conference on Ubiquitous and Future Networks |
| Publisher | IEEE Computer Society |
| Pages | 102-105 |
| Number of pages | 4 |
| Volume | 2016-August |
| ISBN (Electronic) | 9781467399913 |
| DOIs | |
| Publication status | Published - 2016 Aug 9 |
| Event | 8th International Conference on Ubiquitous and Future Networks, ICUFN 2016 - Vienna, Austria Duration: 2016 Jul 5 → 2016 Jul 8 |
Other
| Other | 8th International Conference on Ubiquitous and Future Networks, ICUFN 2016 |
|---|---|
| Country/Territory | Austria |
| City | Vienna |
| Period | 16/7/5 → 16/7/8 |
Keywords
- integer non-linear program (INLP)
- placement
- service function (SF)
- Service function chaining (SFC)
- service node (SN)
ASJC Scopus subject areas
- Computer Networks and Communications
- Computer Science Applications
- Hardware and Architecture