Practical Network-Wide Compression of IP Routing Tables

Karpilovsky, Elliott; Caesar, Matthew; Rexford, Jennifer; Shaikh, Aman; Merwe, Jacobus Van der

doi:10.1109/tnsm.2012.081012.120246

Cited by 17 publications

(12 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are several papers that deal with this problem by proposing heuristics that simultaneously try to limit the number of updates to the FIB while maintaining a good compression rate, including SMALTA [20], FIFA [10], and others [8], [11], [13], [21]. Moreover, some authors even proposed to only store a subset of rules in the FIB, leveraging Zipf's law [18].…”

Section: B Related Workmentioning

confidence: 99%

Competitive FIB Aggregation without Update Churn

Bieńkowski

Sarrar

Schmid

et al. 2014

2014 IEEE 34th International Conference on Distributed Computing Systems

View full text Add to dashboard Cite

Abstract-This paper attends to the well-known problem of compressing the Forwarding Information Base of a router or switch, while preserving a correct forwarding. In contrast to related work, we study an online variant of the problem where BGP routes can change over time, and where the number of updates to the FIB are taken into account explicitly. Minimizing the number of FIB updates is important, especially when they are sent across the network (e.g., from the network-attached SDN controller).This paper pursues a competitive analysis approach and introduces a formal model which is an interesting generalization of several classic online aggregation problems. The main contribution is a O(w)-competitive algorithm, where w is the length of an IP address. We also derive a lower bound which shows that our result is asymptotically optimal within a natural class of algorithms.

show abstract

Section: B Related Workmentioning

confidence: 99%

Competitive FIB Aggregation without Update Churn

Bieńkowski

Sarrar

Schmid

et al. 2014

2014 IEEE 34th International Conference on Distributed Computing Systems

View full text Add to dashboard Cite

show abstract

“…The performance merits come at the cost of only 1.5% loss in compression ratio compared with that in theoretically optimised ratio. Karpilovsky et al [13] presented an incrementally deployable memory management system that can reduce the associated router state by up to 70%. The system coalesced prefixes to reduce storage consumption and can be deployed locally on each router or centrally on a server for routing.…”

Section: Related Workmentioning

confidence: 99%

H‐SOFT: a heuristic storage space optimisation algorithm for flow table of OpenFlow

Chen

et al. 2014

Concurrency and Computation

View full text Add to dashboard Cite

OpenFlow has become the key standard and technology for software defined networking which has been widely adopted in various environments. However, the global deployment of OpenFlow encountered several issues, such as the increasing number of fields and complex structure of flow entries, making the size of flow table in OpenFlow switches explosively grows which results in hardware implementation difficulty. To this end, this paper presents the modelling on the minimisation for storage space of flow table, and proposes a Heuristic Storage space Optimisation algorithm for Flow Table (H-SOFT) to solve this optimisation problem. The H-SOFT algorithm degrades the complex and high-dimensional fields of a flow table into multiple flow tables with simple and low-dimensional fields based on the co-existence and conflict relationships among fields to release the un-used storage space due to blank fields. Extensive simulation experiments demonstrate that the H-SOFT algorithm can effectively reduce the storage space of flow table. In particular, with frequent updates on flow entries, the storage space compression rate of flow table is stable and can achieve at ~70%. Moreover, in comparison with the optimal solution, the H-SOFT algorithm can achieve the similar compression rate with much lower execution time.

show abstract

“…However, these techniques cannot aggregate routes originating several hops away, and can sometimes lead to black holes and loops [21]. Other techniques for reducing the size of routing-tables [17] work only within a single AS, missing opportunities for global scalability gains.…”

Section: Related Workmentioning

confidence: 99%

Distributed Route Aggregation on the Global Network

Sobrinho

Vanbever

et al. 2014

Proceedings of the 10th ACM International on Conference on Emerging Networking Experiments and Technologies

Self Cite

View full text Add to dashboard Cite

The Internet routing system faces serious scalability challenges, due to the growing number of IP prefixes it needs to propagate throughout the network. For example, the Internet suffered significant outages in August 2014 when the number of globally routable prefixes went past 512K, the default size of the forwarding tables in many older routers. Although IP prefixes are assigned hierarchically, and roughly align with geographic regions, today's Border Gateway Protocol (BGP) and operational practices do not exploit opportunities to aggregate routes. We present a distributed route-aggregation technique (called DRAGON) where nodes analyze BGP routes across different prefixes to determine which of them can be filtered while respecting the routing policies for forwarding data-packets. DRAGON works with BGP, can be deployed incrementally, and offers incentives for ASs to upgrade their router software. We present a theoretical model of route-aggregation, and the design and analysis of DRAGON. Our experiments with realistic assignments of IP prefixes, network topologies, and routing policies show that DRAGON reduces the number of prefixes in each AS by about 80% and significantly curtails the number of routes exchanged during transient periods of convergence.

show abstract

Practical Network-Wide Compression of IP Routing Tables

Cited by 17 publications

References 27 publications

Competitive FIB Aggregation without Update Churn

Competitive FIB Aggregation without Update Churn

H‐SOFT: a heuristic storage space optimisation algorithm for flow table of OpenFlow

Distributed Route Aggregation on the Global Network

Contact Info

Product

Resources

About