Abstract
In today’s BGP routing architecture, traffic delivery is in general based on single path selection paradigms. The lack of path diversity hinders the support for resilience, traffic engineering and QoS provisioning across the Internet. Some recently proposed multi-plane extensions to BGP offer a promising mechanism to enable diverse inter-domain routes towards destination prefixes. Based on these enhanced BGP protocols, we propose in this paper a novel technique to enable controlled fast egress router switching for handling network failures. In order to minimize the disruptions to real-time services caused by the failures, backup egress routers can be immediately activated through locally remarking affected traffic towards alternative routing planes without waiting for IGP routing re-convergence. According to our evaluation results, the proposed multi-plane based egress router selection algorithm is able to provide both high path diversity and balanced load distribution across inter-domain links with a small number of planes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Awduche, D., et al.: Overview and Principles Of Internet Traffic Engineering, Request for Comments 3272, Network Working Group (May 2002)
Bressoud, T.C., et al.: Optimal Configuration for BGP Route Selection. In: IEEE INFOCOM (2003)
Bonaventure, O.: Achieving Sub-50 Milliseconds Recovery upon BGP Peering Link Failures. IEEE/ACM Transactions on Networking 15(5) (October 2007)
Kvalbein, A., et al.: Fast IP Network Recovery using Multiple Routing Configurations. In: Proc. IEEE INFOCOM 2006 (2006)
Shand, M., et al.: IP Fast Reroute with Notvia Addresses, IETF Internet draft, work in progress (February 2008)
Atlas, A.: Basic Specification for IP Fast-Reroute: Loop-free Alternates., IETF Internet draft, work in progress (2008)
Teixeira, R., et al.: Network Sensitivity to Hot-Potato Disruptions. In: Proc. ACM SIGCOMM, pp. 231–244 (2004)
Quoitin, B., et al.: Interdomain traffic engineering with BGP. IEEE Communications Magazine 41(5), 122–128 (2003)
Amin, M., et al.: Making Outbound Route Selection Robust to Egress Point Failure. In: Proc. IFIP Networking (May 2006)
Psenak, P., et al.: Multi-Topology (MT) Routing in OSPF, RFC 4915 (June 2007)
Przygienda, T., et al.: M-ISIS: Multi Topology (MT) Routing in IS-IS. RFC 5120 (February 2008)
Grffin, D., et al.: Inter-domain Routing through Quality of Service Class Planes. IEEE Communications 45(2), 88–95 (2007)
Feamster, N., et al.: Path Splicing with Network Slicing. In: Proc. ACM SIGCOMM HotNets (2007)
Motiwala, M., et al.: Path Splicing. In: Proc. ACM SIGCOMM (2008)
Wang, J., et al.: Edge Based Traffic Engineering for OSPF Networks. Computer Networks 48(4), 605–625 (2005)
Menth, M., et al.: Network Resilience through Multi-Topology Routing. In: Proc. IEEE DRCN 2005 (2005)
Xu, W., et al.: MIRO: Multi-path Inter-domain Routing. In: Proc. ACM SIGCOMM (2006)
The Abilene Network, http://www.stanford.edu/services/internet2/abilene.html
The GÉANT Network, http://www.geant.net
Feamster, N., et al.: Guidelines for inter-domain traffic engineering. ACM SIGCOMM Computer Communications Review (fall 2003)
Han, J., et al.: An Experimental Study of Internet Path Diversity. IEEE Transactions on Dependable and Secure Computing 3(4) (October 2006)
Iannaccone, G., et al.: Analysis of Link Failures in a Large IP Backbone. In: Proc. ACM Internet Measurement Workshop (IMW) (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guo, Y., Wang, N., Ho, KH., Howarth, M., Pavlou, G. (2008). Achieving Fast BGP Reroute with Traffic Engineering Using Multiple Routing Planes. In: Akar, N., Pioro, M., Skianis, C. (eds) IP Operations and Management. IPOM 2008. Lecture Notes in Computer Science, vol 5275. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87357-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-87357-0_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87356-3
Online ISBN: 978-3-540-87357-0
eBook Packages: Computer ScienceComputer Science (R0)