BGP Churn Evolution: A Perspective From the Core

Elmokashfi, Ahmed; Kvalbein, Amund; Dovrolis, Constantine

doi:10.1109/tnet.2011.2168610

Cited by 44 publications

(20 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This solution does not affect neighboring routers and it can be done by a simple software update [18]. However, aggregation may come at the cost of a higher FIB update churn (e.g., see [5]): upon certain BGP updates, aggregated FIB entries may have to be disaggregated again. Frequent FIB updates are problematic as upon each update, internal FIB structures have to be rebuilt to ensure routing consistency.…”

Section: Introductionmentioning

confidence: 99%

Competitive FIB Aggregation for Independent Prefixes: Online Ski Rental on the Trie

Bieńkowski

Schmid

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. This paper presents an asymptotically optimal online algorithm for compressing the Forwarding Information Base (FIB) of a router under a stream of updates (namely insert rule, delete rule, and change port of prefix). The objective of the algorithm is to dynamically aggregate forwarding rules into a smaller but equivalent set of rules while taking into account FIB update costs. The problem can be regarded as a new variant of ski rental on the FIB trie, and we prove that our deterministic algorithm is 3.603-competitive. Moreover, a lower bound of 1.636 is derived for any online algorithm.

show abstract

Section: Introductionmentioning

confidence: 99%

Competitive FIB Aggregation for Independent Prefixes: Online Ski Rental on the Trie

Bieńkowski

Schmid

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…In the following results, we consider values of ↵ ranging from 10 to 20, and values of of 1, 10, 30, 60, and 600 seconds. We chose these values of because they capture the scales at which BGP routing events take place [7].…”

Section: B Analysis Of Churn Localitymentioning

confidence: 99%

“…While the aggregation of the FIB entries is beneficial in terms of memory, it also entails a potential overhead: As the FIB contents of a router change over time -with peaks of several hundreds to thousands of modifications inside one second [7] -the FIB aggregation algorithm needs to translate every routing update into one or more updates to the aggregated FIB. This is because when applying routing updates as they come to the aggregated FIB, forwarding consistency to the original FIB is likely to be violated [18].…”

mentioning

confidence: 99%

Leveraging locality for FIB aggregation

Sarrar

Wuttke

Schmid

et al. 2014

2014 IEEE Global Communications Conference

View full text Add to dashboard Cite

Abstract-Snapshots of the Forwarding Information Base (FIB) in Internet routers can be compressed (or aggregated) to at least half of their original size, as shown by previous studies. However, the permanent stream of updates to the FIB due to routing updates complicates FIB aggregation in practice: keeping a (near-)optimally aggregated FIB in face of these routing updates is algorithmically challenging. A sensible trade-off has to be found between the aggregation gain and the complexity of handling routing updates. This paper investigates whether the spatial and temporal locality properties of routing updates conceal opportunities for improving this trade-off in online FIB aggregation.Our contributions include an empirical study of the locality of updates in public Internet routing data. To facilitate this study, we design the Locality-aware FIB Aggregation (LFA) algorithm. We show, that an algorithm as simple as LFA can effectively leverage the locality of FIB churn to keep low the number of updates to the aggregated FIB, as within time periods of a few seconds or minutes, routing updates affect only a limited number of regions in the FIB. I. INTRODUCTIONAt a high level, Internet routers are built around a route processor which runs routing protocols and makes routing decisions, and a forwarding plane which forwards packets according to the decisions of the route processor. The crucial link between the two components is the Forwarding Information Base (FIB), containing the forwarding rules. The route processor inserts and deletes FIB entries according to its route computations. The forwarding plane uses the FIB to perform an IP destination lookup on each incoming packet. This requires the FIB to support very fast IP destination lookups so that packets can be forwarded at line-rate. In addition, the FIB needs to support frequent updates to the forwarding rules due to the churn in the BGP routing table. Finally, the number of forwarding rules that a FIB needs to keep is growing over time, putting extra pressure on the FIB memory capacity. 1 To fulfill all these requirements, FIB memory used in today's enterprise-grade to high-end routers is a highly specialized component, expensive, and power-hungry. It is also considered a main limiting factor in terms of a router's lifetime [12].A natural and local solution to mitigate the problembefore possible long-term solutions are deployed -is the aggregation (or compression) of the FIB, i.e., the replacement of the existing set of rules by an equivalent but smaller set. The aggregation of FIB rules has the appealing property that it is a purely local solution, in the sense that it does not affect neighboring routers and it can be realized by the route processor through only software modifications.

show abstract

“…Previous works used public BGP dataset in a wide variety of manners, e.g., for analyses on AS-level topology discovery [18], commercial relationships between ASes [27], BGP update churn [28], prefix allocation and aggregation [29], prefix reachability [21], and many more. The significance of contributions that tried to match BGP control-plane data with data-plane measurements was questioned by Bush et al, who showed in [21] that BGP data are inadequate for this goal.…”

Section: Related Workmentioning

confidence: 99%

On the quality of BGP route collectors for iBGP policy inference

Cittadini

Vissicchio

Donnet

2014

2014 IFIP Networking Conference

View full text Add to dashboard Cite

Abstract-A significant portion of what is known about Internet routing stems out from public BGP datasets. For this reason, numerous research efforts were devoted to (i) assessing the (in)completeness of the datasets, (ii) identifying biases in the dataset, and (iii) augmenting data quality by optimally placing new collectors. However, those studies focused on techniques to extract information about the AS-level Internet topology.In this paper, we show that considering different metrics influences the conclusions about biases and collector placement. Namely, we compare AS-level topology discovery with iBGP policy inference. We find that the same datasets exhibit significantly diverse biases for these two metrics. For example, the sensitivity to the number and position of collectors is noticeably different. Moreover, for both metrics, the marginal utility of adding a new collector is strongly localized with respect to the proximity of the collector. Our results suggest that the "optimal" position for new collectors can only be defined with respect to a specific metric, hence posing a fundamental trade-off for maximizing the utility of extensions to the BGP data collection infrastructure.

show abstract

BGP Churn Evolution: A Perspective From the Core

Cited by 44 publications

References 27 publications

Competitive FIB Aggregation for Independent Prefixes: Online Ski Rental on the Trie

Competitive FIB Aggregation for Independent Prefixes: Online Ski Rental on the Trie

Leveraging locality for FIB aggregation

On the quality of BGP route collectors for iBGP policy inference

Contact Info

Product

Resources

About