'Binary trie' diaporamas de présentation

Routing Lookups and Packet Classification: Theory and Practice

Routing Lookups and Packet Classification: Theory and Practice. August 18, 2000 Hot Interconnects 8. Pankaj Gupta Department of Computer Science Stanford University pankaj@stanford.edu http://www.stanford.edu/~pankaj. Tutorial Outline. Introduction What this tutorial is about

1.8k views • 151 slides

15-211 Fundamental Data Structures and Algorithms

1.17k views • 95 slides

Binary Tries (continued)

Binary Tries (continued). split(k) . Similar to split algorithm for unbalanced binary search trees. Construct S and B on way down the trie. Follow with a backward cleanup pass over the constructed S and B. x. a. b. a. Forward Pass.

395 views • 37 slides

Higher Order Tries

0. 1. 2. 3. 4. 5. 6. 7. 8. 9. Higher Order Tries. Key = Social Security Number. 441-12-1135 9 decimal digits. 10 -way trie (order 10 trie). Height <= 10. Social Security Trie. 10 -way trie Height <= 10 . Search => <= 9 branches on digits plus 1 compare. 100 -way trie

390 views • 24 slides

Higher Order Tries

0. 1. 2. 3. 4. 5. 6. 7. 8. 9. Higher Order Tries. Key = Social Security Number. 441-12-1135 9 decimal digits. 10 -way trie (order 10 trie). Height <= 10. Social Security Trie. 10 -way trie Height <= 10 . Search => <= 9 branches on digits plus 1 compare. 100 -way trie

251 views • 24 slides

Supernetting

Supernetting. Recall: subnetting allows an organization to share a single IP network address among multiple physical networks Supernetting (a.k.a. classless addressing ) allows the addresses assigned to an organization to span multiple IP network addresses.

1.14k views • 23 slides