PSVShare: A Priority-based SFC placement with VNF Sharing

Abstract

Edge computing resources deployed at the access network are distributed and limited compared to the abundant core cloud resources. With the increasing demand on edge resources by emerging delay-sensitive use-cases, efficient resource utilization is to play an indispensable role. Taking advantage of operation dynamics and common functions in network/enterprise services, we propose PSVShare a priority-based, least-cost and resource-efficient service placement algorithm. The algorithm considers practical settings and conditions such as service categories (premium and best-effort), service arrival and completion times, and service relocation/migration due to changing traffic loads. PSVShare satisfies more services, achieves lower rejection rates, and is agnostic to arrival order and ratio of premium to best-effort services.