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 efficient 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.

This is a joint work with Sergey Nikolenko, Patrick Eugster, Alexander Shalimov, and Ori Rottenstreich.

About Kirill Kogan

During the last decade (2000-2012) I worked as a Technical Leader at Cisco Systems. During this time I gained enough theoretical and practical experience that I formalized in my Ph.D at Ben-Gurion University (Israel) under the guidance of Prof. Michael Segal (BGU) and Dr. Alex Kesselman (Google) that I did during (2008-2012). During 2012 I was a Postdoctoral Fellow at the University of Waterloo (Canada), where I worked with Prof. Srinivasan Keshav and Prof. Alejandro Lopez-Ortiz, and later at the Purdue University (USA), where I worked with Prof. Patrick Eugster.

Kirill Kogan’s personal website

This event will be conducted in English