So sánh phương pháp

	Mô phỏng sự kiện rời rạc (DES)	Hàng đợi M/M/1: Mô hình Hàng đợi Đơn Máy phục vụ	M/M/c Queue: Mô hình Hàng đợi Đa máy chủ
Lĩnh vực	Mô phỏng	Vận trù học	Vận trù học
Họ	Process / pipeline	Regression model	Regression model
Năm ra đời	1960s (formalized); modern computational form from 1970s onward	1953	1998
Người khởi xướng	Banks, Carson, Nelson & Nicol (textbook lineage); foundational work by Tocher & Conway (1960s)	A. K. Erlang; David Kendall (notation)	Queueing-theory tradition; Gross & Harris
Loại	Stochastic process simulation	Stochastic queueing model	Multi-server Markovian queueing model
Công trình gốc	Banks, J., Carson, J.S., Nelson, B.L. & Nicol, D.M. (2010). Discrete-Event System Simulation (5th ed.). Pearson. ISBN: 978-0136062127	Kendall, D. G. (1953). Stochastic processes occurring in the theory of queues and their analysis by the method of the imbedded Markov chain. The Annals of Mathematical Statistics, 24(3), 338–354.	Gross, D., & Harris, C. M. (1998). Fundamentals of Queueing Theory (3rd ed.). Wiley. ISBN: 978-0-471-17083-9
Tên gọi khác	DES, event-driven simulation, Ayrık Olay Simülasyonu (DES)	Single-Server Markovian Queue, Birth-Death Queue, Poisson Queue, M/M/1 Kuyruk Modeli	Multi-Server Erlang Queue, c-Server Markovian Queue, Erlang-C Queue, Çok Sunuculu M/M/c Kuyruğu
Liên quan	4	3	3
Tóm tắt	Discrete-Event Simulation (DES) is a computational modeling paradigm in which the state of a system changes only at a countable sequence of points in time — the events. Between events nothing changes, so the simulation clock jumps directly from one event to the next. Formalized through the foundational textbooks of Banks, Carson, Nelson and Nicol and of Law in the 1960s–2000s, DES has become the standard tool for analyzing queuing systems, healthcare patient flows, manufacturing lines, and logistics networks where entities move through resources over time.	The M/M/1 queue is the foundational single-server queueing model in which customers arrive according to a Poisson process with rate λ, are served one at a time by a single server with exponentially distributed service times at rate μ, and wait in an infinite-capacity first-come-first-served queue. Formalized within the Kendall notation framework by David Kendall in 1953, building on A. K. Erlang's early twentieth-century telephone traffic work, it yields closed-form steady-state performance measures when the traffic intensity ρ = λ/μ is less than one.	The M/M/c queue is a multi-server stochastic model in which customers arrive according to a Poisson process at rate λ, are served by c identical servers each with exponentially distributed service times at rate μ, and wait in a single common queue when all servers are busy. Systematized within classical queueing theory and thoroughly treated by Gross and Harris (1998), it extends the simpler M/M/1 model to settings with parallel servers, making it the foundational tool for capacity planning in service systems.