基于预测缓存的OpenFlow虚拟流表高效查找方法

doi:10.19678/j.issn.1000-3428.0050067

计算机工程 ›› 2019, Vol. 45 ›› Issue (5): 52-58. doi: 10.19678/j.issn.1000-3428.0050067

基于预测缓存的OpenFlow虚拟流表高效查找方法

傅明^a,b,何洋^a,熊兵^a,b

长沙理工大学 a.计算机与通信工程学院; b.综合交通运输大数据智能处理湖南省重点实验室,长沙 410114

收稿日期:2018-01-11 出版日期:2019-05-15 发布日期:2019-05-15
作者简介:傅明(1963—),男,教授、博士,主研方向为未来网络、软件定义网络;何洋,硕士研究生;熊兵,副教授、博士。
基金资助:
国家自然科学基金(61502056);湖南省自然科学基金(2015JJ3010);湖南省教育厅科研项目(15B009);湖南省研究生科研创新项目(CX2017B487)。

Efficient lookup method of OpenFlow table based on predictive caching

FU Ming ^a,b,HE Yang ^a,XIONG Bing ^a,b

长沙理工大学 a.计算机与通信工程学院; b.综合交通运输大数据智能处理湖南省重点实验室,长沙 410114

Received:2018-01-11 Online:2019-05-15 Published:2019-05-15

摘要/Abstract

摘要：

OpenFlow支持通配符查找,会造成严重的流表查找性能瓶颈。为此,基于网络流量局部性,提出一种OpenFlow虚拟流表查找方法。通过缓存在数据包流中近期频繁出现的连接和对应的掩码,对大部分数据包直接定位其掩码,进而查找流表,无需逐个探测掩码数组。理论分析和实验结果表明,相比于目前主流虚拟交换机中的流表查找方法OFT-OVS,该方法的平均查找长度较小,可有效提升OpenFlow虚拟交换机的数据转发性能。

关键词: 网络虚拟化, OpenFlow网络, 虚拟交换机, 预测缓存, 流表查找

Abstract:

There are serious performance bottlenecks of flow table lookups as OpenFlow supports wildcard search.Therefore,a lookup method of OpenFlow table is proposed based on network traffic locality.By caching recent frequent connections in packet traffic and the corresponding masks,the method directly locates the masks of most of the packets,and then runs flow table lookup without probing mask array one by one.Theoretical analysis and experimental results show that the average lookup length of the proposed method is significantly smaller than that of OFT-OVS method used in the current mainstream virtual switches,which effectively improves data forwarding performance of OpenFlow virtual switches.

Key words: network virtualization, OpenFlow network, virtual switch, predictive caching, flow table lookup

中图分类号:

TP393

傅明,何洋,熊兵. 基于预测缓存的OpenFlow虚拟流表高效查找方法[J]. 计算机工程, 2019, 45(5): 52-58.

FU Ming,HE Yang,XIONG Bing. Efficient lookup method of OpenFlow table based on predictive caching[J]. Computer Engineering, 2019, 45(5): 52-58.

https://www.ecice06.com/CN/Y2019/V45/I5/52

参考文献

