PROJECT TITLE :
Memory-Efficient and Ultra-Fast Network Lookup and Forwarding Using Othello Hashing - 2018
Network algorithms forever prefer low memory value and fast packet processing speed. Forwarding information base (FIB), as a typical network processing element, requires a scalable and memory-economical algorithm to support fast lookups. In this Project, we tend to present a replacement network algorithm, Othello hashing, and its application of a FIB style known as concise, that uses terribly little memory to support ultra-quick lookups of network names. Othello hashing and concise create 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 potency and question speed in the info plane and move the relatively complex construction and update components to the resource-wealthy management plane. We have a tendency to implemented concise on 3 platforms. Experimental results show that concise uses significantly smaller memory to achieve much faster question speed compared to existing solutions of network name lookups.
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here