IP Lookup on a Platform FPGA: A Comparative Study

Authors:
Dennis Bemmann
Affiliations:
Humboldt University, Berlin, Germany
Venue:
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04
Year:
2005

Citing 5
Cited 0

Small forwarding tables for fast routing lookups

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Scalable high speed IP routing lookups

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Single-Chip Gigabit Mixed-Version IP Router on Virtex-II Pro

FCCM '02 Proceedings of the 10th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
Tree bitmap: hardware/software IP lookups with incremental updates

ACM SIGCOMM Computer Communication Review
Time-Critical Software Deceleration in an FCCM

FCCM '04 Proceedings of the 12th Annual IEEE Symposium on Field-Programmable Custom Computing Machines

Quantified Score

Hi-index	0.00

Visualization

Abstract

The efficient use of present resources is an important challenge in the design of embedded systems based on a platform FPGA. This paper discusses algorithms for IP lookup focusing on comparability and tradeoffs, rather than maximum performance. A hashing-based algorithm and a tree-based algorithm as examples for the two most common classes of IP lookup approches are investigated with regard to their implementation in programmable logic, their resource use and their performance, measured in lookup time. Through simulations it is determined how performance varies with changed resource availabity. A comparison also takes into account processor-based approaches and discusses use cases for the different implementations.