发明授权
US08325721B2 Method for selecting hash function, method for storing and searching routing table and devices thereof
有权
用于选择散列函数的方法,存储和搜索路由表的方法及其装置
- 专利标题: Method for selecting hash function, method for storing and searching routing table and devices thereof
- 专利标题(中): 用于选择散列函数的方法,存储和搜索路由表的方法及其装置
-
申请号: US12511558申请日: 2009-07-29
-
公开(公告)号: US08325721B2公开(公告)日: 2012-12-04
- 发明人: Jun Gong , Chong Zhan , Hongfei Chen , Rui Hu , Jian Zhang , Hunghsiang Jonathan Chao , Hao Su , Xiaozhong Wang , Tuanhui Sun
- 申请人: Jun Gong , Chong Zhan , Hongfei Chen , Rui Hu , Jian Zhang , Hunghsiang Jonathan Chao , Hao Su , Xiaozhong Wang , Tuanhui Sun
- 申请人地址: CN Shenzhen
- 专利权人: Huawei Technologies Co., Ltd.
- 当前专利权人: Huawei Technologies Co., Ltd.
- 当前专利权人地址: CN Shenzhen
- 代理机构: Brinks Hofer Gilson & Lione
- 优先权: CN200810213963 20080901
- 主分类号: H04L12/28
- IPC分类号: H04L12/28 ; H04L12/56
摘要:
A method for selecting a hash function, a method for storing and searching a routing table and devices thereof are provided. The method for selecting a hash function includes: hashing data to be hashed by using a current alternative hash function; decoding a hash result; accumulating decoded results until no carry occurs during the accumulation; and selecting a current alternative hash function with no carry generated as a formal hash function. The method for storing a routing table includes: dividing the routing table into a next-level node pointer portion and a prefix portion for being stored; and selecting a hash function by using the above method for selecting a hash function. The method for searching a routing table includes: directly searching an IP address to be searched according to a directly stored length of a next-level node pointer portion for storing the routing table; and reading a prefix node according to a searched result. Thus, hash collision can be avoided, and memory resources occupied by the routing table can be effectively reduced.
公开/授权文献
信息查询