University of Cambridge > Talks.cam > Optimization and Incentives Seminar > Some Uses of Hashing in Networking Problems

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Some Uses of Hashing in Networking Problems

Download to your calendar using vCal

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:

Note that ex-directory lists are not shown.

Other lists

UCL, London in collaboration with the Department of Electrical Engineering, Cambridge Rayleigh Seminar Room, Maxwell Centre, J J Thomson Avenue, Cambridge CB3 0HE Lewin Stroke & Rehabilitation Unit, Seminar Room, R2, Addenbrooke's Hospital

Other talks

Title to be confirmed Task performance predicts the substitution of feedforward by feedback drive in visual cortex Precision psychiatry TBC Dwarf Galaxies in the Local Universe Group Work
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity