1 / 12

Priority Tries for IP Address Lookup

Priority Tries for IP Address Lookup. Author ： Hyesook Lim, Changhoon Yim , and Earl E. Swartzlander , Jr., Fellow Publisher ： IEEE TRANSACTIONS ON COMPUTERS, VOL. 59, NO. 6, JUNE 2010 Presenter ： Yu-To Chen Date ： 2011/09/21. Outline. INTRODUCTION THE PROPOSED ALGORITHM

hong
Download Presentation

Priority Tries for IP Address Lookup

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Priority Tries for IP Address Lookup Author：Hyesook Lim, ChanghoonYim, and Earl E. Swartzlander, Jr., Fellow Publisher：IEEE TRANSACTIONS ON COMPUTERS, VOL. 59, NO. 6, JUNE 2010 Presenter：Yu-To Chen Date：2011/09/21

  2. Outline • INTRODUCTION • THE PROPOSED ALGORITHM • range representation of prefixes • priority tries • PERFORMACE ANALYSIS AND SIMULATION

  3. Introduction • In this range representation, prefixes are represented as ranges on a number line between 0 and 1 without expanding to the maximum length • The priority trie is based on the trie structure, with empty internal nodes in the trie replaced by the priority prefix which is the longest among those in the subtrie rooted by the empty nodes.

  4. range inclusion problem. The prefix can be represented as a half-open range : range(prefix)=[lower bound , upper bound) 其中 , 為prefixlength

  5. Insert 規則 • 1.先將prefix排序由長到短排序(等長度隨機) • 2.從root開始放,最長的放root(第0層),之後的由第一個位元開始依照0或1往左右走,遇到空的點或是該點為priority nood(白點)且prefix被自己包含即放入, 並設為priority nood • 3.若是層級剛好等於prefix長度,則設為ordinary nood (黑點)並佔據那一格

  6. Insert prefix : 1001101*

  7. Delete node : 10011*

  8. The entry width of the routing table can be designed with 39 bits (1 bit for the node identity, i.e., priority node or ordinary node, 25 bits for the prefix considering that the shortest prefix length is 8 bits, 5 bits for the prefix length, and 8 bits for routing information) plus two fields for child pointers. • The number of bits for the child pointers depends on the size of routing data set.

More Related