Content deleted Content added
#suggestededit-add-desc 1.0 Tags: Mobile edit Mobile app edit Android app edit |
Rescuing 1 sources and tagging 0 as dead.) #IABot (v2.0.9.5) (Whoop whoop pull up - 21723 |
||
Line 1:
{{Short description|Technique for storing and searching internet routing tables}}
The '''Luleå algorithm''' of [[computer science]], designed by {{harvtxt|Degermark|Brodnik|Carlsson|Pink|1997}}, is a technique for storing and searching [[internet]] [[routing table]]s efficiently. It is named after the [[Luleå University of Technology]], the home institute/university of the technique's authors. The name of the algorithm does not appear in the original paper describing it, but was used in a message from [[Craig Partridge]] to the [[Internet Engineering Task Force]] describing that paper prior to its publication.<ref>"[http://www1.ietf.org/mail-archive/web/ietf/current/msg01795.html second Europe trip for IETFers...] {{Webarchive|url=https://web.archive.org/web/20120819061509/http://www.ietf.org/mail-archive/web/ietf/current/msg01795.html |date=2012-08-19 }}", Craig Partridge to IETF, May 1, 1997.</ref>
The key task to be performed in internet routing is to match a given [[IPv4]] [[IP address|address]] (viewed as a sequence of 32 bits) to the longest [[prefix]] of the address for which routing information is available. This prefix matching problem may be solved by a [[trie]], but trie structures use a significant amount of space (a [[Node (computer science)|node]] for each bit of each address) and searching them requires traversing a sequence of nodes with length proportional to the number of bits in the address. The Luleå algorithm shortcuts this process by storing only the nodes at three levels of the trie structure, rather than storing the entire trie.
| |||