发明名称 |
Linked list traversal with reduced memory accesses |
摘要 |
A linked list traversal system identifies when a linked list has become inefficient, either through attack or an undue multiplicity of collisions. A data unit is parsed to extract a key. A first hash result associated with the key is calculated based on a first hash function. A first linked list is identified based on the first hash result. It is determined whether the first linked list has been compromised. A second hash result associated with the key is calculated based on a second hash function when the first linked list has been compromised. A second linked list is established based on the second hash result, where the second hash result is different from the first hash result.
|
申请公布号 |
US7600094(B1) |
申请公布日期 |
2009.10.06 |
申请号 |
US20060427952 |
申请日期 |
2006.06.30 |
申请人 |
JUNIPER NETWORKS, INC. |
发明人 |
JIN XIANGDONG;LUO DONGPING;WEI WEN |
分类号 |
G06F9/26;G06F9/34;G06F17/00 |
主分类号 |
G06F9/26 |
代理机构 |
|
代理人 |
|
主权项 |
|
地址 |
|