摘要
Pipeline processing is applied to mutiple flow tables(MFT)in the switch of software-defined network(SDN)to increase the throughput of the flows.However,the processing time of each flow increases as the size or number of flow tables gets larger.In this paper we propose a novel approach called PopFlow where a table keeping popular flow entries is located up front in the pipeline,and an express path is provided for the flow matching the table.A Markov model is employed for the selection of popular entries considering the match latency and match frequency,and Queuing theory is used to model the flow processing time of the existing MFT-based schemes and the proposed scheme.Computer simulation reveals that the proposed scheme substantially reduces the flow processing time compared to the existing schemes,and the diference gets more significant as the flow arrival rate increases.
基金
supported by Institute for In-fornation&communications Technology Promotion(ITP)grant funded by the Korea government(MSIT)(2016-0-00133,Research on Edge computing via collctive intelligence of hyperconnection IoT nodes)
Korea,under the National Program for Excellence in Sw supervised by the ITP(Institute for Information&communications Technology Promotion)(2015-0-00914)
Basic Science Research Program through the National Research Foundation of Korea(NRF)funded by the Ministry of Education,Science and Technology(2016R1A6A3A11931385,Research of key technologies based on software defined wireless sensor network for realtime public safety service,2017R1A2B2009095,Research on SDN-based WSN Supporting Real-time Stream Data Processing and Multi-connectivity,2019R1I1A1A01058780,Eficient Management of SDN-based Wireless Sensor Network Using Machine Learning Technique),the second Brain Korea 21 PLUS project.
