Efficient FIB Representations on Distributed Platforms

Kogan, Kirill; Nikolenko, Sergey; Eugster, Patrick; Shalimov, Alexander; Rottenstreich, Ori

doi:DOI: http://doi.ieeecomputersociety.org/10.1109/TNET.2017.2728642

Files

ton_fib_final.pdf (1.766Mb)

Identifiers

URI: http://hdl.handle.net/20.500.12761/421

ISSN: 1063-6692

DOI: DOI: http://doi.ieeecomputersociety.org/10.1109/TNET.2017.2728642

Metadata

Show full item record

Author(s)

Kogan, Kirill; Nikolenko, Sergey; Eugster, Patrick; Shalimov, Alexander; Rottenstreich, Ori

Date

2017-12

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 work we explore efficient 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.