Some Uses of Hashing in Networking Problems
Add to your list(s)
Download to your calendar using vCal
If you have a question about this talk, please contact Stephen Clark.
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 Wednesday Seminars - Department of Computer Science and Technology series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
|
![[Search]](https://talks.cam.ac.uk/images/search.gif?1209136071)
|![[A-Z Index]](https://talks.cam.ac.uk/images/az.gif?1209136071)
|![[Contact]](https://talks.cam.ac.uk/images/contact.gif?1209136071)
![[University of Cambridge]](https://talks.cam.ac.uk/images/identifier2.gif?1209136071){kind=small}
![[Talks.cam]](https://talks.cam.ac.uk/images/talkslogosmall.gif?1209136071)
Monday 02 August 2010, 14:15-15:15