Stochastic Networks
FPK will be available for last-minute questions: 10am on Wednesday 22 May
2013 in MR4. (2011,
Qn 5: for the second paragraph do the case where all the n's are positive to begin with, and
then check the answer you've found remains valid even if some n's are
zero. There wasn't anything wrong with the Lagrange Sufficiency Theorem - the
overbars didn't project properly!)
Examples class: 10am on Wednesday 1 May 2013 in MR4.
Examples class: 3pm on Wednesday 16 January 2013 in MR5.
Example class: 5pm on Monday 19 November in MR5.
Work to be done: exercises in Chapters 3, 4 and 5.
Office hour: 5-6pm on Monday 12 November in D1.14.
Office hour: 3-4:30pm on Tuesday 30 October in D1.14.
Examples class: 2-3pm on Wednesday 24 October in MR5.
Work to be done: exercises in Chapters 1 and 2, and Sections 3.1-3.4.
-
Course description
- Preliminary reading:
- Read Chapter 1 and Appendix A of the Course
text.
- Read Chapter 2 and Appendix B.
- Complete the Exercises in Chapters 1 and 2.
- Revision on Lagrange multipliers: Richard Weber's
notes,
Sections 1 and 2.1.
- See Poisson
Processes for more on this topic.
- Read Chapter 3 and complete the Exercises in Chapter 3, and so on!
- Those interested in the Random Access section of the course
may like to look at Leslie Ann Goldberg's Notes on Contention Resolution.
A
possible essay topic.
Frank Kelly,
Statistical
Laboratory,
University of Cambridge