Self-adjusting scheme for high speed routers
Nizar Ben Neji, Adel Bouhoula · 2008
Many schemes of high-performance IP address lookup have been proposed recently. But most of them do not process dynamically the packets and give no specific interest in the skewness of the traffic. Hence, the lack of dynamic packet routing algorithms has been the motivation for this research. In this paper, we have conceived a self-adjusting tree filter, by combining the scheme of binary search on prefix length with the splay tree model. Consequently, we have at most 2 hash accesses for all consecutive values. We give also a special interest in the amount of packets treated then routed through the default route entry. Those packets present an important part of the traffic treated by the routers and they might cause more harm than others as they traverse a long decision path before they are finally sent to the default route.