［1］LI Shengzhao,HAO Qinfen,XIAO Limin,et al.Optimizing network virtualization in kernel-based virtual machine［C］//Proceedings of 2009 IEEE International Conference on Information Science and Engineering.Washington D.C.,USA:IEEE Press,2009:282-285.
［2］LEE S S W,LI Kuangyi,WU Mingshu.Design and implementation of a GPON-based virtual OpenFlow-enabled SDN switch［J］.Journal of Lightwave Technology,2016,34(10):2552-2561.
［3］MATSUMOTO N,HAYASHI M.Performance improvement of flow switching with automatic maintenance of hash table assisted by wildcard flow entries［C］//Proceedings of the 10th International Conference on Optical Internet.Washington D.C.,USA:IEEE Press,2012:12-13.
［4］MATSUMOTO N,HAYASHI M.LightFlow:speeding up GPU-based flow switching and facilitating maintenance of flow table［C］//Proceedings of 2012 IEEE International Conference on High Performance Switching and Routing.Washington D.C.,USA:IEEE Press,2012:76-81.
［5］CHO C H,LEE J B,RYOO J D.A collision-mitigation hashing scheme utilizing empty slots of cuckoo hash table［C］//Proceedings of the 19th International Conference on Advanced Communication Technology.Washington D.C.,USA:IEEE Press,2017:514-517.
［6］CARLI L D,PAN Yi,KUMAR A,et al.Flexible lookup modules for rapid deployment of new protocols in high-speed routers［C］//Proceedings of 2009 ACM SIGCOMM Conference on Data Communication.New York,USA:ACM Press,2009,39(4):207-218.
［7］SUN Hai,SUN Yan,VALGENTI V C,et al.OpenFlow accelerator:a decomposition-based hashing approach for flow processing［C］//Proceedings of the 24th International Conference on Computer Communication and Networks.Washington D.C.,USA:IEEE Press,2015:1-10.
［8］毛健彪,卞洪飞,韩彪,等.PiBuffer:面向数据中心的OpenFlow流缓存管理模型［J］.计算机学报,2016,39(6):1092-1104.
［9］LEE B S,KANAGAVELU R,AUNG K M M.An efficient flow cache algorithm with improved fairness in software-defined data center networks［C］//Proceedings of 2013 IEEE International Conference on Cloud Networking.Washington D.C.,USA:IEEE Press,2013:18-24.
［10］CONGDON P T,MOHAPATRA P,FARRENS M,et al.Simultaneously reducing latency and power consumption in OpenFlow switches［J］.IEEE/ACM Transactions on Networking,2014,22(3):1007-1020.
［11］PFAFF B,PETTIT J,KOPONEN T,et al.The design and implementation of Open vSwitch［C］//Proceedings of the 12th USENIX Conference on Networked Systems Design and Implementation.Oakland,USA:［s.n.］,2015:117-130.
［12］KIZHEPAT G,TENG M H,CHOY K Y Y.Switching systems and methods using wildcard searching:US 7774374B1［P］.2010-08-10.
［13］Sandvine.2014 global internet phenomena report［R/OL］.［2017-12-15］.https://www.sandvine.com/downloads/general/global-internet-phenomena/2014/2h-2014-global-internet-phenomena-report.pdf.
［14］PAN Tian,GUO Xiaoyu,ZHANG Chenhui,et al.Tracking millions of flows in high speed networks for application identification［C］//Proceedings of 2012 IEEE International Conference on Computer Communications.Washington D.C.,USA:IEEE Press,2012:1647-1655.
［15］王鹏,张良,周舟,等.一种高并发网络环境下快速流表查找方法［J］.电子学报,2017,45(4):974-981.
［16］江苏省计算机网络技术中心.IP trace and service［EB/OL］.［2017-12-15］.http://iptas.edu.cn/src/system.php.
［17］姜腊林,胡念,熊兵.基于MTF启发法的OpenFlow虚拟流表高效查找算法［J］.小型微型计算机系统,2017,38(7):1533-1537.

[1]	李铮, 丁升, 王潇潇, 刘期烈. 无线虚拟网络中的邻近节点分组映射算法[J]. 计算机工程, 2020, 46(8): 178-183.
[2]	赵季红, 吴豆豆, 曲桦, 季文君. 面向物联网的能耗感知虚拟网络映射算法[J]. 计算机工程, 2020, 46(5): 19-25,33.
[3]	苑乐天,李国峰. 基于业务优先级划分的虚拟网可靠性映射算法[J]. 计算机工程, 2019, 45(2): 76-81.
[4]	李振涛,孟相如,赵志远,苏玉泽. 基于节点抗毁能力感知的虚拟网络可靠映射算法[J]. 计算机工程, 2017, 43(9): 62-67.
[5]	秦华,阎钢. 基于OpenFlow网络的数据中心服务器负载均衡策略[J]. 计算机工程, 2016, 42(3): 130-137.
[6]	赵思逸,陈靖,龚水清. 基于粒子群优化的虚拟SDN网络映射算法[J]. 计算机工程, 2016, 42(12): 84-90.
[7]	孙名松;唐亮;周红敏. P2P点播系统的客户端磁盘缓存策略[J]. 计算机工程, 2008, 34(20): 71-73.

选择文件类型/文献管理软件名称

选择包含的内容

基于预测缓存的OpenFlow虚拟流表高效查找方法

Efficient lookup method of OpenFlow table based on predictive caching

PDF

可视化

被引次数

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 7

编辑推荐

Metrics

本文评价

模态框（Modal）标题

选择文件类型/文献管理软件名称

选择包含的内容

基于预测缓存的OpenFlow虚拟流表高效查找方法

Efficient lookup method of OpenFlow table based on predictive caching

PDF

可视化

被引次数

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 7

编辑推荐

Metrics

本文评价