방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| M/M/1 대기열: 단일 서버 대기열 모델× | M/M/c 대기열: 다중 서버 대기열 모델× | |
|---|---|---|
| 분야 | 경영과학 | 경영과학 |
| 계열 | Regression model | Regression model |
| 기원 연도≠ | 1953 | 1998 |
| 창시자≠ | A. K. Erlang; David Kendall (notation) | Queueing-theory tradition; Gross & Harris |
| 유형≠ | Stochastic queueing model | Multi-server Markovian queueing model |
| 원전≠ | 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. DOI ↗ | Gross, D., & Harris, C. M. (1998). Fundamentals of Queueing Theory (3rd ed.). Wiley. ISBN: 978-0-471-17083-9 |
| 별칭 | 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 |
| 관련 | 3 | 3 |
| 요약≠ | 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. |
| ScholarGate데이터셋 ↗ |
|
|