检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:赵锋[1] 卢锡城[1] 朱培栋[1] 刘亚萍[1]
机构地区:[1]国防科学技术大学计算机学院,长沙410073
出 处:《计算机研究与发展》2007年第3期369-377,共9页Journal of Computer Research and Development
基 金:国家"九七三"重点基础研究发展规划基金项目(2003CB314802);国家"八六三"高技术研究发展计划基金项目(2005AA121570)
摘 要:研究IBGP路由反射网络的健壮性问题.分析了IGP路由恢复时间对IBGP会话的影响,提出一种新的基于IGP路由恢复时间概率分布的IBGP会话故障概率计算方法.分析了已有的各种IBGP网络设计测度,提出一种新的测度:流量敏感度.基于该测度定义了路由反射器可冗余及会话约束的IBGP拓扑设计问题,讨论了路由反射器冗余度和流量敏感度的关系,给出该问题的优化下界.对每一个簇内都有一个冗余路由反射器的拓扑设计问题给出可解条件,证明其是一个NP难问题.This paper focuses on the design of robust IBGP route reflection networks, which are very important to the reliability and stability of Internet. A new approach is proposed to calculate the failure probability of IBGP sessions based on the probability distribution of IGP routing recovery time. To measure the robustness of IBGP, a new metric: TS (traffic sensitivity) is presented. Based on this metric, the optimization problem of finding the most robust IBGP route reflection topologies is investigated, in which a cluster is allowed to have one or more redundant route reflectors and the maximum number of IBGP sessions a router can have is limited. The relationship between the route reflectors redundancy and the robustness is discussed, and the lower bound of this problem optimization is given. And for a special case that there is a redundant route reflector within each cluster, the solvability conditions for the problem are given and it is shown that the problem in general is NP-hard.
分 类 号:TP393.02[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.117.196.112