检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:姜厚海 庄毅[1] 曹子宁[1] JIANG Hou-hai;ZHUANG Yi;CAO Zi-ning(College of Computer Science and Technology,Nanjing University of Aeronautics and Astronautics,Nanjing 211106,China)
机构地区:[1]南京航空航天大学计算机科学与技术学院,江苏南京211106
出 处:《计算机与现代化》2023年第10期77-83,91,共8页Computer and Modernization
基 金:国家自然科学基金资助项目(61572253)。
摘 要:针对主动式故障恢复方案会忽略备份路径的TCAM存储资源消耗和故障恢复后的拥塞问题,提出一种基于流聚合与拥塞避免的SDN快速故障恢复方案FACAR。FACAR是一种具有拥塞感知、低存储开销的主动式快速故障恢复方案,将通过同一链路的流视作一个或几个聚合流,并为这些聚合流提前配置保护路径。将FACAR方案形式化表示为一个整数线性规划问题,然后提出一种基于贪心的启发式算法ILP-FACAR以求解最少配置备份转发规则的数量。实验结果表明,FACAR可以满足单链路故障后的快速恢复需求,而且相比于其他故障恢复方法,FACAR可以保证在故障恢复后的网络中无链路拥塞问题,且大大减少了备份流规则的TCAM资源消耗。Aiming at the problem that the proactive failure recovery scheme ignores the TCAM storage resource consumption of the backup path and the congestion after failure recovery,this paper proposes an SDN fast failure recovery scheme FACAR based on flow aggregation and congestion avoidance.FACAR is a proactive and fast failure recovery scheme with congestion-aware and low storage overhead.It considers all flows passing through the same link as one or several aggregate flows,and configures protec-tion paths for these aggregate flows in advance.In this paper,FACAR is formalized as an integer linear programming problem,and a greedy-based heuristic algorithm ILP-FACAR is proposed to find the minimum number of configuration backup forwarding rules.Experimental results show that FACAR can meet the needs of the fast recovery after single link failure,and compared with other failure recovery methods,FACAR can ensure that there is no link congestion in the network after failure recovery,and greatly reduce the TCAM resource consumption of backup flow rules.
关 键 词:软件定义网络 单链路故障 快速故障恢复 流聚合 拥塞避免
分 类 号:TP393.2[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.21.55.224