Predicting ip addresses to speed up routing lookup
Martha W. Evens, Bohadan Bodnar, George Kraft, Abdullah Ali Bahattab
Abstract
Martha W. Evens, Bohadan Bodnar, George Kraft, Abdullah Ali Bahattab
Abstract
In computer networks, fast routing is one of the main factors, which speed up the transmission of the IP packets from the source to the destination computers. A forwarding table (cache table) and a routing table. The forwarding table is derived from the routing table, which is maintained constantly by the router by using one of the common routing protocols. There are two factors that affect the speed of the forwarding decisions. First, when a forwarding table holds a huge number of IP addresses, a complicated search algorithm is needed, which implies a high search time. Second, the router has a availability of the incoming IP address in the forwarding table (hit rate) reduces the extended search in the routing table. In our study, we look at the IP address streams. We built two models to predict the IP addresses. These models are plugged into the cache system simulation to pre-fetch the IP addresses prior to the router requests. We have a higher hit-ratio comparing to the current cache systems.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In computer networks, fast routing is one of the main factors, which speed up the transmission of the IP packets from the source to the destination computers. A forwarding table (cache table) and a routing table. The forwarding table is derived from the routing table, which is maintained constantly by the router by using one of the common routing protocols. There are two factors that affect the speed of the forwarding decisions. First, when a forwarding table holds a huge number of IP addresses, a complicated search algorithm is needed, which implies a high search time. Second, the router has a availability of the incoming IP address in the forwarding table (hit rate) reduces the extended search in the routing table. In our study, we look at the IP address streams. We built two models to predict the IP addresses. These models are plugged into the cache system simulation to pre-fetch the IP addresses prior to the router requests. We have a higher hit-ratio comparing to the current cache systems.
Key concepts: Virtual routing and forwarding, Routing table, Computer science, IP forwarding, Computer network, Loose Source Routing, Packet forwarding, Equal-cost multi-path routing