使用奥赛罗散列实现高效内存和超快网络转发
Memory-efficient and Ultra-fast Network Lookup and Forwarding using Othello Hashing
摘要:
网络算法总是倾向于低内存开销和快速的数据包处理速度。转发信息库(FIB)作为一种典型的网络处理组件,需要一种可扩展的、存储效率高的算法来支持快速查找。在本文中,我们提出了一种新的网络算法,奥赛罗哈希,和它的应用FIB设计称为简洁,它使用很少的内存来支持超快速查找网络名称。Othello Hashing和Concise使用最小完美哈希,并依赖于可编程网络框架来支持动态更新。我们的概念贡献的简洁是优化内存效率和查询速度在数据平面和移动相对复杂的建设和更新组件的资源丰富的控制平面。我们在三个平台上实现了Concise。实验结果表明,简洁使用显着更小的内存,以实现更快的查询速度相比,现有的解决方案的网络名称查找。
英文摘要:
Network algorithms always prefer low memory cost and fast packet processing speed. Forwarding information base (FIB), as a typical network processing component, requires a scalable and memory-efficient algorithm to support fast lookups. 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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。