Improving Route Diversity through the Design of iBGP Topologies
Cristel Pelsser , Tomonori Takeda , Eiji Oki and Kohei Shiomoto
Abstract
In a service provider (SP) network, routes for external destinations are distributed on iBGP sessions. This traditionally required the establishment of a full-mesh of iBGP sessions in the network. A common practice is now to make use of route reflectors (RR). Such a practice is more scalable in the number of iBGP sessions to be configured in a SP network. However, it has been shown that RRs have a negative impact on the diversity of routes available in the network. This is an important issue as routers may not be able to quickly use an alternate route in case of a route failure. In this paper we tackle the problem of route diversity in a service provider network composed of RRs. We propose an algorithm to design iBGP session topologies with improved route diversity. We rely on an initial route reflection topology. Our algorithm proposes the addition of a few iBGP sessions to some border routers of the domain. These border routers receive a large number of external routes for which routers lack diversity. We show by means of simulations that our algorithm meets its goals. In the resulting topologies, each BGP router knows at least two different ways to reach distant destinations. This is ensured as long as a prefix advertisement is received at different nodes at the border of the AS. Secondly, we observe that the number of iBGP sessions required to achieve this goal is significantly below the number of sessions required in the case of a full-mesh. Finally, the remaining lack of route diversity after the use of our design algorithm indicates that new external peering sessions should be established. In this case, our algorithm shows that diversity cannot be reached for some prefixes independently of the iBGP topology, with the current external peering sessions.
Publication Details
- Publication Type
- Conference Paper
- Publication Date
- May 2008
- Published In
- Proceedings of IEEE International Conference on Communications, ICC 2008
- Pages
- 5732--5738
- Publisher
- IEEE
- Location
- Beijing, China
- Digital Object Identifier (DOI)
- 10.1109/ICC.2008.1073
Suggested citation
Cristel Pelsser, Tomonori Takeda, Eiji Oki, and Kohei Shiomoto. 2008. Improving Route Diversity through the Design of iBGP Topologies. In Proceedings of IEEE International Conference on Communications, ICC 2008. IEEE, Beijing, China, 5732–5738. https://doi.org/10.1109/ICC.2008.1073
BibTeX Citation
@inproceedings{Pelsser2008,
title = {Improving Route Diversity through the Design of iBGP Topologies},
author = {Cristel Pelsser and Tomonori Takeda and Eiji Oki and Kohei Shiomoto},
year = 2008,
month = may,
booktitle = {Proceedings of IEEE International Conference on Communications, {ICC} 2008},
location = {Beijing, China},
publisher = {IEEE},
pages = {5732--5738},
doi = {10.1109/ICC.2008.1073},
abstract = {In a service provider (SP) network, routes for external destinations are distributed on iBGP sessions. This traditionally required the establishment of a full-mesh of iBGP sessions in the network. A common practice is now to make use of route reflectors (RR). Such a practice is more scalable in the number of iBGP sessions to be configured in a SP network. However, it has been shown that RRs have a negative impact on the diversity of routes available in the network. This is an important issue as routers may not be able to quickly use an alternate route in case of a route failure. In this paper we tackle the problem of route diversity in a service provider network composed of RRs. We propose an algorithm to design iBGP session topologies with improved route diversity. We rely on an initial route reflection topology. Our algorithm proposes the addition of a few iBGP sessions to some border routers of the domain. These border routers receive a large number of external routes for which routers lack diversity. We show by means of simulations that our algorithm meets its goals. In the resulting topologies, each BGP router knows at least two different ways to reach distant destinations. This is ensured as long as a prefix advertisement is received at different nodes at the border of the AS. Secondly, we observe that the number of iBGP sessions required to achieve this goal is significantly below the number of sessions required in the case of a full-mesh. Finally, the remaining lack of route diversity after the use of our design algorithm indicates that new external peering sessions should be established. In this case, our algorithm shows that diversity cannot be reached for some prefixes independently of the iBGP topology, with the current external peering sessions.},
bibsource = {dblp computer science bibliography, https://dblp.org},
biburl = {https://dblp.org/rec/conf/icc/PelsserTOS08.bib},
groups = {International Conferences},
keywords = {Service Provider, BGP, Route Reflector, iBGP}
}
Related publications
Metrics to Evaluate the Cost of Maintaining Diverse BGP Routes
Cristel Pelsser, Akeo Masuda, and Kohei Shiomoto
IEICE General Conference, 2008
Providing scalable NH-diverse iBGP route re-distribution to achieve sub-second switch-over time
Cristel Pelsser, Steve Uhlig, and Tomonori Takeda, et al.
Computer Networks, 2010
Requirements for the Graceful Shutdown of BGP Sessions
Antonio Jose Elizond Armengol, Cristel Pelsser, and Bruno Decraene, et al.
RFC, 2011
SpliTable: Toward Routing Scalability through Distributed BGP Routing Tables
Akeo Masuda, Cristel Pelsser, and Kohei Shiomoto
IEICE Transactions on Communications, 2011