Pragmatic router FIB caching

  • Gadkari, Kaustubh
  • Weikum, M. Lawrence
  • Massey, Dan
  • Papadopoulos, Christos
ORKG logo Add to ORKG
Publication date
June 2015
Publisher
Institute of Electrical and Electronics Engineers (IEEE)

Abstract

Several recent studies have shown that router FIB caching offers excellent hit rates with cache sizes that are an order of magnitude smaller than the original forwarding table. However, hit rate alone is not sufficient - other performance metrics such as memory accesses, robustness to cache attacks, queuing delays from cache misses etc., should be considered before declaring FIB caching viable. In this paper, we tackle several pragmatic questions about FIB caching. We characterize cache performance in terms of memory accesses and delay due to cache misses. We study cache robustness to pollution attacks and show that an attacker must sustain packet rates higher than the link capacity to evict the most popular prefixes. We show that caching w...

Extracted data

Loading...

Related items

Pragmatic router FIB caching
  • Gadkari, Kaustubh
  • Weikum, M. Lawrence
  • Massey, Dan
  • Papadopoulos, Christos
June 2015

Several recent studies have shown that router FIB caching offers excellent hit rates with cache size...

Efficient FIB caching using minimal non-overlapping prefixes
  • Liu, Yaoqing
  • Lehman, Vince
  • Wang, Lan
June 2015

The size of the global Routing Information Base (RIB) has been increasing at an alarming rate. As a ...

An analytical model for Loc/ID mappings caches
  • Coras, Florin-Tudorel
  • Domingo Pascual, Jordi
  • Lewis, Darrel
  • Cabellos Aparicio, Alberto

Concerns regarding the scalability of the interdomain routing have encouraged researchers to start e...

We use cookies to provide a better user experience.