{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

572hw1 - If you can find something that you like in the...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Homework Assignment 1 Lookup of IP Addresses Assigned Date: September 2, 2009 Due Date: September 28, 2009 In the class, we discussed various issues related to the lookup of stored IP addresses in the routers. In this assignment, you should first implement the basic binary tree for the 50,000 prefix entries given in the file named “prefix”. Then use the destination addresses shown in the file named “input” and decide the routing destinations for the 20 packets in the “input” file. These are both “.doc” files. Based on the understanding you acquired from this exercise, I ask you to come up with another implementation of data structure that organizes the prefix entries, which presumably improves the performance over the original binary tree. To be clear, I am not necessarily asking you to come up with an original new idea.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: If you can find something that you like in the literature, you may consider implementing it. You should work in groups of two. I expect a group report that contains the details of your implementations and the performance statistics you collected during the run. The “performance” can mean a lot of difference things. Examples are average depth of the trees or tries, storage requirements, accuracy of the results, algorithmic complexity, and the scalability when the prefix entries grow to over 1 million as in the case of today’s routers. Your report should be no more than 10 pages (font size 11 or larger) and should be readable with the important main point highlighted. I don’t have any specific format in mind, and you should exercise your best judgment....
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online