基于多向搜索的SDN流表更新一致性方案  

Multi-Directional Searching Based Consistent Flow Updating Scheme in Software Defined Networking

作　　者：刘江[1,2] 胡晓露[1,2] 黄韬[1,2] 刘韵洁[1,2] LIU Jiang HU Xiao-lu HUANG Tao LIU Yun-jie(Beijing Laboratory of Advanced Information Networks, Beijing University of Posts and Telecommunications, Beijing 100876, China Beijing Advanced Innovation Center for Future Internet Technology, Beijing 100124, China)

机构地区：[1]北京邮电大学先进信息网络北京实验室,北京100876 [2]北京未来网络科技高精尖创新中心,北京100124

出　　处：《北京邮电大学学报》2016年第3期54-59,共6页Journal of Beijing University of Posts and Telecommunications

基　　金：国家自然科学基金项目(61302089);国家高技术研究发展计划(863计划)项目(2015AA016101;2015AA015702);北京市科技新星项目(Z151100000315078)

摘　　要：流表更新的无环一致性最优化方案的计算复杂度高,而反向、双向更新方案的计算复杂度低,依赖链长度难以得到有效的优化,为此提出了基于多向搜索的流表更新一致性方案.引入逻辑证明验证了该方案具有无环一致性.仿真结果显示,该方案具有接近最优化方案的依赖链长度,并且计算复杂度得到了显著优化.The flow table updating with loop-free consistence is one of the most important issues in software defined networking（ SDN）,in which,the optimal scheme has high computing complexity,while the single / double directional updating schemes have low computing complexity,however,the length of dependency chain is difficult to be optimized. The article presents a consistent flow update scheme based on multi-directional searching. The scheme was proved loop-free consistent. Simulation shows that the scheme shortens the length of dependency chain,closes to the optimal scheme and effectively reduces the working load on controller.

关 键 词：软件定义网络 流表更新 无环 一致性 

分 类 号：TP393.0[自动化与计算机技术—计算机应用技术]