Toward fast NDN software forwarding lookup engine based on hash tables
Proceedings of the eighth ACM/IEEE symposium on Architectures for networking …, 2012•dl.acm.org
In Named Data Networking (NDN), forwarding lookup is based on tokenized variable-length
names instead of fixed-length host addresses, and therefore it requires a new approach for
designing a fast packet forwarding lookup engine. In this paper, we propose a design of an
NDN software forwarding lookup engine based on hash tables and evaluate its performance
with different design options. With a good hash function and table design combined with
Bloom filters and data prefetching, we demonstrate that our design reaches about 1.5 MPPS …
names instead of fixed-length host addresses, and therefore it requires a new approach for
designing a fast packet forwarding lookup engine. In this paper, we propose a design of an
NDN software forwarding lookup engine based on hash tables and evaluate its performance
with different design options. With a good hash function and table design combined with
Bloom filters and data prefetching, we demonstrate that our design reaches about 1.5 MPPS …
In Named Data Networking (NDN), forwarding lookup is based on tokenized variable-length names instead of fixed-length host addresses, and therefore it requires a new approach for designing a fast packet forwarding lookup engine. In this paper, we propose a design of an NDN software forwarding lookup engine based on hash tables and evaluate its performance with different design options. With a good hash function and table design combined with Bloom filters and data prefetching, we demonstrate that our design reaches about 1.5MPPS with a single thread on an Intel 2.0GHz Xeon processor.
ACM Digital Library以上显示的是最相近的搜索结果。 查看全部搜索结果