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

Ficheros

ton_fib_final.pdf (1.766Mb)

Identificadores

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

ISSN: 1063-6692

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

Metadatos

Mostrar el registro completo del ítem

Autor(es)

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

Fecha

2017-12

Resumen

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.