CS 636: Spring 2008
Programming Assignment 2 : IP lookups using a uni-bit trie.
Deadline : Apr 3rd -- 9am
Implement the IP lookup algorithm using unibit tries we have discussed
in the class using a program (in C, Java, or C++).
The input to the IP lookup algorithm is a database that has the fields
<ID, prefix, mask, next hop> one per line. The goal is to
input this database and store it in a fashion such that it is amenable
towards fast lookups.
Here are three files provided:
While I do not care about the language you choose to implement your
algorithm, I want to care about the amount of time it takes to output
your results. To promote the use of efficient data structures, I would
do the following. I will award 5 extra points for the submission that
has the best timing among all the submissions for a test suite,
different than the one that I am giving you as a sample input.
This assignment will count 10%
towards your grade.
Please no cheating or downloading any IP lookup algorithms publicly
available. It will not be worth your cause.