Relevant Links
Link to Original Paper
Media Contact
Keywords
Computer Architectures, Algorithms, Security
Buzz
COMPUTING RESEARCH HIGHLIGHT OF THE WEEK [March 11 - March 18, 2011]
Protecting your Networks a Single Bit at a Time
Modern networks need to be constantly on the prowl for the bad guys: worms, intruders, denial-of-service attacks, etc. As we learn more information about the way these bad guys attack our machines we can start to develop rules - or specifically sequences of text - that tell us that an attack is occurring. The problem is that this list of rules already has more than 100,000 entries, and is growing larger by the second. While that does not sound too bad, the problem is that we want to search every byte of every pieces of data sent over the internet for each and every instance of these 100,000 rules - many billions of characters of text each and every second.
Professor Sherwood has developed an approach that relies on a special purpose computer architecture to execute novel pattern matching algorithms that work by tearing apart this large database of string into tiny bit patterns, each of which then runs on a tiny 1-bit CPU. It is shown, for the first time, that these tiny little machines all working in unison will find these patterns perfectly and up to 10 times more efficiently than past approaches.
Researchers:
Tim Sherwood, University of California-Santa Barbara
Agencies/Institutions (that have supported the research):
NSF, University of California-Santa Barbara
‹ Current Highlight | Past Highlights ›
Computing Research Highlight of the Week is a service of the Computing Community Consortium and the Computing Research Association designed to highlight some of the exciting and important recent research results in the computing fields. Each week a new highlight is chosen by CRA and CCC staff and volunteers from submissions from the computing community. Want your research featured? Submit it!.
