A method for ultra fast searching within traffic filtering tables in networking hardware

Sergey V. Makov; Vladimir I. Marchuk; Viacheslav V. Voronin; Vladimir A. Frantc; Victor A. Obukhovets

doi:10.1117/12.2083022

4 March 2015 A method for ultra fast searching within traffic filtering tables in networking hardware

Sergey V. Makov, Vladimir I. Marchuk, Viacheslav V. Voronin, Vladimir A. Frantc, Victor A. Obukhovets

Proceedings Volume 9410, Visual Information Processing and Communication VI; 94100M (2015) https://doi.org/10.1117/12.2083022
Event: SPIE/IS&T Electronic Imaging, 2015, San Francisco, California, United States

Abstract

This article discusses features of the parallel hashing for the designing of the frame filtering tables in distributed computing systems. The proposed method of filtering tables design can reduce the time of frame processing by network bridges and switches and provide a low probability of filtering table overflowing. The optimal number of parallel tables was determined for a given amount of memory for table design.

Citation Download Citation

Sergey V. Makov, Vladimir I. Marchuk, Viacheslav V. Voronin, Vladimir A. Frantc, and Victor A. Obukhovets "A method for ultra fast searching within traffic filtering tables in networking hardware", Proc. SPIE 9410, Visual Information Processing and Communication VI, 94100M (4 March 2015); https://doi.org/10.1117/12.2083022

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available