Luleå Algorithm

From dankwiki
Jump to navigation Jump to search

A modified trie-based approach for implementing IPv4 routing tables named after Sweden's Luleå University of Technology. It requires very little space, but requires a preprocessing step linear in the input's size each time the table is changed.