A Concise Forwarding Information Base for Scalable and Fast Name Lookups

Simple item page
dc.contributor.authorYu, Ye
dc.contributor.authorBelazzougui, Djamal
dc.contributor.authorQian, Chen
dc.contributor.authorZhang, Qin
dc.date.accessioned2017-12-01T09:13:46Z
dc.date.available2017-12-01T09:13:46Z
dc.date.issued2017-11-30
dc.description.abstractForwarding information base (FIB) scalability and its lookup speed are fundamental problems of numerous net- work 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.fr_FR
dc.identifier.isbn978-1-5090-6501-1fr_FR
dc.identifier.urihttp://dl.cerist.dz/handle/CERIST/902
dc.publisherIEEEfr_FR
dc.relation.ispartofseries25th International Conference on Network Protocols;
dc.relation.pages1-10fr_FR
dc.relation.placeToronto, Ontario, Canadafr_FR
dc.structureCalcul pervasif et mobile (Pervasive and Mobile Computing group)fr_FR
dc.subjectSDNfr_FR
dc.subjectForwardingfr_FR
dc.subjectHashingfr_FR
dc.subjectDynamic FIBfr_FR
dc.subjectRandom Graphsfr_FR
dc.titleA Concise Forwarding Information Base for Scalable and Fast Name Lookupsfr_FR
dc.typeConference paper
Files
Collections
International Conference Papers