Networks II

These are the notes for a postgraduate level course on networking. The course focuses on Queuing theory and Routing. Early lectures are on the practical aspects of networking. The course is still under preparation -- what is offered here is a selection of the notes prepared so far. Previous year's notes are still available for 2003, 2004 and 2005

Lecture Notes

Lecture One (Microsoft Powerpoint) -- Networking Basics
Lecture Two (Microsoft Powerpoint) -- Networking Basics
Lecture Three (PDF) -- Extra lecture on basic probability
Lecture Four (PDF) -- Little's Theorem
Lecture Five (Microsoft Powerpoint) -- Intro to Markov chains
Lecture Six (Microsoft Powerpoint) -- More Markov chains
Lecture Six point five (PDF) -- Continuous time Markov chains.
Lecture Seven (PDF) -- Birth-Death processes and the M/M/1 queue solved.
Lecture Eight (PDF) -- Multiplexing and the M/M/m queue solved.
Lecture Nine (PDF) -- The M/G/1 queue and P-K theorem.
Lecture Ten (PDF) -- Burke's Theorem and Jackson's Theorem
Lecture Eleven (PDF) -- basic graph theory
Lecture Twelve (PDF) -- Spanning trees
Lecture Thirteen (PDF) -- Shortest Path algorithms
Unnumbered Lecture (PDF) --- Power Laws, Broccoli, Wikipedia, Sex (not much sex)

Other resources

Exams and Model Solutions

For information about the course please send mail to : richard@richardclegg.org