A New Algorithm for IP LookUp

碩士 === 國立東華大學 === 資訊工程學系 === 91 === Recently, the Internet has become more and more popular and the number of hosts is growing rapidly. We will have two serious problems. First, the bandwidth of the network is not enough. Second, the number of IP addresses is not enough for distribution. Generally,...

Full description

Bibliographic Details
Main Authors: Seiven Leu, 呂西文
Other Authors: Ruay-Shiung Chang
Format: Others
Language:en_US
Published: 2002
Online Access:http://ndltd.ncl.edu.tw/handle/11616018903710659606
Description
Summary:碩士 === 國立東華大學 === 資訊工程學系 === 91 === Recently, the Internet has become more and more popular and the number of hosts is growing rapidly. We will have two serious problems. First, the bandwidth of the network is not enough. Second, the number of IP addresses is not enough for distribution. Generally, we will use fibers in the backbone of the network to solce the first problem. On the other hand, to solve the second problem, IPv6 expands the length of IP address from 32-bit to 128-bit. It seems that we have solved the above two serious problems. But when we improve the transmission speed of the network, the 128-bit length IP address will cause some problems. It is easy to see that the bottleneck of the network will be in the router. IP address lookup in the routing table is an obvious problem. Slow IP address lookup will delay the packet forwarding in the router and degrade the network performance. In the paper, we will present a new and simple algorithm for accelerating the IP Lookup.