COM SCI 212A
Queueing Systems Theory
Computer Science · 4 units · Graduate courses (200-299)
Resource sharing issues and theory of queueing (waiting-line) systems. Review of Markov chains and baby queueing theory. Method of stages. M/E r /1. E r /M/1. Bulk arrival and bulk service systems. Series-parallel stages. Fundamentals of open and closed queueing networks. Intermediate queueing theory: M/G/1, G/M/m. Collective marks. Advanced queueing theory: G/G/1, Lindley integral equation, spectral solution. Inequalities, bounds, approximations.
Letter grading.
Requisites
Official UCLA wording
Requisites: course 112, Electrical Engineering 131A.
BruinTree reads · Prerequisite
confidence 1.00 · from textRequires
Everything that has to come before this course, not just the courses named in the requisite above.
COM SCI 212A
- COM SCI 112Modeling Uncertainty in Information Systems
- COM SCI 111Operating Systems Principles
- COM SCI 33Introduction to Computer Organization
2 direct requisites. Showing 22 courses over 3 levels; the branches marked with a count carry on past it. Every course here opens its own tree.
Unlocks
What this course is a requisite for, and what those courses lead to in turn.
No course in the catalog lists this as a requisite.