An efficient IP address lookup algorithm based on a small balanced tree using entry reduction

Park, Hyuntae; Hong, Hyejeong; Kang, Sungho

doi:10.1016/j.comnet.2011.09.004

Cited by 5 publications

(3 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some of them compress the trie for decreasing the memory consumption and improving the speed [1][2], [19][20][21]. Since a binary trie needs lots of comparisons and memory accesses, many solutions use multibit trie concept to accelerate the lookup search [3][4][5][6][7][8][9][10][11][12][13]; however, using a multi-bit trie instead of binary trie normally increases the memory consumption.…”

Section: E Related Workmentioning

confidence: 99%

Tree-Combined Trie: A Compressed Data Structure for Fast IP Address Lookup

Tahir¹,

Ahmed²

2015

ijacsa

View full text Add to dashboard Cite

Abstract-For meeting the requirements of the high-speed Internet and satisfying the Internet users, building fast routers with high-speed IP address lookup engine is inevitable. Regarding the unpredictable variations occurred in the forwarding information during the time and space, the IP lookup algorithm should be able to customize itself with temporal and spatial conditions. This paper proposes a new dynamic data structure for fast IP address lookup. This novel data structure is a dynamic mixture of trees and tries which is called TreeCombined Trie or simply TC-Trie. Binary sorted trees are more advantageous than tries for representing a sparse population while multibit tries have better performance than trees when a population is dense. TC-trie combines advantages of binary sorted trees and multibit tries to achieve maximum compression of the forwarding information. Dynamic reconfiguration of TCtrie, made it capable of customizing itself along the time and scaling to support more prefixes or longer IPv6 prefixes. TC-trie provides a smooth transition from current large IPv4 databases to the large IPv6 databases of the future Internet.

show abstract

Section: E Related Workmentioning

confidence: 99%

Tree-Combined Trie: A Compressed Data Structure for Fast IP Address Lookup

Tahir¹,

Ahmed²

2015

ijacsa

View full text Add to dashboard Cite

show abstract

“…al. [7] proposes a method to reduce the number of empty nodes. However this method is applied to balanced binary trie.…”

Section: Related Workmentioning

confidence: 99%

“…The performance evaluation of the software-based algorithms is performed according to certain standards [2]. The lookup and update speeds are evaluated by the worst case number of memory accesses.…”

Section: Lookup Approaches and Implementationsmentioning

confidence: 99%