Multi Inherited Search Trie for IP Lookup and Update

摘要

IP lookup and routing table update will affects the speed of the router to forward packets In this paper a new data structure of dynamic router table is proposed for IP lookup and updates called Multi Inherited Search Trie (MIST) By partition each prefix with a index value and removing the relationship of prefixes we can perform an IP look operation efficiently Since we choose prefix trie (PT) for our substructure the memory consumption and dynamic router-table operations can also be performed efficiently Experiments using real IPv4 routing databases indicate that Multi Inherited Search Trie is efficient in memory usage and performs well in terms of lookup insert and delete operations

獎項日期	2014 9月 1
原文	English
監督員	Sun-Yuan Hsieh (Supervisor)