Some Uses of Hashing in Networking Problems

Add to your list(s) Download to your calendar using vCal

• Michael Mitzenmacher, Harvard University
• Monday 02 August 2010, 14:15-15:15
• Lecture Theatre 1, Computer Laboratory..

If you have a question about this talk, please contact Neil Walton.

I will describe some recent work on real-world networking problems where simple randomness has proven useful. First, I describe the lossy difference aggregator, a data structure designed to measure average packet latency in the face of packet loss and restricted communication. Second, I describe Carousel, an approach for scalable logging of events for Intrusion Detection Systems and similar systems. Both solutions rely on simple hashing techniques, and the analysis of the hashing results informs the design of the solutions. Finally, as time permits, I’ll describe cuckoo hashing, and why it potentially could be a useful paradigm for networking problems in routers.

This talk is part of the Optimization and Incentives Seminar series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Cambridge talks
• DPMMS Lists
• DPMMS info aggregator
• DPMMS lists
• Economics and Computer Science Talks
• Hanchen DaDaDash
• Interested Talks
• Lecture Theatre 1, Computer Laboratory.
• Optimization and Incentives Seminar
• School of Physical Sciences
• Statistical Laboratory info aggregator
• Trust & Technology Initiative - interesting events
• bld31

Note that ex-directory lists are not shown.