Advertisement

A Single-Hop Selection Strategy of VNFs Based on Traffic Classification in NFV

  • Bo HeEmail author
  • Jingyu Wang
  • Qi Qi
  • Haifeng Sun
Conference paper
Part of the Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering book series (LNICST, volume 268)

Abstract

Network Function Virtualization (NFV) has become a hot technology since it provides the flexible management of network functions and efficient sharing of network resources. Network resources in NVF require an appropriate management strategy which often manifests as a difficult online decision making task. Resource management in NFV can be thought of as a process of virtualized network functions (VNFs) selection or deployment. This paper proposes a single-hop VNFs selection strategy to realize network resource management. For satisfying quality requirements of different network services, this strategy is based on the results of traffic classification which utilizes Multi-Grained Cascade Forest (gcForest) to distinguish user behaviors on the internet. In the order of VNFs, a network is divided into several layers where each arrived packet needs to queue. The scheduler of each layer selects a layer which hosts the next VNF for the packets in the queue. Experiments prove that the proposed traffic classification method increases the precision by 7.7% and improves the real-time performance. The model of VNFs selection reduces network congestion compared to traditional single-hop scheduling models. Moreover, the number of packets which fail to reach target node in time drops 30% to 50% using the proposed strategy compared to the strategy without the section of traffic classification.

Keywords

NFV Traffic classification Resource management VNFs selection 

Notes

Acknowledgment

This work was jointly supported by: (1) National Natural Science Foundation of China (No. 61771068, 61671079, 61471063, 61372120, 61421061); (2) Beijing Municipal Natural Science Foundation (No. 4182041, 4152039); (3) the National Basic Research Program of China (No. 2013CB329102).

