High-speed sorted-table search scheme for network processing

We propose a scheme for quickly completing a sorted-table search, which is one of most common searches employed in network processing. In the scheme, the range to be searched is narrowed using only a simple calculation. This narrowing is incorporated into conventional search procedures such as binary search. Simulation results show that our proposed approach reduces the number of times element values are read from the table, which results in faster search.