The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Dec. 04, 2012
Filed:
Jul. 29, 2009
Jun Gong, Shenzhen, CN;
Chong Zhan, Shenzhen, CN;
Hongfei Chen, Shenzhen, CN;
Rui HU, Shenzhen, CN;
Jian Zhang, Shenzhen, CN;
Hunghsiang Jonathan Chao, Holmdel, NJ (US);
Hao Su, Shenzhen, CN;
Xiaozhong Wang, Shenzhen, CN;
Tuanhui Sun, Shenzhen, CN;
Jun Gong, Shenzhen, CN;
Chong Zhan, Shenzhen, CN;
Hongfei Chen, Shenzhen, CN;
Rui Hu, Shenzhen, CN;
Jian Zhang, Shenzhen, CN;
Hunghsiang Jonathan Chao, Holmdel, NJ (US);
Hao Su, Shenzhen, CN;
Xiaozhong Wang, Shenzhen, CN;
Tuanhui Sun, Shenzhen, CN;
Huawei Technologies Co., Ltd., Shenzhen, CN;
Abstract
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.