An Efficient IP address Lookup Algorithm Using a Priority-Trie

IP 주소 검색을 위한 Priority Trie

  • Lim, Hye-Sook (Information Electronics Engineering Department Ewha Womans University) ;
  • Mun, Ju-Hyoung (Information Electronics Engineering Department Ewha Womans University)
  • 임혜숙 (이화여자대학교 정보통신학과) ;
  • 문주형 (이화여자대학교 정보통신학과)
  • Published : 2006.06.21

Abstract

Fast IP address lookup in routers is essential to achieve packet forwarding in wire-speed. The longest prefix matching for IP address lookup is more complex than exact matching because of its dual dimensions, length and value. By thoroughly studying the current proposals for IP address lookup, we find out that the binary search could be a low-cost solution while providing high performance. Most of the existing binary search algorithms based on trie have simple data structures which can be easily implemented, but they have some problems because of empty internal nodes. The proposed algorithm is based on trie structure, but empty internal nodes are replaced by priority prefixes. The best-matching-prefix search in the proposed algorithm is more efficiently performed since search can be finished earlier when input is matched with a priority prefix. The performance evaluation results show that the constructed priority-trie has very good performance in the lookup speed and the scalability.

Keywords