Lecturer:
Ayalvadi Ganesh (a.ganesh@bristol.ac.uk)
Texts:
Main text: F P Kelly, Reversibility and stochastic networks, Wiley, 1979.
Other recommended texts:
J Walrand, An introduction to queuing networks,
Prentice-Hall International, 1988.
I Mitrani, Modelling of computer and communication
systems, Cambridge University Press, 1987.
Office hours: 3-4pm Tuesdays,
Room 3.15, School of Mathematics.
Homework policy: Homework is an important part of learning the material on this course and you are strongly encouraged to attempt all the homework problems. All students are required to hand in solutions to selected problems. You may discuss the problems but you should write out the solutions on your own.
For those taking the course as a Level 3 course, the solutions will not count towards your final mark, but will affect whether you get credit for the course if your final mark is between 30 and 40. You will need to hand in satisfactory attempts to at least half the work to gain credit.
For those taking it as a Level M course, the solutions to selected problems that you hand in will count for 20% of your final mark.
Lecture notes
Homework problems
Homework 1 Due
Friday, 19 Oct Solutions 1
Homework 2 Due
Friday, 26 Oct Solutions 2
Homework 3 Due
Friday, 2 Nov Solutions 3
Homework 4 Due
Monday, 12 Nov Solutions 4
Homework 5 Due
Monday, 19 Nov Solutions 5
Homework 6 Due Friday, 23 Nov Solutions 6