Pipeline processing is applied to multiple 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 difference gets more significant as the flow arrival rate increases.

中文翻译：

---

PopFlow：一种基于流流行度的用于多个流表的SDN交换的新颖流管理方案

管道处理应用于软件定义网络（SDN）交换机中的多个流表（MFT），以提高流的吞吐量。但是，随着流表的大小或数量变大，每个流的处理时间会增加。在本文中，我们提出了一种称为PopFlow的新颖方法，该方法将保持流行流条目的表放置在管道中的最前面，并为与该表匹配的流提供了一条快速路径。考虑匹配时延和匹配频率，采用马尔可夫模型进行热门条目的选择，并使用排队论模型对现有基于MFT的方案和提出的方案的流处理时间进行建模。计算机仿真表明，与现有方案相比，该方案大大减少了流程处理时间，