Efficient FIB Representations on Distributed Platforms

Kirill Kogan, Sergey I. Nikolenko, Patrick Eugster, Alexander Shalimov, Ori Rottenstreich

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

The Internet routing ecosystem is facing substantial scalability challenges due to continuous, significant growth of the state represented in the data plane. Distributed switch architectures introduce additional constraints on efficiency of implementations from both lookup time and memory footprint perspectives. In this paper we explore efficient forwarding information base FIB representations in common distributed switch architectures. Our approach introduces substantial savings in memory footprint transparently for existing hardware. Our results are supported by an extensive simulation study on real IPv4 and IPv6 FIBs.

Original languageEnglish
Pages (from-to)3309-3322
Number of pages14
JournalIEEE/ACM Transactions on Networking
Volume25
Issue number6
DOIs
StatePublished - Dec 2017
Externally publishedYes

Keywords

  • IP networks
  • telecommunication switching

Fingerprint

Dive into the research topics of 'Efficient FIB Representations on Distributed Platforms'. Together they form a unique fingerprint.

Cite this