@inproceedings{8cbef54f44be4fbe89a06b047790150b,
title = "Implementation of a parallel-search trie-based scheme for fast IP lookup",
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.",
keywords = "Hashing, Parallel search, Prefix expansion, RAM based., Trie search",
author = "Roberto, {Rojas Cessa} and Laksmi Ramesh and Ziqian Dong and Brian D'Alessandro",
year = "2007",
language = "English (US)",
isbn = "9780889867024",
series = "Proceedings of the IASTED International Conference on Communication Systems, Networks, and Applications, CSNA 2007",
pages = "54--56",
booktitle = "Proceedings of the IASTED International Conference on Communication Systems, Networks, and Applications, CSNA 2007",
note = "International Association of Science and Technology for Development, IASTED ; Conference date: 08-10-2007 Through 10-10-2007",
}