Dynamic appointment of ABR for the OSPF routing protocol

Authors:
Wei Kuang Lai;Chen-Da Tsai;Chin-Shiuh Shieh
Affiliations:
Department of Computer Science and Engineering, National Sun Yat-Sen University, No. 70, Lian Hai Road, Kaohsiung, Taiwan;Department of Computer Science and Engineering, National Sun Yat-Sen University, No. 70, Lian Hai Road, Kaohsiung, Taiwan and Department of Computer Science and Information Engineering, Far East U ...;Department of Computer Science and Engineering, National Sun Yat-Sen University, No. 70, Lian Hai Road, Kaohsiung, Taiwan and Department of Electronic Engineering, National Kaohsiung University of ...
Venue:
Computer Communications
Year:
2008

Citing 9
Cited 1

Optimal configuration of OSPF aggregates

IEEE/ACM Transactions on Networking (TON)
The Design of OSPF Extension for Handling Unidirectional-Links

SAINT-W '04 Proceedings of the 2004 Symposium on Applications and the Internet-Workshops (SAINT 2004 Workshops)
Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks

IEEE/ACM Transactions on Networking (TON)
Efficient Routing Heuristics for Internet Traffic Engineering

Computer Communications
Network-wide prediction of BGP routes

IEEE/ACM Transactions on Networking (TON)
Traffic engineering with OSPF-TE and RSVP-TE: Flooding reduction techniques and evaluation of processing cost

Computer Communications
Efficient security mechanisms for the border gateway routing protocol

Computer Communications
Design and implementation of a network domain agency for scaleable QoS in the Internet

Computer Communications
Traffic engineering with traditional IP routing protocols

IEEE Communications Magazine

A high performance optimal dynamic routing algorithm with unicast multichannel QoS guarantee in communication systems

The Journal of Supercomputing

Quantified Score

Hi-index	0.25

Visualization

Abstract

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 ABR 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.