Memory-Efficient and Ultra-Fast Network Lookup and Forwarding Using Othello Hashing

Simple item page
dc.contributor.authorYu, Ye
dc.contributor.authorBelazzougui, Djamal
dc.contributor.authorQian, Chen
dc.contributor.authorZhang, Qin
dc.date.accessioned2018-06-18T07:21:40Z
dc.date.available2018-06-18T07:21:40Z
dc.date.issued2018-04-11
dc.description.abstractAbstract: 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.fr_FR
dc.identifier.issn1063-6692fr_FR
dc.identifier.urihttp://dl.cerist.dz/handle/CERIST/921
dc.publisherIEEEfr_FR
dc.relation.ispartofseriesIEEE/ACM Transactions on Networking;Volume 26, Issue 3
dc.relation.pages1151-1164fr_FR
dc.structureCalcul pervasif et mobile (Pervasive and Mobile Computing group)fr_FR
dc.subjectSwitchesfr_FR
dc.subjectData structuresfr_FR
dc.subjectRoutingfr_FR
dc.subjectIP networksfr_FR
dc.subjectSoftwarefr_FR
dc.titleMemory-Efficient and Ultra-Fast Network Lookup and Forwarding Using Othello Hashingfr_FR
dc.typeArticle
Files
Collections
International Journal Papers