Print Email Facebook Twitter Range Trie Software Support for Longest Prefix Match Title Range Trie Software Support for Longest Prefix Match Author Mastrogeorgopoulos, C. Contributor Sourdis, I. (mentor) Faculty Electrical Engineering, Mathematics and Computer Science Department Microelectronics & Computer Engineering Programme Embedded Systems Date 2011-11-08 Abstract The range trie constitutes an advanced address lookup scheme aiming at low lookup throughput, latency and memory requirements. The range trie structure has been enhanced with longest prefix match and updating capabilities in order to simulate the forwarding process performed in network routers. For the main work involved in this thesis we fixed, improved, enhanced the performance and introduced additional functionality to the software implementation of the heuristics which generate high quality range trie configurations based on the bounds extracted from the lookup tables. With our work, the software is capable of producing high quality configurations for a great range of possible range trie hardware implementations, for any address length (IPv4 and IPv6 among others), and for any size of lookup tables in relatively low time. As supplementary work we developed the support software for an IPv4 range trie structure hardware implementation on the HTX reconfigurable platform. The software translates the generated configuration into suitable commands for the software/hardware interface and also offers all the necessary functionality of verifying and maintaining the hardware range trie configuration. Subject range trieaddress lookupHTXlongest prefix match To reference this document use: http://resolver.tudelft.nl/uuid:abbdd03a-0351-4b42-8c1f-f58bb1aae90e Embargo date 2011-11-21 Part of collection Student theses Document type master thesis Rights (c) 2011 Mastrogeorgopoulos, C. Files PDF Charalampos_Mastrogeorgop ... ttable.pdf 2.31 MB Close viewer /islandora/object/uuid:abbdd03a-0351-4b42-8c1f-f58bb1aae90e/datastream/OBJ/view