Abstract
This paper investigates the network function virtualization (NFV)-enabled multicast problem, and proposes a steiner tree-based algorithm to reduce the cost of virtual network function (VNF) deployment and routing. In the algorithm, to minimize the bandwidth consumption, the Steiner tree is constructed by taking all the destination nodes as the terminals. Then a interconnection node of the tree is selected to connect the source by the shortest path, in which the VNFs are deployed and shared by all the destination nodes. Simulation results show that the proposed algorithm is effective to reduce the number of deployed VNFs and the total cost of the networks.
Sign-in/Register to access full text options 
Free) 
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 call
