E2 204, Spring 2016

Stochastic Processes & Queueuing Theory


Lectures


Course Syllabus


Poisson process, Renewal theory, Markov chains, Reversibility, Queueing networks, Martingales, Random walk.

Course Description


Basic mathematical modeling is at the heart of engineering. In both electrical and computer engineering, many systems must be modeled using stochastic processes. This course will introduce students to basic stochastic processes tools that can be utilized for performance analysis of stochastic dynamic systems and networks.

GitHub Information


All the students in the class have access to Stochastic-Processes course public repository on GitHub.
Please follow the guidelines in the sample lecture.
The source file for the sample lecture is in the repository.
It is recommended you save it with another name in your local repository for creating a new lecture.
A good book for Git is here and a simple tutorial here.

Instructors

Aditya Gopalan
Office: ECE 2.09
Hours: M/W 11:00 am - 12:00 noon.

Parimal Parag
Office: ECE 2.17
Hours: M/W 11:00 am - 12:00 noon.

Time and Location


Classroom: ECE 1.07, Main ECE Building
Hours: Tu/Th 04:00 pm - 05:30 pm.

Teaching Assistants


TBD

Textbooks


Stochastic Processes, Sheldon M. Ross, 2nd edition, 1996.

Stochastic Processes 

Introduction to Stochastic Processes, Erhan Cinlar, 2013.

Introduction to Stochastic Processes 

Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues, Pierre Bremaud, 1999.

Markov Chains 

Markov Chains, James R. Norris, 1998.

Markov Chains 

Reversibility and Stochastic Networks, Frank P. Kelly, 2011.

Reversibility and Stochastic Networks 

Probability: Theory and Examples, Rick Durett, 4th edition, 2010.

Probability Theory