Efficient binary search for IP address lookup

@article{Yim2005EfficientBS,
  title={Efficient binary search for IP address lookup},
  author={Changhoon Yim and Bomi Lee and Hyesook Lim},
  journal={IEEE Communications Letters},
  year={2005},
  volume={9},
  pages={652-654}
}
As an essential function in Internet routers, address lookup determines overall router performance. The most important performance metric in software-based address lookup is the number of memory accesses since it is directly related to lookup time. This letter proposes an algorithm to perform efficient binary search for IP address lookup. The depth of the proposed binary tree is very close to the minimum bound, and hence it results in much smaller number of worst case memory accesses compared… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 17 CITATIONS

Similar Papers

Loading similar papers…