Abstract
It is known that by incorporating network function virtualization (NFV) in inter-datacenter (inter-DC) networks, service providers can use their network resources more efficiently and adaptively and expedite the deployment of new services. This paper studies the provisioning algorithms to realize tree-type virtual network function forwarding graphs (VNF-FGs), i.e., multicast NFV trees (M-NFV-Ts), in inter-DC elastic optical networks (IDC-EONs) cost-effectively. Specifically, we try to optimize the VNF placement and multicast routing and spectrum assignment jointly for orchestrating M-NFV-Ts in an IDC-EON with the lowest cost. Our study addresses both static network planning and dynamic network provisioning. For network planning, we first formulate a mixed integer linear programming (MILP) model to solve the problem exactly, and then propose three heuristic algorithms, namely, auxiliary frequency slot matrix (AFM)-MILP, AFM-GS, and RB. Extensive simulations show that AFM-MILP and AFM-GS can approximate the MILP's performance on low-cost M-NFV-T provisioning with much shorter running time. For network provisioning, we design two additional online algorithms based on AFM-GS and RB to serve M-NFV-Ts in a dynamic IDC-EON, with the consideration of spectrum fragmentation.
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.
