الفهرس 
IntroductionOnly 14 pages are availabe for public view
 |  | from | 136 |  |  |
| | | from | 136 | | |
Abstract
Dynamic routing is used to permit multiple routes for a packet to reach its final destination. In dynamic routing, the routing table is called a dynamic routing table and this table changes as network conditions change.The tables change according to network traffic. When the traffic increases the lookup time increases, so the search field of minimizing the lookup time appeared using different route lookup algorithms. Previous work of route lookup algorithms included (early lookup schemes, multiary trie, controlled prefix expansion , LCtrie , the lulea algorithm , Binary search on prefix lengths, binary search on intervals represented by prefixes and load balancing).It is concluded that minimizing lookup time in routing tables is a rich and important field for research. This work presents a new view of the routing table structure to speedup IP lookup operation by using technique called Rapidbase techniques.RapidBase is a database system tuned to the needs of handling measurement data in modern industrial applications. Properties of RapidBase allow to introduce a new routing table built using RQL (Rapidbase Query Language) instead of SQL(structured query language) , the difference of the structure between the current routing table and Rapidbase routing table is the lookup operation in Rapidbase routing table is more faster because it abbreviates the step of the search by one bit by bit manipulation and there is no need to search in all prefixes at one time. A comparative study is made between the proposed technique and the common route lookup algorithms at different values of T (bit by bit manipulation) the results obtained show that the RapidBase Routing table has the less lookup time.