The Service Function (SF) was defined in Reference [17] as a function that is responsible for the specific treatment of received packets where the service function can work at any layer of the OSI layers while the network functions are related to the network layer. Also, the network service was defined as a service function that is provided by a network operator. In this paper, the term Network Service (NS) is used as the same meaning of SFC to describe the mobile core network services, as one of the ETSI NFV use cases [18]. As known, the placement algorithms are used in high-availability mechanisms [19] and in the resiliency techniques of cloud computing [20]. This approach is also considered in NFV where placement algorithms were suggested within the proposed methods of by ETSI NFV reliability and availability group [21] in order to fulfill the NFV resiliency requirements [22]. Despite the fact that the VNE problem was proved to be strong NP-hard even with special cases that obtained by fixing one of the problem's dimensions to one [23]. However, realizing the one-to-many mapping of traditional core mobile network function into a VNF Forwarding Graph (VNF-FG) is expected to increase the complexity of solving the VNF-FG embedding (VNF-FGE) stage of NFV-RA problem. Additionally, the authors of Reference [24] claimed that embedding primary-backup redundant scheme protection for the service requests would result in mapping the backup links to long physical paths. Therefore, it is important to develop placement algorithms that have a short response time (within milliseconds) to meet carrier-grade requirements regardless of the physical network size or the service request size. **The contribution:** The goal of this study is to develop a new placement algorithm that can meet a rapid response time to avoid high embedding cost, which might occur due to mapping multiple paths of service requests to long physical paths. Thus, we propose a path mapping approach, which uses path identification to reduce the number of candidate physical nodes and links. The proposed path identification can be realized in the NFV repository while it can also consider the use of different virtualization techniques to enhance the resiliency. To realize the path mapping approach, we formulate the NFV-RA problem as an Integer Linear Programming (ILP), then, we solve it with ILP-based and heuristic schemes. These two solutions--namely ILP-P and DcPSM--are the main contribution of this work; where ILP-P is an Integer Linear Programming for Path mapping based on an exact scheme, while DcPSM is a Decomposition Path Selection Mapping based on a heuristic scheme. Both schemes have been evaluated in small- and large-scale physical networks using a simulation. Twenty-two experimental scenarios were simulated using five types of service requests in order to evaluate the impact of multiple paths in the service request on the execution time and embedding cost. Furthermore, the proposed schemes are evaluated in short and long simulation scenarios; where the impact of service request attributes such as number of nodes, edges and paths are studied. The results of our proposed schemes were compared to the results of the work proposed in Reference [11]. The remainder of this paper is organized as follows: The related works are presented and discussed in Section 2. Then, the proposed exact scheme (ILP-P) and heuristic scheme (DcPSM) are explained in Sections 3 and 4, respectively. As for Section 5, it demonstrates the performance evaluation process including the experiments, simulation environment, scenarios, results, and discussion. Finally, the conclusion and future works are presented in Section 6.