We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

A High Performance ARP Lookup System for Gigabit Ethernet

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yun Qin ; Tsinghua Univ., Beijing ; Yachao Zhou ; Bin Liu

In network processor (NP) application of Gigabit Ethernet (GE), the second layer design has to deal with ARP protocol; we present an approach in this paper to meet the high speed performance requirement to ARP lookup. Unlike longest prefix matching lookup algorithm widely used in IP routing lookup and flow classification, ARP lookup utilizes fixed length matching lookup algorithm, which is commonly implemented by hashing in software or directly by CAM in hardware without the need of much optimization. The algorithm proposed in this paper belongs to closed double hashing algorithm. In ARP lookup system, to solve the indeterminacy of lookup time, a two-stage queue is used to ensure the sequence of IP flows with the same destination address maintains during ARP lookup process. The performance of the system is guaranteed by experimental results under worst-case condition, which is capable of meeting the requirement of ARP lookup in GE environment. Our results show that the algorithm saves much storage and timing cost while achieving wire-speed lookup required by GE.

Published in:

Communications and Networking in China, 2007. CHINACOM '07. Second International Conference on

Date of Conference:

22-24 Aug. 2007