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
- Fall '11
- IP address, Computational complexity theory, IP addresses, prefix entries