Share Email Print
cover

Proceedings Paper

A method for ultra fast searching within traffic filtering tables in networking hardware
Author(s): Sergey V. Makov; Vladimir I. Marchuk; Viacheslav V. Voronin; Vladimir A. Frantc; Victor A. Obukhovets
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 4 March 2015
PDF: 7 pages
Proc. SPIE 9410, Visual Information Processing and Communication VI, 94100M (4 March 2015); doi: 10.1117/12.2083022
Show Author Affiliations
Sergey V. Makov, Don State Technical Univ. (Russian Federation)
Vladimir I. Marchuk, Don State Technical Univ. (Russian Federation)
Viacheslav V. Voronin, Don State Technical Univ. (Russian Federation)
Vladimir A. Frantc, Don State Technical Univ. (Russian Federation)
Victor A. Obukhovets, Taganrog Institute of Technology, Southern Federal Univ. (Russian Federation)


Published in SPIE Proceedings Vol. 9410:
Visual Information Processing and Communication VI
Amir Said; Onur G. Guleryuz; Robert L. Stevenson, Editor(s)

© SPIE. Terms of Use
Back to Top