Manipulation of Information and Data via Intranet
Mohamed Abd Elhamid Abbas;
Abstract
In complex intranets, dynamic routing is required. Dynamic routing is us.ed to permit multiple routes for a packet to reach its final destination. Dynamic routing also allows routers to change the way they route information based on the amount of network traffic on some paths and routers. In dynamic routing, the routing table is called a dynamic routing table and changes as network conditions change, The tables are buiit dynamically by routing protocols, and so constantly 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, multi-ary trie, controlled prefix expansion , LC-ttie , the lulea algorithm , Binary search on prefix lengths, binary search on intervals represented by prefixes and load balancing). 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 internet protocol IP lookup operation by using technique called Rapidl_)ase techniques, this technique also, overcomes the problems of the previous work such as
• Achieve high throughput by using pre-computation and trading off storage space with lookup time.
• High storage requirements.
• • Slow update time.
. • Difficulty of longest prefix matching.
RapidBase is a database system tuned to the needs of handling measurement data in modern industrial applications.
Properties ofRapidbase allow to introduce a new routing table built using RQL (Rapidbase Query Language), the difference of the structure between the current routing table and Rapidbase routing tabie describes that the lookup operation in Rapidbase routing table more fast because it • abbreviates some steps.
Advantages of RapidBase routing table can be summarized as fo1low:
1- Small lookup time.
2- Fast update time.
3- Small number of prefix matches.
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, multi-ary trie, controlled prefix expansion , LC-ttie , the lulea algorithm , Binary search on prefix lengths, binary search on intervals represented by prefixes and load balancing). 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 internet protocol IP lookup operation by using technique called Rapidl_)ase techniques, this technique also, overcomes the problems of the previous work such as
• Achieve high throughput by using pre-computation and trading off storage space with lookup time.
• High storage requirements.
• • Slow update time.
. • Difficulty of longest prefix matching.
RapidBase is a database system tuned to the needs of handling measurement data in modern industrial applications.
Properties ofRapidbase allow to introduce a new routing table built using RQL (Rapidbase Query Language), the difference of the structure between the current routing table and Rapidbase routing tabie describes that the lookup operation in Rapidbase routing table more fast because it • abbreviates some steps.
Advantages of RapidBase routing table can be summarized as fo1low:
1- Small lookup time.
2- Fast update time.
3- Small number of prefix matches.
Other data
| Title | Manipulation of Information and Data via Intranet | Other Titles | معالجة المعلومات والبيانات خلال الشبكات | Authors | Mohamed Abd Elhamid Abbas | Issue Date | 2002 |
Attached Files
| File | Size | Format | |
|---|---|---|---|
| B11213.pdf | 483.23 kB | Adobe PDF | View/Open |
Similar Items from Core Recommender Database
Items in Ain Shams Scholar are protected by copyright, with all rights reserved, unless otherwise indicated.