References

  1. 1.
    Sun, C., Bi, J., Zheng, Z., et al.: NFP: enabling network function parallelism in NFV. In: Proceedings of the Conference of the ACM Special Interest Group on Data Communication, pp. 43–56. ACM (2017)Google Scholar
  2. 2.
    Taleb, T., Ksentini, A., Sericola, B.: On service resilience in cloud-native 5G mobile systems. IEEE J. Sel. Areas Commun. 34(3), 483–496 (2016)CrossRefGoogle Scholar
  3. 3.
    Chantre, H.D., da Fonseca, N.L.S.: Redundant placement of virtualized network functions for LTE evolved Multimedia Broadcast Multicast Services. In: 2017 IEEE International Conference on Communications, ICC 2017, pp. 1–7. IEEE (2017)Google Scholar
  4. 4.
    Williams, N., Zander, S., Armitage, G.: A preliminary performance comparison of five machine learning algorithms for practical IP traffic flow classification. ACM SIGCOMM Comput. Commun. Rev. 36, 5–16 (2006)CrossRefGoogle Scholar
  5. 5.
    Dong, Y.N., Zhao, J.J., Jin, J.: Novel feature selection and classification of internet video traffic based on a hierarchical scheme. Comput. Netw. 119, 102–111 (2017)CrossRefGoogle Scholar
  6. 6.
    Lopez-Martin, M., Carro, B., Sanchez-Esguevillas, A., et al.: Network traffic classifier with convolutional and recurrent neural networks for Internet of Things. IEEE Access 5(99), 18042–18050 (2017)CrossRefGoogle Scholar
  7. 7.
    Bernaille, L., Teixeira, R., Akodkenou, I., et al.: Traffic classification on the fly. ACM SIGCOMM Comput. Commun. Rev. 36(2), 23–26 (2006)CrossRefGoogle Scholar
  8. 8.
    Shi, H., Li, H., Zhang, D., et al.: Efficient and robust feature extraction and selection for traffic classification. Comput. Netw. Int. J. Comput. Telecommun. Netw. 119(C), 1–16 (2017)Google Scholar
  9. 9.
    Zhou, Z.H., Feng, J.: Deep forest: towards an alternative to deep neural networks. In: International Joint Conference on Artificial Intelligence, pp. 3553–3559 (2017)Google Scholar
  10. 10.
    Lashkari, A.H., Gil, G.D., Mamun, M.S.I., et al.: Characterization of tor traffic using time based features. In: International Conference on Information Systems Security and Privacy, pp. 253–262 (2017)Google Scholar
  11. 11.
    Anderson, B., Mcgrew, D.: Machine learning for encrypted malware traffic classification: accounting for noisy labels and non-stationarity. In: The ACM SIGKDD International Conference, pp. 1723–1732. ACM (2017)Google Scholar
  12. 12.
    Shi, H., Li, H., Zhang, D., et al.: An efficient feature generation approach based on deep learning and feature selection techniques for traffic classification. Comput. Netw. 132, 81–98 (2018)CrossRefGoogle Scholar
  13. 13.
    Tseng, C.C., Wang, H.C., Kuo, F.C., et al.: Delay and power consumption in LTE/LTE-A DRX mechanism with mixed short and long cycles. IEEE Trans. Veh. Technol. 65(3), 1721–1734 (2016)CrossRefGoogle Scholar
  14. 14.
    Joe, I., Kim, W.T., Hong, S.: A network selection algorithm considering power consumption in hybrid wireless networks. IEICE Trans. Commun. 91(1), 1240–1243 (2007)Google Scholar
  15. 15.
    Senouci, M.A., Mushtaq, M.S., Hoceini, S., et al.: TOPSIS-based dynamic approach for mobile network interface selection. Comput. Netw. 107(2), 304–314 (2016)CrossRefGoogle Scholar
  16. 16.
    Park, H., van der Schaar, M.: Bargaining strategies for networked multimedia resource management. IEEE Trans. Signal Process. 55(7), 3496–3511 (2007)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Afzal, B., Alvi, S.A., Shah, G.A., et al.: Energy efficient context aware traffic scheduling for IoT applications. Ad Hoc Netw. 62, 101–115 (2017)CrossRefGoogle Scholar
  18. 18.
    Lukovszki, T., Schmid, S.: Online admission control and embedding of service chains. In: Scheideler, C. (ed.) Structural Information and Communication Complexity. LNCS, vol. 9439, pp. 104–118. Springer, Cham (2015).  https://doi.org/10.1007/978-3-319-25258-2_8CrossRefzbMATHGoogle Scholar
  19. 19.
    Jia, M., Liang, W., Huang, M., et al.: Throughput maximization of NFV-enabled unicasting in software-defined networks. In: 2017 IEEE Global Communications Conference, GLOBECOM 2017, pp. 1–6. IEEE (2017)Google Scholar
  20. 20.
    Mestres, A., Rodrigueznatal, A., Carner, J., et al.: Knowledge-defined networking. ACM SIGCOMM Comput. Commun. Rev. 47(3), 2–10 (2016)CrossRefGoogle Scholar
  21. 21.
    Kar, B., Wu, H.K., Lin, Y.D.: Energy cost optimization in dynamic placement of virtualized network function chains. IEEE Trans. Netw. Serv. Manag. PP(99), 1 (2017)Google Scholar
  22. 22.
    Gu, L., Tao, S., Zeng, D., et al.: Communication cost efficient virtualized network function placement for big data processing. In: Computer Communications Workshops, pp. 604–609. IEEE (2016)Google Scholar
  23. 23.
    Breiman, L.: Random forest. Mach. Learn. 45, 5–32 (2001)CrossRefGoogle Scholar
  24. 24.
    Lee, J., et al.: A real-time message scheduling scheme based on optimal earliest deadline first policy for dual channel wireless networks. In: Sha, E., Han, S.-K., Xu, C.-Z., Kim, M.-H., Yang, L.T., Xiao, B. (eds.) EUC 2006. LNCS, vol. 4096, pp. 264–273. Springer, Heidelberg (2006).  https://doi.org/10.1007/11802167_28CrossRefGoogle Scholar
  25. 25.
    Li, H., Shenoy, P., Ramamritham, K.: Scheduling messages with deadlines in multi-hop real-time sensor networks. In: IEEE Real Time on Embedded Technology and Applications Symposium. pp. 415–425. IEEE Computer Society (2005)Google Scholar

Copyright information

© ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2019

Authors and Affiliations

  1. 1.State Key Laboratory of Networking and Switching TechnologyBeijing University of Posts and TelecommunicationsBeijingChina

Personalised recommendations