Abstract
This paper studies the problem of service chain (SC) deployment. Specifically, we try to place virtual network functions (vNFs) on network nodes and connect the vNFs in sequence through link mapping. We start with the offline problem. An integer linear programming (ILP) model is formulated to minimize the total SC deployment cost. With the ILP, we prove that the offline problem is NP-hard and propose a time-efficient heuristic based on affiliation-aware vNF placement. Then, we move to the online problem, and design a forecast-assisted online SC deployment algorithm that includes the prediction of future vNF requirements. Simulation results show that the online algorithms can reduce the blocking probability of SC requests and increase the service provider's profit from SC deployment effectively.
Sign-in/Register to access full text options 
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.
