计算机工程2011，Vol.37Issue(13)：80-82,3.DOI:10.3969/j.issn.1000-3428.2011.13.025
OSPF协议中ABR动态选举研究
Dynamic Appointment Research of ABR in OSPF Protocol
摘要
Abstract
Aiming at the problem of manual selection of Area Border Router(ABR) can not satisfy the dynamic change in the network load in Open Shortest Path First(OSPF) protocol. This paper proposes a new algorithm of the dynamic appointment of ABR for OSPF. Based on observed traffic demands and knowledge on link capacities, the proposed algorithm locates an adequate ABR for the new traffic pattern to avoid incipient link congestion and accompanying performance degradation. NS2 simulation results show that the proposed algorithm gets a better performance at parameters such as end-to-end delay and packet loss rate.关键词
区域边界路由器/动态选举/开放式最短路径优先协议/自治系统Key words
Area Border Router(ABR)/ dynamic appointment/ Open Shortest Path First(OSPF) protocol/ Autonomous System(AS)分类
信息技术与安全科学引用本文复制引用
杨振启,杨云雪..OSPF协议中ABR动态选举研究[J].计算机工程,2011,37(13):80-82,3.基金项目
南京信息工程大学校科研基金资助项目(20080259) （20080259）
