Implementation of a parallel-search trie-based scheme for fast IP lookup

Document Type

Conference Proceeding

Publication Date

12-1-2007

Abstract

The Internet Protocol (IP) address lookup is required to be resolved fast to keep up with data rate increases. To cope with the increasing number of entries, solutions for IP lookup based on random access memory (RAM), which store prefixes in a trie-based structure, are of interest. In this paper, we propose a flexible and fast trie-based IP lookup algorithm where parallel searching is performed. This algorithm performs lookup in a maximum of two memory-access times while using a feasible amount of memory.

Identifier

78650760255 (Scopus)

ISBN

[9780889867024]

Publication Title

Proceedings of the IASTED International Conference on Communication Systems Networks and Applications Csna 2007

First Page

54

Last Page

56

This document is currently not available here.

Share

COinS