Visible to the public How to represent IPv6 forwarding tables on IPv4 or MPLS dataplanes

TitleHow to represent IPv6 forwarding tables on IPv4 or MPLS dataplanes
Publication TypeConference Paper
Year of Publication2016
AuthorsNikolenko, S. I., Kogan, K., Rétvári, G., Bérczi-Kovács, E. R., Shalimov, A.
Conference Name2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)
Date Publishedapr
Keywordsabstraction layer, classification width, clean slate, clean slate architectures, Collaboration, Conferences, Heuristic algorithms, Human Behavior, Internet, Internet routing ecosystem, IP networks, IPv4, IPv6 FIB, IPv6 forwarding tables, lookup time, memory footprint, Memory management, Metrics, MPLS dataplanes, multiprotocol label switching, parallel processing, pubcrawl, Resiliency, Silicon, telecommunication network routing
Abstract

The Internet routing ecosystem is facing substantial scalability challenges on the data plane. Various "clean slate" architectures for representing forwarding tables (FIBs), such as IPv6, introduce additional constraints on efficient implementations from both lookup time and memory footprint perspectives due to significant classification width. In this work, we propose an abstraction layer able to represent IPv6 FIBs on existing IP and even MPLS infrastructure. Feasibility of the proposed representations is confirmed by an extensive simulation study on real IPv6 forwarding tables, including low-level experimental performance evaluation.

URLhttp://ieeexplore.ieee.org/document/7562132/
DOI10.1109/INFCOMW.2016.7562132
Citation Keynikolenko_how_2016