Abstract
In this paper, we investigate the service capacity of a software-defined network with network function virtualization and service chaining. To obtain and achieve the service capacity, we formulate a mixed integer linear programming problem to jointly optimize the placement of virtual machines and the steering of network flows. In addition, we propose the greedy linear programming relaxation algorithm for efficiently obtaining solutions in three phases based on auxiliary linear programming problems and augmented service paths. We justify the usage of the proposed approach by analytical results and simulation results.
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.
