Abstract
Network Function Virtualization (NFV) is a new network paradigm that decouples network functions from dedicated hardware. Network services in NFV are deployed as service chains, also known as Service Function Chains (SFCs). SFC consists of an ordered set of Virtual Network Functions (VNFs). One of the main challenge when deploying SFC is to efficiently make use of the resource. In this paper, we focus on the SFC composition and mapping considering resource optimization. We formulate the SFC composition and mapping problem as a weighted graph matching problem. Then we propose a Hungarian based algorithm to solve the SFC composition and mapping problem in a coordinated way.