Paper Title : Cost-efficient Resource Schedule Scheme Based on Packet Dropping Positions in Service Chain

ISSN : 2394-2231
Year of Publication : 2020

10.29126/23942231/IJCT-v7i4p3

Authors: Chengxiang Li

         



MLA Style: Chengxiang Li " Cost-efficient Resource Schedule Scheme Based on Packet Dropping Positions in Service Chain" Volume 7 - Issue 4 July-August,2020 International Journal of Computer Techniques (IJCT) ,ISSN:2394-2231 , www.ijctjournal.org

APA Style: Chengxiang Li " Cost-efficient Resource Schedule Scheme Based on Packet Dropping Positions in Service Chain" Volume 7 - Issue 4 July-August,2020 International Journal of Computer Techniques (IJCT) ,ISSN:2394-2231 , www.ijctjournal.org

Abstract
- Network Function virtualization(NFV) as an emerging technology, it enables dedicated hardware for network functions to transform to software called Virtual Network Function(VNF) with more convenience and elasticity. VNFs can be chained together in given order as service chain to provide a specific network service. When multiple VNFs are consolidated into single server, limited computing resource would be used bymore than onecompetitor, unreasonable resource scheduling scheme can lead to severe resource wastage. What’s more, in the environment of service chain, packets be dropped at a certain position has been processed by upstream VNFs, so losing packets at different positions of service chain can cause different degree of resourcecost. This paper studies the resource scheduling scheme of service chain in light of this issue. Firstly, packets loss cost model is defined base on queue theory, and to minimize cost of losing packets, a greedy based cost-efficient algorithm which is sensitive to positions and arrival packet rates is proposed after analysis. Simulation shows that our proposed algorithm achieves optimization on reducing cost by up to 74.93%compared with other algorithmswhen seven VNFs in service chain. Evaluation in our paper demonstrates thatgreedy based cost-efficient algorithmoutperforms other competitorsobviously.

Reference
[1] Yi B, Wang X, Li K, et al. A comprehensive survey of network function virtualization[J]. Computer Networks, 2018, 133: 212-262. [2] Kulkarni S G, Zhang W, Hwang J, et al. Nfvnice: Dynamic backpressure and scheduling for nfv service chains[C]//Proceedings of the Conference of the ACM Special Interest Group on Data Communication. 2017: 71-84. [3] Qu L, Assi C, Shaban K. Delay-aware scheduling and resource optimization with network function virtualization[J]. IEEE Transactions on Communications, 2016, 64(9): 3746-3758. [4] Pham C, Tran N H, Hong C S. Virtual network function scheduling: A matching game approach[J]. IEEE Communications Letters, 2017, 22(1): 69-72. [5] Zhang Y, He F, Sato T, et al. Optimization of network service scheduling with resource sharing and preemption[C]//2019 IEEE 20th International Conference on High Performance Switching and Routing (HPSR). IEEE, 2019: 1-6. [6] Mijumbi R, Serrat J, Gorricho J L, et al. Design and evaluation of algorithms for mapping and scheduling of virtual network functions[C]//Proceedings of the 2015 1st IEEE conference on network softwarization (NetSoft). IEEE, 2015: 1-9. [7] Yao H, Xiong M, Li H, et al. Joint optimization of function mapping and preemptive scheduling for service chains in network function virtualization[J]. Future Generation Computer Systems, 2020, 108: 1112-1118. [8] Alameddine H A, Sebbah S, Assi C. On the interplay between network function mapping and scheduling in VNF-based networks: A column generation approach[J]. IEEE Transactions on Network and Service Management, 2017, 14(4): 860-874. [9] Yoshida M, Shen W, Kawabata T, et al. MORSA: A multi-objective resource scheduling algorithm for NFV infrastructure[C]//The 16th asia-pacific network operations and management symposium. IEEE, 2014: 1-6. [10] Beck M T, Botero J F. Scalable and coordinated allocation of service function chains[J]. Computer Communications, 2017, 102: 78-88. [11] Yi B, Wang X, Huang M. A generalized VNF sharing approach for service scheduling[J]. IEEE Communications Letters, 2017, 22(1): 73-76. [12] El Khoury N, Ayoubi S, Assi C. Energy-aware placement and scheduling of network traffic flows with deadlines on virtual network functions[C]//2016 5th IEEE International Conference on Cloud Networking (Cloudnet). IEEE, 2016: 89-94. [13] Li C, Cui L. A novel NFV schedule optimization approach with sensitivity to packets dropping positions[C]//Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms. 2018: 23-28. [14] Cui L, Tso F P, Guo S, et al. Enabling heterogeneous network function chaining[J]. IEEE Transactions on Parallel and Distributed Systems, 2018, 30(4): 842-854. [15] Herrera J G, Botero J F. Resource allocation in NFV: A comprehensive survey[J]. IEEE Transactions on Network and Service Management, 2016, 13(3): 518-532. [16] Labrador M A, Banerjee S. Packet dropping policies for ATM and IP networks[J]. IEEE Communications Surveys, 1999, 2(3): 2-14. [17] Shortle J F, Thompson J M, Gross D, et al. Fundamentals of queueing theory[M]. John Wiley & Sons, 2018. [18] Cidon I, Khamisy A, Sidi M. Analysis of packet loss processes in high-speed networks[J]. IEEE Transactions on Information Theory, 1993, 39(1): 98-108. [19] Zhang Q, Xiao Y, Liu F, et al. Joint optimization of chain placement and request scheduling for network function virtualization[C]//2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS). IEEE, 2017: 731-741. [20] Daigle J, Langford J. Models for analysis of packet voice communications systems[J]. IEEE Journal on selected areas in communications, 1986, 4(6): 847-855. [21] Salvador P, Pacheco A, Valadas R. Modeling IP traffic: joint characterization of packet arrivals and packet sizes using BMAPs[J]. Computer Networks, 2004, 44(3): 335-352. [22] Bolot J C. Characterizing end-to-end packet delay and loss in the internet[J]. Journal of High Speed Networks, 1993, 2(3): 305-323. [23] Wang T, Liu F, Guo J, et al. Dynamic SDN controller assignment in data center networks: Stable matching with transfers[C]//IEEE INFOCOM 2016-The 35th Annual IEEE International Conference on Computer Communications. IEEE, 2016: 1-9. [24] Rasmussen R V, Trick M A. Round robin scheduling–a survey[J]. European Journal of Operational Research, 2008, 188(3): 617-636.

Keywords
NFV, service chain, resource schedule.