Dynamic Multiway Segment Tree for IP Lookups and the Fast Pipelined Search Engine

—A dynamic multiway segment tree (DMST) is proposed for IP lookups in this paper. DMST is designed for dynamic routing tables that can dynamically insert and delete prefixes. DMST is implemented as a B-tree that has all distinct end points of ranges as its keys. The complexities of search, insertion, deletion, and memory requirement are the same as the existing multiway range tree (MRT) and prefix in B-tree (PIBT) for prefixes. In addition, a pipelined DMST search engine is proposed to further speed up the search operations. The proposed pipelined DMST search engine uses off-chip SRAMs instead of on-chip SRAMs because the capacity of the latter is too small to hold large routing tables and the cost of the latter is too expensive. By utilizing current FPGA and off-chip SRAM

• Type: Journal
• Year: 2010
• Where: TC
• Authors: Yeim-Kuan Chang, Yung-Chieh Lin, Cheng-Chien Su
• Keywords: DMST Search Engine, Information Technology, Routing Tables, TC 2010, —A Dynamic Multiway