2013 IEEE 33rd International Conference on Distributed Computing Systems (2007)
June 25, 2007 to June 27, 2007
Amr El Abbadi , University of California, Santa Barbara
Divyakant Agrawal , University of California, Santa Barbara
Nagender Bandi , University of California, Santa Barbara
Real-time detection of worm attacks, port scans and Distributed Denial of Service (DDoS) attacks, as network packets belonging to these security attacks flow through a network router, is of paramount importance. In a typical worm attack, a worm infected host tries to spread the worm by scanning a number of other hosts thus resulting in significant number of network connections at an intermediate router. Detecting such attacks amounts to finding all hosts that are associated with unusually high number of other hosts, which is equivalent to solving the classic heavy distinct hitter problem over data streams. While several heavy distinct hitter solutions have been proposed and evaluated in a standard CPU setting, most of the above applications typically execute on special networking architectures called Network Processing Units (NPUs). These NPUs interface with special associative memories known as the Ternary Content Addressable Memories (TCAMs) to provide gigabit rate forwarding at network routers. In this paper, we describe how the integrated architecture of NPU and TCAMs can be exploited to develop high-speed solutions for heavy distinct hitters.
Amr El Abbadi, Divyakant Agrawal, Nagender Bandi, "Fast Algorithms for Heavy Distinct Hitters using Associative Memories", 2013 IEEE 33rd International Conference on Distributed Computing Systems, vol. 00, no. , pp. 6, 2007, doi:10.1109/ICDCS.2007.110