Order dependency-aware service function placement in service function chaining

In distributed network function virtualization (NFV) environments, the latency can be significantly increased as the length of service function chain (SFC) increases. To reduce the latency, the order dependency allowing parallel processing of service functions (SFs) can be exploited. In this paper, we propose an order dependency-aware SF placement scheme and analyze its advantages and challenges compared with conventional ones.