Chaima Ghribi
ABSTRACT
This paper addresses the problem of Virtualized Network Functions placement and traffic steering in Cloud infrastructures. We design an efficient dynamic programming (DP) algorithm for joint VNF placement and traffic steering that runs in polynomial time. In compliance with dynamic programming approaches, we organize the problem in smaller interdependent subproblems (one per VNF in the requested chain) that are solved successively and aggregated to compose the overall chain placement. We demonstrate the potential of our solution by comparing it with a Multi-Stage approach and a greedy algorithm. Simulation results show that our dynamic programming algorithm achieves better performance in terms of resource usage, acceptance rate and cloud provider revenue.
- ETSI GS NFV 001: "Network Functions Virtualisation (NFV); Use Cases".Google Scholar
- "Building Business Benefits of NFV". https://www.sdxcentral.com/cisco/service-provider/info/analysis/building-nfv-business-benefits/.Google Scholar
- B. Addis, D. Belabed, M. Bouet, and S. Secci. Virtual Network Functions Placement and Routing Optimization. 2015.Google Scholar
- M. F. Bari, S. R. Chowdhury, R. Ahmed, and R. Boutaba. On orchestrating virtual network functions in NFV. CoRR, abs/1503.06377, 2015.Google Scholar
- U. Bertelè and F. Brioschi. Nonserial dynamic programming. Mathematics in science and engineering. Academic Press, New York, 1972. Google ScholarDigital Library
- R. Cohen, L. Lewin-Eytan, J. S. Naor, and D. Raz. Near optimal placement of virtual network functions. In 2015 IEEE Conference on Computer Communications (INFOCOM), pages 1346--1354, April 2015.Google ScholarCross Ref
- G. D. Forney. The viterbi algorithm. Proceedings of the IEEE, 61(3):268--278, March 1973.Google ScholarCross Ref
- A. Gember, A. Krishnamurthy, S. S. John, R. Grandl, X. Gao, A. Anand, T. Benson, A. Akella, and V. Sekar. Stratos: A network-aware orchestration layer for middleboxes in the cloud. CoRR, abs/1305.0209, 2013.Google Scholar
- X. Li and C. Qian. The virtual network function placement problem. In 2015 IEEE Conference on Computer Communications Workshops, INFOCOM Workshops, Hong Kong, China, April 26 - May 1, 2015, pages 69--70, 2015.Google ScholarCross Ref
- M. Luizelli, L. Bays, L. Buriol, M. Barcellos, and L. Gaspary. Piecing together the nfv provisioning puzzle: Efficient placement and chaining of virtual network functions. In Integrated Network Management (IM), 2015 IFIP/IEEE International Symposium on, pages 98--106, May 2015.Google ScholarCross Ref
- M. Mechtri, C. Ghribi, and D. Zeghlache. Vnf placement and chaining in distributed cloud. In the 9th IEEE International Conference on Cloud Computing, June 27 - July 2, 2016, San Francisco, USA.Google ScholarCross Ref
- M. Mechtri, C. Ghribi, and D. Zeghlache. A scalable algorithm for the placement of service function chains. IEEE Transactions on Network and Service Management, 13(3):533--546, Sept 2016.Google ScholarDigital Library
- S. Mehraghdam, M. Keller, and H. Karl. Specifying and placing chains of virtual network functions. In Cloud Networking (CloudNet), 2014 IEEE 3rd International Conference on, pages 7--13, Oct 2014.Google ScholarCross Ref
- H. Moens and F. De Turck. Vnf-p: A model for efficient placement of virtualized network functions. In Network and Service Management (CNSM), 2014 10th International Conference on, pages 418--423, Nov 2014.Google ScholarCross Ref
- A. Mohammadkhan, S. Ghapani, G. Liu, W. Zhang, K. K. Ramakrishnan, and T. Wood. Virtual function placement and traffic steering in flexible and dynamic software defined networks. In 2015 IEEE International Workshop on Local and Metropolitan Area Networks, LANMAN 2015, Beijing, China, April 22-24, 2015, pages 1--6, 2015.Google ScholarCross Ref
- H. Ney. Dynamic programming as a technique for pattern recognition. In International Conference on Pattern Recognition, 1982.Google Scholar
- W. Rankothge, J. Ma, F. Le, A. Russo, and J. Lobo. Towards making network function virtualization a cloud computing service. In Integrated Network Management (IM), 2015 IFIP/IEEE International Symposium on, pages 89--97, May 2015.Google ScholarCross Ref
- S. Sahhaf, W. Tavernier, M. Rost, S. Schmid, D. Colle, M. Pickavet, and P. Demeester. Network service chaining with optimized network function embedding supporting service decompositions. Computer Networks, 93, Part 3:492--505, 2015. Cloud Networking and CommunicationsII\. Google ScholarDigital Library
- D. J. White. Dynamic programming. Oliver and Boyd, 1969.Google Scholar
Index Terms
- A Dynamic Programming Algorithm for Joint VNF Placement and Chaining
Recommendations
Dynamic VNF Placement for Mapping Service Function Chain Requests in NFV-enabled Networks
WWW '20: Companion Proceedings of the Web Conference 2020Network function virtualization (NFV) brings significant performance and management benefits for the enterprises to place virtual network functions (VNFs) while reducing the operating expenses and capital expenditures. In this paper, we study the ...
Energy Efficient Algorithm for VNF Placement and Chaining
CCGrid '17: Proceedings of the 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid ComputingThis paper addresses energy efficient VNF placement and chaining over NFV enabled infrastructures. VNF placement and chaining are formulated as a decision tree search to overcome this NP-Hard problem complexity. The proposed approach is an extension of ...
An efficient and effective detailed placement algorithm
ICCAD '05: Proceedings of the 2005 IEEE/ACM International conference on Computer-aided designIn the past few years, there has been a lot of research in the area of global placement. In comparison, not much attention has been paid to the detailed placement problem. Existing detailed placers either fail to improve upon the excellent solution ...
Comments