BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Some Uses of Hashing in Networking Problems - Michael Mitzenmacher
 \, Harvard University
DTSTART:20100802T131500Z
DTEND:20100802T141500Z
UID:TALK25662@talks.cam.ac.uk
CONTACT:Stephen Clark
DESCRIPTION:I will describe some recent work on real-world networking prob
 lems where\nsimple randomness has proven useful.\nFirst\, I describe the l
 ossy difference aggregator\, a data structure designed\nto measure average
  packet latency in the\nface of packet loss and restricted communication.
   Second\, I describe\nCarousel\, an approach for scalable logging of\nev
 ents for Intrusion Detection Systems and similar systems.  Both solutions
 \nrely on simple hashing techniques\, and\nthe analysis of the hashing res
 ults informs the design of the solutions. \nFinally\, as time permits\, I
 'll describe cuckoo\nhashing\, and why it potentially could be a useful pa
 radigm for networking\nproblems in routers.
LOCATION:Lecture Theatre 1\, Computer Laboratory
END:VEVENT
END:VCALENDAR