文件名称:B01AB525d01
下载
别用迅雷、360浏览器下载。
如迅雷强制弹出，可右键点击选“另存为”。
失败请重下，重下不扣分。
如迅雷强制弹出，可右键点击选“另存为”。
失败请重下，重下不扣分。
介绍说明－－下载内容均来自于网络，请自行研究使用
The problem of efficient data structures for IP
lookups has been well studied in literature. Techniques such as
LC tries and Extensible Hashing are commonly used. In this
paper, we address the problem of generalizing LC tries and
Extensible Hashing, based on traces of past lookups, to provide
performance guarantees for memory sub-optimal structures. As
a specific example, if a memory-optimal (LC) trie takes 6MB and
the total memory at the router is 8MB, how should the trie be
modified to make best use of the 2 MB of excess memory? We
present a greedy algorithm for this problem and prove that, if
for the optimal data structure there are b fewer memory accesses
lookups has been well studied in literature. Techniques such as
LC tries and Extensible Hashing are commonly used. In this
paper, we address the problem of generalizing LC tries and
Extensible Hashing, based on traces of past lookups, to provide
performance guarantees for memory sub-optimal structures. As
a specific example, if a memory-optimal (LC) trie takes 6MB and
the total memory at the router is 8MB, how should the trie be
modified to make best use of the 2 MB of excess memory? We
present a greedy algorithm for this problem and prove that, if
for the optimal data structure there are b fewer memory accesses
相关搜索： trie
(系统自动生成,下载前可以参看下载内容)
下载文件列表
B01AB525d01.pdf