Multicasting is a fundamental functionality of networks for many applications, including online conferencing, event monitoring, video streaming, and system monitoring in data centers. To ensure multicasting reliable, secure and scalable, a service chain consisting of network functions (e.g., firewalls, Intrusion Detection Systems (IDSs), and transcoders) usually is associated with each multicast request, which we refer to as an NFV-enabled multicast request. In this paper we study NFV-enabled multicasting in a Software-Defined Network (SDN) with the aim to minimize the implementation cost of each NFVenabled multicast request and maximize the network throughput of a sequence of NFV-enabled requests, subject to resource capacity constraints on servers and links. We first formulate novel NFV-enabled multicasting and online NFV-enabled multicasting problems. We then devise the very first approximation algorithm with an approximation ratio of 2K for the NFV-enabled multicasting problem if the number of servers for implementing the network functions of each request is no more than a constant K (≥ 1). Furthermore, we also study dynamic admissions of NFV-enabled multicast requests without the knowledge of future request arrivals with the objective to maximize the network throughput, and propose an online algorithm with a competitive ratio of O(log n) for it if K = 1, where n is the number of nodes in the network. We finally evaluate the performance of the proposed algorithms through experimental simulations, and experimental results demonstrate that the proposed algorithms outperform other existing heuristics.