ZHU Kai, WU Chunming, ZHOU Boyang, “Scheduling Reconfigurable Service Function Chain,” Chinese Journal of Electronics, vol. 28, no. 6, pp. 1244-1249, 2019, doi: 10.1049/cje.2019.08.011
Citation: ZHU Kai, WU Chunming, ZHOU Boyang, “Scheduling Reconfigurable Service Function Chain,” Chinese Journal of Electronics, vol. 28, no. 6, pp. 1244-1249, 2019, doi: 10.1049/cje.2019.08.011

Scheduling Reconfigurable Service Function Chain

doi: 10.1049/cje.2019.08.011
Funds:  This work is supported by the National Key Research and Development Program of China (No.2018YFB2100404), the Key Research and Development Program of Zhejiang Province (No.2019C01064, No.2018C01008), and Major Scientific Project of Zhejiang Lab (No.2018FD0ZX01).
More Information
  • Corresponding author: WU Chunming (corresponding author) received the Ph.D.degree in computer science from Zhejiang University in 1995.He is currently a professor with the College of Computer Science and Technology,Zhejiang University,where he is also the Associate Director of the Research Institute of Computer System Architecture and Network Security.His research fields include software-defined networks,reconfigurable networks,proactive network defense,network virtualization and intelligent networks.(Email:wuchunming@zju.edu.cn)
  • Received Date: 2018-12-03
  • Rev Recd Date: 2019-11-01
  • Publish Date: 2019-11-10
  • Network function virtualization (NFV), has been widely adopted in existing networks since it brings lower capital expenditure and operating expense, as well as flexible and elastic deployment. Based on NFV, dynamic Service function chain (SFC) provides more comprehensive and thorough traffic steering over a series of middleboxes, e.g., DPI, and IDS. Nevertheless, dynamic SFC involves internal state migration in middleboxes, making it hard to allocate SFC requests. We propose a reconfigurable SFC scheduling approach with consideration on resource constraints and race of the state migration to collaborate the execution of the SFC reconfiguration, in the reasonable fashion based on a heuristic algorithm. The evaluation is conducted through discrete event simulation to validate the efficiency of our reconfigurable SFC scheduling, and the results demonstrate that the proposed method outperforms First Come First Serve scheduling and random scheduling.
  • loading
  • J. Sherry, et al., "Making middleboxes someone else's problem:network processing as a cloud service", ACM SIGCOMM Computer Communication Review, Vol.42, No.4, pp.13-24, 2012.
    V. Paxson, "Bro:a system for detecting network intruders in real-time", Computer networks, Vol.31, No.23-24, pp.2435-2463, 1999.
    C.M. Bowman, et al., "The Harvest information discovery and access system", Computer Networks, Vol.28, No.1-2, pp.119-125, 1995.
    A. Gember-Jacobson, et al., "Opennf:Enabling innovation in network function control", ACM SIGCOMM Computer Communication Review, Vol.44, No.4, pp.163-174, 2014.
    L. Qu, C. Assi and K. Shaban, "Delay-aware scheduling and resource optimization with network function virtualization", IEEE Transactions on Communications, Vol.64, No.9, pp.3746-3758, 2016.
    G. Faraci, et al., "A processor-sharing scheduling strategy for NFV nodes", Journal of Electrical and Computer Engineering, Vol.2016, Article ID 3583962, 10 pages, 2016.
    G. Mirjalily and L. Zhiquan, "Optimal network function virtualization and service function chaining:A survey", Chinese Journal of Electronics, Vol.27, No.4, pp.704-717, 2018.
    H. Moens and F. D. Turck, "VNF-P:A model for efficient place ment of virtualized network functions", Proc. of 10th International Conference on Network and Service Management, Rio de Janeiro, Brazil, pp.418-423, 2014.
    S. Mehraghdam, M. Keller and H. Karl, "Specifying and placing chains of virtual network functions", Proc. of IEEE 3rd International Conference on Cloud Networking, Luxembourg, pp.7-13, 2014.
    M. F. Bari, S. R. Chowdhury, R. Ahmed, R. Boutaba, and O. C. M. B. Duarte, "Orchestration virtualized network functiuons," IEE Transactions on Network & Service Management, Vol.13, No.99, pp.725-739, 2016.
    M. T. Beck and J. F. Botero, "Coordinated allocation of service function chains", Proc. 2015 IEEE Global Communications Conference (GLOBECOM), San Diego, Califonia, USA, pp.1-6, 2015.
    W. Ma, et al., "Traffic aware placement of interdependent nfv middleboxes", Proc. of INFOCOM 2017-IEEE Conference on Computer Communications, Atlanta, USA, pp.1-9, 2017.
    C. Zhuo, F. Gang, L. Bei, Z. Yang, "Delay optimization oriented service function chain migration and re-deployment in operator network," Chinese Journal of Electronics, Vol.46, No.9, pp.2229, 2018.
    A. Gember, et al., "Stratos:Virtual Middleboxes as FirstClass Entities", University of Wisconsin-Madison, Technical Report TR1771, Madison, WI, 2012, pp.1-14, 2013.
    S. Rajagopalan, et al., "Split/Merge:System support for elastic execution in virtual middleboxes", Proc. of the 10th USENIX Symposium on Networked Systems Design and Implementation, Lombard, IL, USA, pp.227-240, 2013.
    P. Zave, et al., "Dynamic service chaining with dysco", Proc. of the Conference of the ACM Special Interest Group on Data Communication, Los Angeles, CA, USA, pp.57-70, 2017.
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (434) PDF downloads(152) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return