A concise forwarding information base for scalable and fast name lookups
A concise forwarding information base for scalable and fast name lookups
复制标题
DOI：
10.1109/icnp.2017.8117530
复制
发表时间：
2017-10
期刊：
影响因子：
--
通讯作者：
Ye Yu;Djamal Belazzougui;Chen Qian;Qin Zhang
中科院分区：
文献类型：
--
作者：
Ye Yu;Djamal Belazzougui;Chen Qian;Qin Zhang
转发信息库（FIB）可伸缩性及其查找速度是使用与位置无关的网络名称的众多网络技术的基本问题。在本文中，我们介绍了一种新的网络算法，奥赛罗·哈希（Othello Hashing），以及其对fib设计的应用称为简明的设计，该设计使用很少的内存来支持网络名称的超快速查找。 Othello Hashing和简洁，利用最少的完美哈希兴趣，并依靠可编程网络框架来支持动态更新。我们简明的概念贡献是优化数据平面中的内存效率和查询速度，并将相对复杂的结构和更新组件移至资源丰富的控制平面。我们在三个平台上实施了简洁的实施。实验结果表明，与现有网络名称查找的解决方案相比，简洁的记忆使用明显较小的内存来实现更快的查询速度。
Forwarding information base (FIB) scalability and its lookup speed are fundamental problems of numerous network technologies that uses location-independent network names. In this paper we present a new network algorithm, Othello Hashing, and its application of a FIB design called Concise, which uses very little memory to support ultra-fast lookups of network names. Othello Hashing and Concise make use of minimal perfect hashing and relies on the programmable network framework to support dynamic updates. Our conceptual contribution of Concise is to optimize the memory efficiency and query speed in the data plane and move the relatively complex construction and update components to the resource-rich control plane. We implemented Concise on three platforms. Experimental results show that Concise uses significantly smaller memory to achieve much faster query speed compared to existing solutions of network name lookups.