A k-shortest-path-based edge computing network service function chain embedding method

Abstract

The application discloses an edge computing network service function chain embedding method based on K shortest path, and aims at a distributed service function chain embedding problem under time delay constraint. In the case of meeting the end-to-end time delay constraint, a service function embedding algorithm based on K shortest path algorithm is designed to minimize the deployment cost. The application firstly proposes a service function embedding problem modeling method based on a weighted layered graph, and converts the service function chain embedding problem into a minimum cost path problem under time delay constraint in the weighted layered graph. Secondly, a service function chain embedding mechanism under time delay constraint is designed based on the weighted layered graph and K-linear measurement aggregation algorithm. Compared with the prior art, the application has better high performance and operability, and has practical significance for complex network applications in edge computing networks.

Images