Method of frame filtering table design without searching keys storing

This article discusses features of the parallel hashing for the design 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.