Efficient FIB caching using minimal non-overlapping prefixes

Author:

Liu Yaoqing1,Amin Syed Obaid1,Wang Lan1

Affiliation:

1. University of Memphis, Memphis, TN, USA

Abstract

The size of the global Routing Information Base (RIB) has been increasing at an alarming rate. This directly leads to the rapid growth of the global Forwarding Information Base (FIB) size, which raises serious concerns for ISPs as the FIB memory in line cards is much more expensive than regular memory modules and it is very costly to increase this memory capacity frequently for all the routers in an ISP. One potential solution is to install only the most popular FIB entries into the fast memory (i.e., a FIB cache), while storing the complete FIB in slow memory. In this paper, we propose an effective FIB caching scheme that achieves a considerably higher hit ratio than previous approaches while preventing the cache-hiding problem. Our experimental results show that with only 20K prefixes in the cache (5.36% of the actual FIB size), the hit ratio of our scheme is higher than 99.95%. Our scheme can also handle cache misses, cache replacement and routing updates efficiently.

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Networks and Communications,Software

Reference17 articles.

1. Advanced Network Technology Center at University of Oregon. The RouteViews project. http://www.routeviews.org/. Advanced Network Technology Center at University of Oregon. The RouteViews project. http://www.routeviews.org/.

2. Efficient prefix cache for network processors

3. Constructing optimal IP routing tables

4. V. Fuller. Scaling Issues with Routing+Multihoming. http://www.vaf.net/~vaf/apricot-plenary.pdf 1996. V. Fuller. Scaling Issues with Routing+Multihoming. http://www.vaf.net/~vaf/apricot-plenary.pdf 1996.

Cited by 14 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. SFCache: Hybrid NF Synthesization in Runtime With Rule-Caching in Programmable Switches;IEEE Transactions on Network and Service Management;2024-08

2. Cache Dependent Rules With Size-Limited Flow Table in Software-Defined Networking;2022 IEEE Smartworld, Ubiquitous Intelligence & Computing, Scalable Computing & Communications, Digital Twin, Privacy Computing, Metaverse, Autonomous & Trusted Vehicles (SmartWorld/UIC/ScalCom/DigitalTwin/PriComp/Meta);2022-12

3. OVS-CAB: Efficient rule-caching for Open vSwitch hardware offloading;Computer Networks;2021-04

4. An efficient pipeline processing scheme for programming Protocol-independent Packet Processors;Journal of Network and Computer Applications;2020-12

5. VeriTable: Fast equivalence verification of multiple large forwarding tables;Computer Networks;2020-02

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3