A Routing Optimization Algorithm for BGP Egress Selection

  • Yaping Liu
  • Zhenghu Gong
  • Baosheng Wang
  • Jinshu Shu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4317)

Abstract

BGP optimal egress selection is one of a recent trend in routing research. Current hot-potato routing has the problem of routing instability. This paper provides a new algorithm named BGP-RO-ES to minimize hot-potato disruptions while satisfying multiple constraints of different metrics, such as traffic engineering, the cost of traffic across the network and the cost of maintaining lightweight tunnels. The algorithm can be adaptive to different link failures and can be implemented in current BGP routers with a little change. Simulation results show that the control stability of BGP-RO-ES can be very close to that of TIE algorithm and that of RTF_TIE algorithm spending only half of the cost of maintaining lightweight tunnels.

Keywords

BGP hot-potato routing interdomain traffic engineering 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Yaping Liu
    • 1
  • Zhenghu Gong
    • 1
  • Baosheng Wang
    • 1
  • Jinshu Shu
    • 1
  1. 1.School of ComputerNational University of Defense Technology, ChangshaHunanChina

Personalised recommendations