Journal of Systems Engineering and Electronics ›› 2009, Vol. 31 ›› Issue (3): 697-701.

Previous Articles     Next Articles

Improvement of binary lookup algorithm of Hash addresses based on CIDR list

DU Hui-jun, YANG Ning   

  1. Coll. of Electronics Engineering and Information, Guangdong Polytechnic Normal Univ., Guangzhou 510665, China
  • Received:2007-10-26 Revised:2008-04-23 Online:2009-03-20 Published:2010-01-03

Abstract: To resolve the problem that the route list in core switches needs explosive capacity,a CIDR(classless inter domain routing) structure is introduced.The CIDR list efficiently reduces route list capacity,but is not satisfied with the IP address lookup algorithm.With an analysis of binary lookup algorithm based on the prefix length of Hash address,it can be seen that the advantage of this algorithm is not embodied since the limitation of store capacity on CIDR list.With the improvement of this algorithm by the method of prefixes length expansion for a few fixed point addresses,a faster lookup matching algorithm is brought forward which satisfies the requirements of the CIDR list.From the simulated experiment,the improved algorithm meets the demand for fast forwarding IP blocks better.

CLC Number: 

[an error occurred while processing this directive]