Network Function Virtualization (NFV) is an emerging and promising solution to manage and maintain networks efficiently via developing network functions in software and executing them on commodity servers. NFV enables flexible compositions of network functions and swift deployment of novel services. A major challenge in the respect is the service function chaining problem that consists of creating an end-to-end path to ensure network flows pass through it efficiently traversing a specific sequence of services. Since this problem is known to be NP-hard, previous research focused on designing heuristic algorithms for efficient chaining of services. However, existing algorithms cannot deal with resource bottleneck perfectly in capacity constrained network, which leads to failures of allocating service chains. To address this issue, we first introduce a new concept of sensitivity and state the Resource Supplement Problem. We then propose two sensitivity computing approaches and devise two heuristic algorithms for efficient supplement of additional resources into the most sensitive node for better deployment of service chains. Simulation results show that the proposed algorithms increase the acceptance ratio and revenue significantly while decreasing the cost incurred by additional resources.