Stochastic Networks

• Course description
  
• Reading:
  • Markov revision: CNA Chapter 1. If new, see Markov Chains, by James Norris, Sections 1.7, 2.4. See Poisson Processes for more on this. Dated, but of historical interest is Reversibility and Stochastic Networks.
    
  • Revision on Lagrange multipliers: Richard Weber's notes, Sections 1 and 2.1. Introduction of paper on Loss networks.
  • For a gentle introduction to the road traffic and TCP material, see The mathematics of traffic in networks
  • Those interested in the Random Access section of the course may like to look at a survey by Leslie Ann Goldberg, Notes on Contention Resolution. A good reference for random/multiple access (including proof of stability of controlled ALOHA) is Chapter 4 of CNA.
  • Two good references on Internet Congestion Control are Srinivas Shakkottai and R. Srikant, "Network Optimization and Control," Foundations and Trends in Networking, NoW Publishers, 2007 and R. Srikant's "The Mathematics of Internet Congestion Control", Birkhauser, 2004.
• Notes, taken by Damon Wischik, from an earlier version of the course given in Stanford. And Elena Yudovina's Notes from last year.
• Example sheets:
  • Example sheet 1; after you've tried them, see Elena's solutions.
  • Example sheet 2; Elena's solutions.
  • Example sheet 3.
  • Exam paper, 2010 (question 2 was bookwork that year - we didn't cover multi-class networks this year)
• If you are interested in the final remarks on energy, see Energy Systems; a PhD studentship in this area.