A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
IP Lookup Using the Novel Idea of Scalar Prefix Search with Fast Table Updates
2010
IEICE transactions on information and systems
Recently, we have proposed a new prefix lookup algorithm which would use the prefixes as scalar numbers. This algorithm could be applied to different tree structures such as Binary Search Tree and some other balanced trees like RB-tree, AVL-tree and B-tree with minor modifications in the search, insert and/or delete procedures to make them capable of finding the prefixes of an incoming string e.g. an IP address. As a result, the search procedure complexity would be O(log n) where n is the
doi:10.1587/transinf.e93.d.2932
fatcat:7rgqcdhqsrclrhakytoor7p73i