The Lule algorithm, a technique for storing and searching internet routing tables efficiently, enables the simplified lookup in the Lule trie using only 4 or 5 bytes per entry for large routing tables.
The Lulea algorithm of computer science, designed by , is a technique for storing and searching internet routing tables efficiently. This enables the simplified lookup in the Lulea trie (). The main advantage of the Lulea algorithm for the routing task is that it uses very little memory, averaging 45 bytes per entry for large routing tables. 
