| dc.contributor.author | Kogan, Kirill | |
| dc.contributor.author | Nikolenko, Sergey | |
| dc.contributor.author | Eugster, Patrick | |
| dc.contributor.author | Shalimov, Alexander | |
| dc.contributor.author | Rottenstreich, Ori | |
| dc.date.accessioned | 2021-07-13T09:27:19Z | |
| dc.date.available | 2021-07-13T09:27:19Z | |
| dc.date.issued | 2016-11-08 | |
| dc.identifier.uri | http://hdl.handle.net/20.500.12761/248 | |
| dc.description.abstract | 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. | |
| dc.language.iso | eng | |
| dc.title | FIB Efficiency in Distributed Platforms | en |
| dc.type | conference object | |
| dc.conference.date | 8-11 November 2016 | |
| dc.conference.place | Singapore | |
| dc.conference.title | The 24th IEEE International Conference on Network Protocols (ICNP 2016) | * |
| dc.event.type | conference | |
| dc.pres.type | paper | |
| dc.type.hasVersion | VoR | |
| dc.rights.accessRights | open access | |
| dc.page.final | 10 | |
| dc.page.initial | 1 | |
| dc.subject.keyword | Forwarding Information Base | |
| dc.subject.keyword | TCAM | |
| dc.subject.keyword | IPv6 | |
| dc.subject.keyword | distributed platforms | |
| dc.description.refereed | TRUE | |
| dc.description.status | pub | |
| dc.eprint.id | http://eprints.networks.imdea.org/id/eprint/1375 | |
