This is a set of lectures which I created and gave at UCL. They give an introduction to the probability and mathematical techniques necessary to model communicating computer networks and particularly the internet.

Slides:

- Introduction (PDF)
- Probability and Markov chains (PDF)
- Queu(e)ing theory (PDF)
- Modelling examples and discussion (PDF)

The slides should be viewed with these complete lecture notes (PDF). You can also see the 2012 exam question and solution.

All corrections to these notes are welcomed.

There are older copies of this material available.

This talk describes FLICK a system for the application-specific middlebox. It consists of three parts:

1) A domain specific language for the middlebox that allows easy development of typical middlebox functions.

2) An abstraction, the task graph, that allows the breaking of middlebox functions into easily parallelisable work units.

3) The system -- this implements the compiled language, handles TCP connections and memory management.

The whole system is comparable in speed to a specialist implementation.