Algorithms and data structures to accelerate network analysis

As the sheer amount of computer generated data continues to grow exponentially, new bottlenecks are unveiled that require rethinking our traditional software and hardware architectures. In this paper we present five algorithms and data structures (long queue emulation, lockless bimodal queues, tail...

Full description

Saved in:

Bibliographic Details
Published in:	Future generation computer systems Vol. 86; no. C; pp. 535 - 545
Main Authors:	Ros-Giralt, Jordi, Commike, Alan, Cullen, Peter, Lethin, Richard
Format:	Journal Article
Language:	English
Published:	United States Elsevier B.V 01.09.2018 Elsevier
Subjects:	MATHEMATICS AND COMPUTING
ISSN:	0167-739X, 1872-7115
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	As the sheer amount of computer generated data continues to grow exponentially, new bottlenecks are unveiled that require rethinking our traditional software and hardware architectures. In this paper we present five algorithms and data structures (long queue emulation, lockless bimodal queues, tail early dropping, LFN tables, and multiresolution priority queues) designed to optimize the process of analyzing network traffic. We integrated these optimizations on R-Scope, a high performance network appliance that runs the Bro network analyzer, and present benchmarks showcasing performance speed ups of 5X at traffic rates of 10 Gbps. •A New queuing algorithm to reduce packet drops in hardware queues.•New lockless bimodal producer–consumer queue to eliminate multi-thread contention.•Algorithm to dynamically shunt traffic while maximizing information entropy.•Lockless hash table with low false negatives to eliminate memory contention overheads.•Multiresolution priority queues to reduce the complexity of a priority queue down to O(1).
Bibliography:	SC0004400; SC0006343; SC0017184 USDOE Office of Science (SC)
ISSN:	0167-739X 1872-7115
DOI:	10.1016/j.future.2018.04.034