Course pages 2016–17

# Algebraic Path Problems, with applications to Internet Routing

## Lecture slides

- Lectures 1 to 5
- One slide per page: L11_2016_Lectures_1_5.pdf
- Two slides per page: L11_2016_Lectures_1_5_2up.pdf
- Lectures 5 to 6
- One slide per page: L11_2016_Lectures_5_6.pdf
- Two slides per page: L11_2016_Lectures_5_6_2up.pdf

## On reserve in CL library

- Path problems in networks. John S. Baras and George Theodorakopoulos. Morgan and Claypool, 2010.
- Graphs, Dioids and Semirings : New Models and Algorithms, by Michel Gondran , Michel Minoux, 2008

## Reading

- An Algebra for Network Routing Problems. B. A. CARRÉ (1970).
- Semiring frameworks and algorithms for shortest-distance problems, M. Mohri
- On the Forwarding Paths Produced by Internet Routing Algorithms. Seweryn Dynerowicz (University of Namur, Belgium), Timothy G. Griffin. ICNP 2013.