Partial Adaptive Name Information in ICN: PANINI Routing Limits FIB Table Sizes

Abstract

Name-based routing as proposed in Information Centric Networking encounters the problems of (a) exploding routing tables, as the number of names largely exceeds common routing resources, and (b) limited aggregation potentials, as names are commonly independent of content locations. In this poster, we introduce PANINI, an approach to scale routing on names by adapting FIB tables simultaneously to available resources and actual traffic patterns. PANINI introduces routing hierarchies with respect to aggregation points, bimodal FIBs, and confined flooding. First evaluations show promising results in theory and experiments.