Issue No. 06 - Dec. (2017 vol. 25)
Kirill Kogan , IMDEA Networks Institute, Leganés, Spain
Sergey I. Nikolenko , National Research University Higher School of Economics, St. Petersburg, Russia
Patrick Eugster , Technische Universität Darmstadt, Darmstadt, Germany
Alexander Shalimov , Lomonosov Moscow State University, Moscow, Russia
Ori Rottenstreich , Princeton University, Princeton, NJ, USA
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.
Switches, Ports (Computers), Memory management, Routing, IP networks, Electronic mail, IEEE transactions
K. Kogan, S. I. Nikolenko, P. Eugster, A. Shalimov and O. Rottenstreich, "Efficient FIB Representations on Distributed Platforms," in IEEE/ACM Transactions on Networking, vol. 25, no. 6, pp. 3309-3322, 2017.