ISSN 1000-1239 CN 11-1777/TP

计算机研究与发展 ›› 2018, Vol. 55 ›› Issue (4): 729-737.doi: 10.7544/issn1000-1239.2018.20170946

所属专题: 2018网络功能虚拟化专题

• 网络技术 • 上一篇    下一篇

基于虚拟拓扑的多级可信传输体系及路由计算

陈文龙1,赵一荣1,肖融2,唐晓岚1,徐恪3   

  1. 1(首都师范大学信息工程学院 北京 100048); 2(北京师范大学信息科学与技术学院 北京 100875); 3(清华大学计算机科学与技术系 北京 100084) (chenwenlong@cnu.edu.cn)
  • 出版日期: 2018-04-01
  • 基金资助: 
    国家自然科学基金项目(61373161,61502320);北京市教委科技计划项目(KM201810028017)

Packets Transmission with Multiple Levels of Credibility and Routing Calculation Based on Virtual Topologies

Chen Wenlong1, Zhao Yirong1, Xiao Rong2, Tang Xiaolan1, Xu Ke3   

  1. 1(Information Engineering College, Capital Normal University, Beijing 100048); 2(College of Information Science and Technology, Beijing Normal University, Beijing 100875); 3(Department of Computer Science and Technology, Tsinghua University, Beijing 100084)
  • Online: 2018-04-01

摘要: 路由器及转发路径的安全可信一直备受关注.不同厂商的网络设备或处于不同管理环境中的同一款网络设备,都具有不同的安全可信度.人们期望为不同安全需求的流量提供相应可信级别的转发路径,实现网络数据的可信传输.设计了多级可信传输机制(credible transmission with multiple levels, CETML),提出了基本的可信管理策略.所有路由节点和IP前缀都被指定可信级别,网络流量也基于源、目的IP被设置可信级别.CETML为不同可信级别的传输网络构建虚拟拓扑,确保网络中的报文必须通过不小于其可信级别的路由器进行转发.路由器转发项要包含多个下一跳信息,会引入极少量的存储开销.面向SDN网络环境,分析多级虚拟拓扑的关联,基于Floyd算法思想设计了可依次迭代的多关联拓扑路由计算方法,计算时间相对典型的路由算法显著降低.

关键词: 虚拟拓扑, 多级可信, 路由, 迭代矩阵, 软件定义网络

Abstract: The credibility of routers and forwarding paths in the Internet has been a popular topic. Not only network equipment of different vendors, but also the same one in different management environments has different credibility. The network flows with diverse credibility requirements are supposed to be transmitted along paths with the corresponding credibility levels (CR). In this paper, the credible transmission mechanism with multiple levels (CETML) is proposed, and the fundamental credible management strategies are suggested. Both routers and IP prefixes are associated with a CR, and the CR of a network flow is obtained according to its source and destination IP addresses. CETML constructs different virtual topologies for every transmission network with different CR, and insures that IP packets is forwarded by the routers whose CR is not less than the CR of these packets. Because the forwarding entries include multiple next hops, a small quantity of additional memory overhead is introduced in CETML. Analyzing the relevancy of the multi-level virtual topologies, we design a new routing calculating method based on Floyd algorithm in SDN environment. All the routing tables of virtual topologies can be achieved during the process of successive iterating calculation. Compared with current typical routing algorithms, the calculation time of CETML is significantly reduced.

Key words: virtual topologies, multiple levels credibility, routing, iterative matrix, software defined networking (SDN)

中图分类号: