An Efficiency Pipeline Processing Approach for OpenFlow Switch

2016 IEEE 41st Conference on Local Computer Networks (LCN) Pub Date : 2016-11-01 DOI:10.1109/LCN.2016.43

Zhenwei Wu, Yong Jiang, Shu Yang

引用次数: 6

Abstract

One primary component of OpenFlow switches is a pipeline of flow tables. Flows are directed through the pipeline by looking up a matched rule in each table. Sequentially, Packet matching starts at table 0 and continues to additional tables of the pipeline if necessary. The lookup stops when one flow entry is matched or the end of pipeline is reached. Though effective, this manner of processing is not efficient when popular rules are installed in back tables. If frequently matched rules appear earlier in the pipeline, the procedure of lookup and comparison can be improved. Unfortunately, a simple sorting algorithm is not feasible. In this paper, we formalize the problem of reducing lookup times, which is proven to be NP-hard. A heuristic approach, MILE(migrating flow rules), is proposed to minimize the average number of lookups. Experimental results show that MILE is able to reduce table lookups by 50%.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

OpenFlow开关的高效流水线处理方法

OpenFlow交换机的一个主要组件是流表管道。通过在每个表中查找匹配的规则来引导流通过管道。按顺序，数据包匹配从表0开始，并在必要时继续到管道的其他表。当匹配到一个流条目或到达管道末端时，查找停止。虽然这种处理方式是有效的，但是当流行规则安装在后表中时，这种处理方式就不那么有效了。如果频繁匹配的规则较早地出现在管道中，则可以改进查找和比较过程。不幸的是，简单的排序算法是不可行的。在本文中，我们形式化了减少查找时间的问题，该问题被证明是np困难的。提出了一种启发式方法，MILE(迁移流规则)，以最小化平均查找次数。实验结果表明，MILE能够减少50%的表查找。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

2016 IEEE 41st Conference on Local Computer Networks (LCN)

自引率

0.00%

发文量

期刊最新文献

Message from the General Chair Message from the general chair Best of Both Worlds: Prioritizing Network Coding without Increased Space Complexity Controlling Network Latency in Mixed Hadoop Clusters: Do We Need Active Queue Management? TransFetch: A Viewing Behavior Driven Video Distribution Framework in Public Transport