dc.contributor.author | Nikolenko, Sergey | |
dc.contributor.author | Kogan, Kirill | |
dc.contributor.author | Rétvári, Gábor | |
dc.contributor.author | Bérczi-Kovács, Erika R. | |
dc.contributor.author | Shalimov, Alexander | |
dc.date.accessioned | 2021-07-13T09:26:07Z | |
dc.date.available | 2021-07-13T09:26:07Z | |
dc.date.issued | 2016-04-11 | |
dc.identifier.uri | http://hdl.handle.net/20.500.12761/135 | |
dc.description.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. | |
dc.language.iso | eng | |
dc.title | How to Represent IPv6 Forwarding Tables on IPv4 or MPLS Dataplanes | en |
dc.type | conference object | |
dc.conference.date | 10-15 April 2016 | |
dc.conference.place | San Francisco, CA, USA | |
dc.conference.title | The 19th IEEE Global Internet Symposium (IEEE GI 2016), in conjunction with the 35th IEEE International Conference on Computer Communications (IEEE INFOCOM 2016) | * |
dc.event.type | workshop | |
dc.pres.type | paper | |
dc.rights.accessRights | open access | |
dc.page.final | 6 | |
dc.page.initial | 1 | |
dc.subject.keyword | Forwarding information base | |
dc.subject.keyword | IPv6 | |
dc.subject.keyword | MPLS | |
dc.description.refereed | TRUE | |
dc.description.status | pub | |
dc.eprint.id | http://eprints.networks.imdea.org/id/eprint/1195 | |