2010
DOI: 10.1109/jsac.2010.101007
|View full text |Cite
|
Sign up to set email alerts
|

BGP Add-Paths: The Scaling/Performance Tradeoffs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2012
2012
2016
2016

Publication Types

Select...
4
2
1

Relationship

2
5

Authors

Journals

citations
Cited by 24 publications
(4 citation statements)
references
References 9 publications
0
4
0
Order By: Relevance
“…It is important to note that the advertisement of multiple routes guarantees dissemination and forwarding correctness only if all the routes that are equally preferred according to the first four steps of the BGP decision process (so called AS dominant routes) are propagated network-wide. However, the higher number of routes handled in iBGP could cause router memory and update churn penalties [22]. Raszuk et al [23] propose to add special route-reflectors in order to distribute multiple routes.…”
Section: Revisiting the State-of-the-artmentioning
confidence: 99%
“…It is important to note that the advertisement of multiple routes guarantees dissemination and forwarding correctness only if all the routes that are equally preferred according to the first four steps of the BGP decision process (so called AS dominant routes) are propagated network-wide. However, the higher number of routes handled in iBGP could cause router memory and update churn penalties [22]. Raszuk et al [23] propose to add special route-reflectors in order to distribute multiple routes.…”
Section: Revisiting the State-of-the-artmentioning
confidence: 99%
“…In addition, the propagation of individual paths is likely to create scalability issues. As for IBGP [38], trade-offs between the scalability and the performance of those solutions exist. The results presented in section 6 show that BGP-XM features interesting scalability properties, which are suitable for large-scale deployments.…”
Section: Related Workmentioning
confidence: 99%
“…Source routing Hierarchical routing Multipath routing [2] Limited No Yes [3] Yes No No [4] No Limited No [5] No Yes No [6] Limited Yes No [7] Yes Limited Yes [8] No No Yes [9] No Yes Limited [10] No Yes Yes [11] Limited No Yes [12] No Limited Yes Pathlet routing [1] is probably the contribution that is closest to our control plane approach: its most evident drawback is the lack of a clearly defined mechanism for the dissemination of pathlets, which the authors only hint at. Path splicing [2] is a mechanism designed with fault tolerance in mind (see also [13]): it exploits multipath to ensure connectivity between network nodes as long as the network is not partitioned.…”
Section: Related Workmentioning
confidence: 99%
“…Besides the intrinsic difficulty of this encoding, it inherits the limits of the dissemination mechanisms it relies on: NIRA or pathlet routing. BGP Add-Paths [8] and YAMR [12] also address resiliency by announcing multiple paths selected according to different criteria, but they only adopt multipath routing, provide very limited or no support for hierarchical routing, and have some dependencies on the BGP technology. A completely different approach is taken by HLP [4], which proposes a hybrid routing mechanism based on a combination of linkstate and path-vector protocols.…”
Section: Related Workmentioning
confidence: 99%