Optimal placement of service function in service function chaining

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.