摘要： 在开放式最短路径优先(OSPF)协议网络中，人为指定区域边界路由器(ABR)不能适应网络负荷的动态改变。为此，提出一种依据当前流量需求和链路带宽的动态选举ABR的算法。该算法根据网络流量的改变动态地选择ABR，实现了避免链路拥塞和提高网络性能的目标。NS2仿真结果表明，该算法在端到端时延、丢包率等方面均能获得较好的性能。
关键词:
区域边界路由器,
动态选举,
开放式最短路径优先协议,
自治系统
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.
YANG Zhen-Qi, YANG Yun-Xue. Dynamic Appointment Research of ABR in OSPF Protocol[J]. Computer Engineering, 2011, 37(13): 80-82.