电子学报 ›› 2018, Vol. 46 ›› Issue (10): 2341-2346.DOI: 10.3969/j.issn.0372-2112.2018.10.005

• 学术论文 • 上一篇    下一篇

软件定义网络一致性协同更新算法

于倡和, 兰巨龙, 胡宇翔   

  1. 国家数字交换系统工程技术研究中心, 河南郑州 450002
  • 收稿日期:2017-11-20 修回日期:2018-06-02 出版日期:2018-10-25 发布日期:2018-10-25
  • 作者简介:于倡和,男,1993年10月出生,山东青岛人,2016年毕业于上海交通大学,现国家数字交换系统工程技术研究中心在读硕士,主要研究方向为新型网络体系结构与网络安全.E-mail:Yu_Changhe@hotmail.com;兰巨龙,男,1962年出生,河北张北人,国家数字交换系统工程技术研究中心教授,博士生导师,主要研究方向为新型网络体系结构与网络安全.
  • 基金资助:
    国家自然科学基金(No.61502530);国家863高技术研究发展计划(No.2015AA016102)

Synergetic Consistent Update Algorithm for SDN Networks

YU Chang-he, LAN Ju-long, HU Yu-xiang   

  1. National Digital Switching System Engineering & Technological Research Center, Zhengzhou, Henan 450002, China
  • Received:2017-11-20 Revised:2018-06-02 Online:2018-10-25 Published:2018-10-25

摘要: 为实现软件定义网络的一致性更新,本文提出一种协同利用分段路由、顺序更新、两步复制三种机制的更新算法.算法首先启用分段路由机制,尝试用现有路径规则拼接待更新数据流的最终路径,并根据最终路径是否能由现有规则拼接,将数据流分为可拼接与不可拼接两种.对于可拼接流,分段路由可将最终路径信息封装入数据包包头,使得数据包能立即沿最终路径转发.对于不可拼接流,算法计算最长一致性更新序列,并按照此序列依次更新节点,最后利用两步复制机制来完成剩余未更新节点的更新.并且经实验验证,算法比之前研究提出的算法不仅消耗更少的三态内容寻址存储器的空间资源,并且有更好的适用性与稳定性.

关键词: 一致性更新, 分段路由, OpenFlow

Abstract: To achieve consistent update in software defined network,a consistent update algorithm which combines segment routing,two-phase commit and node scheduling mechanism is proposed in this work.The algorithm first leverages segment routing mechanism,which attempts to splice the final path with existing paths.According to whether the final path can be spliced by the existing paths,the algorithm divides flows into either segmentable flows or flows that are not segmentable.For the segmentable flow,segment routing mechanism can encapsulate the final path information into the packet header so that packets can be forwarded immediately along the final path.For the flows not segmentable,the algorithm calculates the longest consistent update sequences for them,and updates nodes in accordance with these sequences.Finally,the algorithm uses the two-phase commit mechanism to complete the update of the remaining nodes.We verified its performance by experiments and the outcome illustrates that our algorithm not only requires less additional ternary content addressable memory resources but also has better performance stability and applicability than prior techniques.

Key words: consistent update, segment routing, OpenFlow

中图分类号: