The Lule algorithm enables the simplified lookup in the Lule trie using only 4 or 5 bytes per entry for large routing tables.
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. This enables the simplified lookup in the Lulea trie (). 
