Queuing Theory and Poisson Process
Offered By: Mathemaniac via YouTube
Course Description
Overview
Explore the fundamentals of queuing theory in this 25-minute video, focusing on the simplest queuing model - the M/M/1 queue. Delve into the Poisson process, which forms the underlying assumption for this model. Gain insights into various queuing systems, including M/M/c, M/M/∞, M/G/1, and G/M/1 queues, as well as Jackson Networks. Access supplementary materials, including a discussion on the variance of Poisson distribution and downloadable files, to enhance your understanding. Discover the applications of Markov Chains, birth-and-death processes, and Bessel functions in queuing theory. Perfect for those seeking a solid foundation in this essential aspect of operations research and probability theory.
Syllabus
Queuing theory and Poisson process
Taught by
Mathemaniac
Related Courses
Probabilistic Graphical Models 1: RepresentationStanford University via Coursera Computer Security
Stanford University via Coursera Intro to Computer Science
University of Virginia via Udacity Introduction to Logic
Stanford University via Coursera Internet History, Technology, and Security
University of Michigan via Coursera