• DocumentCode
    2760120
  • Title

    Traffic Optimization on the Dynamic Switching of ABR for OSPF Networks

  • Author

    Bing, Su ; Haiyang, Yu ; Jieru, Lu ; Zhenghua, Ma

  • Author_Institution
    Dept. of Inf. Sci. & Eng., Jiangsu Polytech. Univ., Changzhou, China
  • Volume
    2
  • fYear
    2009
  • fDate
    25-26 July 2009
  • Firstpage
    429
  • Lastpage
    432
  • Abstract
    Open shortest path first (OSPF) is a dynamic and inter-domain routing protocol with hierarchical architecture used in Internet networks routing. Area border router (ABR) had been proved to be an effective solution to the complicated network and scalability problem. Obviously, manual selection of ABR can not satisfy the dynamic change in the network load. A new scheme, based on the traffic engineering and flow splitting for the procedure of dynamic ABR switching for OSPF networks, is proposed in the paper. By the traffic observation and links weights optimizing algorithm, the OSPF network can obtain good load balancing and network performance improvement.
  • Keywords
    Internet; optimisation; routing protocols; telecommunication switching; telecommunication traffic; ABR; Internet network routing; OSPF network; area border router; dynamic switching; interdomain routing protocol; network load; open shortest path first; scalability problem; traffic optimization; Cities and towns; Computer science; IP networks; Information science; Information technology; Network topology; Routing protocols; Scalability; Spine; Telecommunication traffic; ABR; OSPF; Routing; Traffic optimization;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Technology and Computer Science, 2009. ITCS 2009. International Conference on
  • Conference_Location
    Kiev
  • Print_ISBN
    978-0-7695-3688-0
  • Type

    conf

  • DOI
    10.1109/ITCS.2009.226
  • Filename
    5190271