Browsing Mathematics (Faculty of) by Subject "tree knapsack problem"
Now showing items 1-1 of 1
-
The application of the in-tree knapsack problem to routing prefix caches
(University of Waterloo, 2009-04-30)Modern routers use specialized hardware, such as Ternary Content Addressable Memory (TCAM), to solve the Longest Prefix Matching Problem (LPMP) quickly. Due to the fact that TCAM is a non-standard type of memory and ...