Dynamic appointment of ABR for the OSPF routing protocol

作者：Lai, Wei Kuang^*; Tsai, Chen-Da; Shieh, Chin-Shiuh

来源：Computer Communications, 2008, 31(14): 3098-3102.

DOI：10.1016/j.comcom.2008.04.011

• dynamic assignment
• ABR
• OSPF

Open shortest path first (OSPF) had been recognized as a de facto standard for inter-domain Internet protocol (IP) routing. Its hierarchical architecture and the introducing of area border router (ABR) had been proved to be an effective solution to the scalability problem. However, manual selection of ABR may fail to accommodate the dynamic change in the network load and therefore lead to sub-optimal solution. In the article, a new scheme is proposed for the dynamic appointment of ABR for OSPF. Based on observed traffic demands and knowledge on link capacities, the proposed scheme will dynamically switch to a new ABR from an old one to avoid incipient link congestion and accompanying performance degradation. In response to traffic change, the proposed approach will locate an adequate AN for the new traffic pattern and then direct traffics to the new ABR. System performance, in terms of link utilization, throughput, and delay, is expected to benefit from the proposed scheme, as demonstrated in the simulation results.

• 出版日期2008-9-5
• 单位中山大学