Abstract
In Network Function Virtualization (NFV), a multicast data flow must be traversed through a Service Function Chain (SFC) that is a predefined sequence of Virtual Network Functions (VNFs). In this letter, we formulate the problem of optimal embedding of NFV-Enabled multicast service chains as a mixed binary linear program. Then to solve the problem in a reasonable time, we use the penalty-based successive upper bound minimization algorithm. Also, a heuristic solution based on the decomposition of the problem into smaller sub-problems that can be solved iteratively and sequentially, is proposed. Simulation results demonstrate the effectiveness of the proposed solution methods.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
