Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Computer Communicati...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Computer Communications
Article . 2008 . Peer-reviewed
License: Elsevier TDM
Data sources: Crossref
DBLP
Article . 2008
Data sources: DBLP
versions View all 2 versions
addClaim

Dynamic appointment of ABR for the OSPF routing protocol

Authors: Wei Kuang Lai; Chen-Da Tsai; Chin-Shiuh Shieh;

Dynamic appointment of ABR for the OSPF routing protocol

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.

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    3
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
3
Average
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!