earticle

논문검색

BGP Fast Convergence Based on Message Classification

초록

영어

BGP is currently the most popular inter-domain routing protocol used in the Internet, providing stable and secure interconnection schemes for operators, and has a wealth of routing control mechanisms. BGP chooses its route depending on the attribute information contained in the update messages received from its neighbors. It allows each AS to choose their own routing policy, which may result too long convergence time to make packets lost in the application layer. Purely modifying the MRAI timer may reduce the convergence time at some degree, but may also bring some negative impacts like broadcast storms. In this paper, we proposed a BGP fast convergence mechanism by modifying the timer depending on the message type based on the concept that the bad news travels slowly while the good news travels quickly in the Internet. By simulating our mechanism on the SSFnt, we draw the conclusion that it can greatly reduce the convergence time, as well as reducing the redundant packets to some extent.

목차

Abstract
 1. Introduction
 2. Related Work
 3. Classifying BGP Message Priority
 4. BGP Fast Convergence Algorithm
 5. Simulation
 6. Conclusion
 References

저자정보

  • Wu Xuehui Modern Education Technology Research Center, Tianjin University of Traditional Chinese Medicine, 88 Yuquan Road, Nankai District, Tianjin, P.R. China, 300193

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.