Binary search on levels using a Bloom filter for IPv6 address lookup

Lim, Kyuhee; Park, Kyunghye; Lim, Hyesook

doi:10.1145/1882486.1882534

Cited by 9 publications

(2 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [15], the authors propose the construction of hash tables with different lengths and searching order in each table is defined based on structure of binary search trie. Meanwhile, [16,17] launched the idea of using the hash which is associated with bloom filter model for packets classification.…”

Section: Vietnam Academy Of Science and Technologymentioning

confidence: 99%

A Packet Classification Algorithm on Multi-Way Priority Trie

Nhat¹,

Manh²

2017

JCC

View full text Add to dashboard Cite

Abstract. Packet classification is a vital function of network devices such as routers, firewalls, IPS, IDS, etc. Speed of packet classification is a key factor that decides to bandwidth of a network equipment. The field of packet classification speed enhancement has attracted a significant number of researchers. In this paper, we propose a packet classification algorithm based on the idea of priority trie and multi-way trie. The accuracy and efficiency of the proposed algorithm are both theoretically and experimentally proved.

show abstract

Section: Vietnam Academy Of Science and Technologymentioning

confidence: 99%

A Packet Classification Algorithm on Multi-Way Priority Trie

Nhat¹,

Manh²

2017

JCC

View full text Add to dashboard Cite

show abstract

“…Another major drawback is the selection of the perfect hash function, which again depends on the routing table data. There has been some recent research on bloom filters [13][14][15] which provide some hardware solution. TCAMs are used in some high performance routers but they are not scalable towards large routing data.…”

Section: Some Research Directionsmentioning

confidence: 99%

Data Structures for IP Lookups, A Comparative Analysis with Scalability to IPV6

Ghosh

Das

Majumdar

2014

Intelligent Computing, Networking, and Informatics

View full text Add to dashboard Cite

IP forwarding is a process where the routing table needs to be looked up to find which output port a packet should be forwarded through. To search the routing table efficiently we need to represent the routing table by a good data structure which is the major challenge for research in IP forwarding. Three major approaches have been proposed over the years namely Trie-based algorithms (which use linear search on prefix values), binary search on prefix values and binary search on prefix lengths. This paper compares the performance of these approaches and discusses their scalability to IPV6.

show abstract