Show simple item record

dc.contributor.author Kogan K.
dc.contributor.author Nikolenko S.
dc.contributor.author Eugster P.
dc.contributor.author Shalimov A.
dc.contributor.author Rottenstreich O.
dc.date.accessioned 2018-09-19T21:04:30Z
dc.date.available 2018-09-19T21:04:30Z
dc.date.issued 2016
dc.identifier.issn 1092-1648
dc.identifier.uri https://dspace.kpfu.ru/xmlui/handle/net/143557
dc.description.abstract © 2016 IEEE.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.relation.ispartofseries Proceedings - International Conference on Network Protocols, ICNP
dc.title FIB efficiency in distributed platforms
dc.type Conference Paper
dc.relation.ispartofseries-volume 2016-December
dc.collection Публикации сотрудников КФУ
dc.source.id SCOPUS10921648-2016-2016-SID85009452554


Files in this item

This item appears in the following Collection(s)

  • Публикации сотрудников КФУ Scopus [24551]
    Коллекция содержит публикации сотрудников Казанского федерального (до 2010 года Казанского государственного) университета, проиндексированные в БД Scopus, начиная с 1970г.

Show simple item record

Search DSpace


Advanced Search

Browse

My Account

Statistics