IEEE Transactions on Computers (TC) has moved to the OnlinePlus publication model starting with 2013 issues!

From the February 2014 issue

On Adding Bloom Filters to Longest Prefix Matching Algorithms

By Hyesook Lim, Kyuhee Lim, Nara Lee, Kyong-Hye Park

Featured article thumbnail imageHigh-speed IP address lookup is essential to achieve wire-speed packet forwarding in Internet routers. Ternary content addressable memory (TCAM) technology has been adopted to solve the IP address lookup problem because of its ability to perform fast parallel matching. However, the applicability of TCAMs presents difficulties due to cost and power dissipation issues. Various algorithms and hardware architectures have been proposed to perform the IP address lookup using ordinary memories such as SRAMs or DRAMs without using TCAMs. Among the algorithms, we focus on two efficient algorithms providing high-speed IP address lookup: parallel multiple-hashing (PMH) algorithm and binary search on level algorithm. This paper shows how effectively an on-chip Bloom filter can improve those algorithms.

download PDF View the PDF of this article      csdl View this issue in the digital library


Editorials and Announcements

Announcements

New EssentialSet

Editorials

Guest Editorials

Reviewers List

Annual Index


Access Recently Published TC Articles

RSSSubscribe to the RSS feed of latest TC content added to the digital library

MailSign up for the Transactions Connection newsletter.


Importance of Coherence Protocols with Network Applications on Multi-Core Processors

 

Automated Generation of Performance and Dependability Models for the Assessment of Wireless Sensor Networks

 

IEEE Transactions on Computers (TC) is a monthly publication that publishes research in such areas as computer organizations and architectures, digital devices, operating systems, and new and important applications and trends. 
Read the full scope of TC