Abstract
This letter proposes a fast IP address lookup algorithm based on search space reduction. Prefixes are classified into three types according to the nesting relationship and a large forwarding table is partitioned into multiple small trees. As a result, the search space is reduced. The results of analyses and experiments show that the proposed method offers higher lookup and updating speeds along with reduced memory requirements.
Original language | English |
---|---|
Pages (from-to) | 1009-1012 |
Number of pages | 4 |
Journal | IEICE Transactions on Communications |
Volume | E93-B |
Issue number | 4 |
DOIs | |
Publication status | Published - 2010 |
All Science Journal Classification (ASJC) codes
- Software
- Computer Networks and Communications
- Electrical and Electronic Engineering