Value-Coded Trie Structure for High-Performance IPv6 Lookup

Basit Öğe Kaydı
dc.authorwosidLe, Hoang/IST-1811-2023
dc.authorwosiderdem, oğuzhan/AAG-6229-2019
dc.contributor.authorErdem, Oguzhan
dc.contributor.authorCarus, Aydin
dc.contributor.authorLe, Hoang
dc.date.accessioned2024-06-12T11:16:42Z
dc.date.available2024-06-12T11:16:42Z
dc.date.issued2015
dc.departmentTrakya Üniversitesien_US
dc.description.abstractDynamically updateable and memory-efficient search structures for Internet protocol (IP) lookup have lately attracted a great deal of attention from the researchers. In this paper, we focus on the next-generation IPv6 routing protocol comprising large and sparsely distributed routing tables. The existing data structures either suffer from inefficient resource and memory usage (trie-based algorithms), or require complicated construction processes such as converting routing prefixes into their longer representatives and sorting (tree-based algorithms), or both. We propose a novel data structure denoted value-coded trie (VC-trie) for IP lookup. VC-trie provides significant memory saving in comparison with that of the existing solutions in both IPv4 and IPv6 domains. Thereby, our structure can support longer prefix lengths and larger routing tables. We also design an static random access memory (SRAM)-based pipelined architecture to assist the VC-trie structure to improve the throughput. The architecture is implemented utilizing a state-of-the-art field programmable gate array (FPGA) device and sustainable throughput of 448 million lookups per second (with a routing table consisting of 324K prefixes) is achieved. Furthermore, the architecture can be enhanced with external SRAMs to relax the limitations of the existing FPGA device in on-chip memory.en_US
dc.identifier.doi10.1093/comjnl/bxt153
dc.identifier.endpage214en_US
dc.identifier.issn0010-4620
dc.identifier.issn1460-2067
dc.identifier.issue2en_US
dc.identifier.scopus2-s2.0-84922445340en_US
dc.identifier.scopusqualityQ2en_US
dc.identifier.startpage204en_US
dc.identifier.urihttps://doi.org/10.1093/comjnl/bxt153
dc.identifier.urihttps://hdl.handle.net/20.500.14551/24407
dc.identifier.volume58en_US
dc.identifier.wosWOS:000350220200003en_US
dc.identifier.wosqualityQ2en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherOxford Univ Pressen_US
dc.relation.ispartofComputer Journalen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectTrieen_US
dc.subjectLongest Prefix Matchen_US
dc.subjectPipelineen_US
dc.subjectIP Lookupen_US
dc.subjectPacket Forwardingen_US
dc.subjectIpv4/V6 Lookupen_US
dc.titleValue-Coded Trie Structure for High-Performance IPv6 Lookupen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu