A routing optimization algorithm for BGP egress selection

Authors:
Yaping Liu;Zhenghu Gong;Baosheng Wang;Jinshu Shu
Affiliations:
School of Computer, National University of Defense Technology, Changsha, Hunan, China;School of Computer, National University of Defense Technology, Changsha, Hunan, China;School of Computer, National University of Defense Technology, Changsha, Hunan, China;School of Computer, National University of Defense Technology, Changsha, Hunan, China
Venue:
ICDCIT'06 Proceedings of the Third international conference on Distributed Computing and Internet Technology
Year:
2006

Citing 3
Cited 0

Dynamics of hot-potato routing in IP networks

Proceedings of the joint international conference on Measurement and modeling of computer systems
TIE breaking: tunable interdomain egress selection

CoNEXT '05 Proceedings of the 2005 ACM conference on Emerging network experiment and technology
Feasibility of IP restoration in a tier 1 backbone

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

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.