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

Lecture Notes

Lecture One (Microsoft Powerpoint) -- Networking Basics

Lecture Two (Microsoft Powerpoint) -- Networking Basics

Lecture Three (PDF) -- Basic Probability

Lecture Four (PDF) -- Little's Theorem

Lecture Five (Microsoft Powerpoint) -- Markov Chains

Lecture Six (Microsoft Powerpoint) -- Markov Chains II

Lecture Seven (Microsoft Powerpoint) -- Birth Death Processes

Lecture Eight (PDF) -- Birth Death Processes II

Lecture Nine (PDF) -- The Pollaczek-Khinchin Theorem (M/G/1 queues)

Lecture Ten (PDF) -- Jackson's Theorem (Networks of queues)

Lecture Eleven (PDF) -- Basic Graph Theory

Lecture Twelve (PDF) -- Minimum Spanning Trees

Lecture Thirteen (PDF) -- Shortest Paths

Worksheets and Practicals

Worksheet One (PDF)

Worksheet Two (PDF)

Practical One (PDF)

Practical Two (PDF)

Extra material

Queuing example (PDF)

Markov example (PDF)

2003 Exam and model answers (PDF) (updated 27/3/04)

For information about the course please send mail to :