Claim: The Luleå algorithm enables the simplified lookup in the Luleå trie using only 4 or 5 bytes per entry for large routing tables.
Evidence: The main advantage of the Luleå algorithm for the routing task is that it uses very little memory, averaging 4–5 bytes per entry for large routing tables. This enables the simplified lookup in the Luleå trie ().