Abstract
Although IP address lookup schemes using ternary content addressable memory (TCAM) can perform high speed packet forwarding, TCAM is much more expensive than ordinary memory in implementation cost. As a low-cost solution, binary search algorithms such as a binary trie or a binary search tree have been widely studied. This paper proposes an efficient IP address lookup scheme using balanced binary search with minimal entries and optimal prefix vectors. In the previous scheme with prefix vectors, there were numerous pairs of nearly identical entries with duplicated prefix vectors. In our scheme, these overlapping entries are combined, thereby minimizing entries and eliminating the unnecessary prefix vectors. As a result, the small balanced binary search tree can be constructed and used for a software-based address lookup in small-sized routers. The performance evaluation results show that the proposed scheme offers faster lookup speeds along with reduced memory requirements.
| Original language | English |
|---|---|
| Pages (from-to) | 3128-3131 |
| Number of pages | 4 |
| Journal | IEICE Transactions on Communications |
| Volume | E94-B |
| Issue number | 11 |
| DOIs | |
| Publication status | Published - 2011 Nov |
Fingerprint
All Science Journal Classification (ASJC) codes
- Software
- Computer Networks and Communications
- Electrical and Electronic Engineering
Cite this
}
An efficient IP address lookup scheme using balanced binary search with minimal entry and optimal prefix vector. / Park, Hyuntae; Hong, Hyejeong; Kang, Sungho.
In: IEICE Transactions on Communications, Vol. E94-B, No. 11, 11.2011, p. 3128-3131.Research output: Contribution to journal › Article
TY - JOUR
T1 - An efficient IP address lookup scheme using balanced binary search with minimal entry and optimal prefix vector
AU - Park, Hyuntae
AU - Hong, Hyejeong
AU - Kang, Sungho
PY - 2011/11
Y1 - 2011/11
N2 - Although IP address lookup schemes using ternary content addressable memory (TCAM) can perform high speed packet forwarding, TCAM is much more expensive than ordinary memory in implementation cost. As a low-cost solution, binary search algorithms such as a binary trie or a binary search tree have been widely studied. This paper proposes an efficient IP address lookup scheme using balanced binary search with minimal entries and optimal prefix vectors. In the previous scheme with prefix vectors, there were numerous pairs of nearly identical entries with duplicated prefix vectors. In our scheme, these overlapping entries are combined, thereby minimizing entries and eliminating the unnecessary prefix vectors. As a result, the small balanced binary search tree can be constructed and used for a software-based address lookup in small-sized routers. The performance evaluation results show that the proposed scheme offers faster lookup speeds along with reduced memory requirements.
AB - Although IP address lookup schemes using ternary content addressable memory (TCAM) can perform high speed packet forwarding, TCAM is much more expensive than ordinary memory in implementation cost. As a low-cost solution, binary search algorithms such as a binary trie or a binary search tree have been widely studied. This paper proposes an efficient IP address lookup scheme using balanced binary search with minimal entries and optimal prefix vectors. In the previous scheme with prefix vectors, there were numerous pairs of nearly identical entries with duplicated prefix vectors. In our scheme, these overlapping entries are combined, thereby minimizing entries and eliminating the unnecessary prefix vectors. As a result, the small balanced binary search tree can be constructed and used for a software-based address lookup in small-sized routers. The performance evaluation results show that the proposed scheme offers faster lookup speeds along with reduced memory requirements.
UR - http://www.scopus.com/inward/record.url?scp=80155206730&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80155206730&partnerID=8YFLogxK
U2 - 10.1587/transcom.E94.B.3128
DO - 10.1587/transcom.E94.B.3128
M3 - Article
AN - SCOPUS:80155206730
VL - E94-B
SP - 3128
EP - 3131
JO - IEICE Transactions on Communications
JF - IEICE Transactions on Communications
SN - 0916-8516
IS - 11
ER -