CommBench - RTR |
Description:RTR performs radix tree routing lookups. In a first step, an internal representation of the routing tree has to be created. For this purpose, all routing prefixes are loaded and processed. In the main portion of the program, routing lookups are performed. The program is based on the routing algorithm used in the NetBSD implementation and was 'extracted' from there by Srinivasan Venkatachary. Input:A file with routing prefixes (the default file contains 32239 entries) and a file with IP addresses in hexadecimal representation (the default file contains also 32239 entries). Notes:To amortize the cost of building the tree, each address lookup repeated 100 times. |
© 2000, Washington University, see software
copyright notice. |