An elementary introduction to queueing systems
The book aims to highlight the fundamental concepts of queueing systems. It starts with the mathematical modeling of the arrival process (input) of customers to the system. It is shown that the arrival process can be described mathematically either by the number of arrival customers in a fixed time...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
New Jersey
World Scientific Publishing Company
2014
|
| Subjects: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
MARC
| LEADER | 00000nam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | 98041 | ||
| 003 | MY-KLNDU | ||
| 005 | 20241220022400.0 | ||
| 008 | 221104t20142014njua bi 001 0 eng d | ||
| 020 | |a 9789814612005 | ||
| 020 | |a 9814612014 | ||
| 039 | 9 | |a 202211041132 |b VLOAD |c 201601141735 |d faezah |y 201512081631 |z syarifuddin | |
| 040 | |a UPNM |b eng |c UPNM |e rda | ||
| 090 | |a QA 274.8 |b .C43 2014 | ||
| 100 | 1 | |a Chan, Wah Chun |e author | |
| 245 | 1 | 3 | |a An elementary introduction to queueing systems |c Wah Chun Chan |
| 264 | 1 | |a New Jersey |b World Scientific Publishing Company |c 2014 | |
| 264 | 4 | |c © 2014 | |
| 300 | |a xii, 103 pages |b illustrations |c 23 cm | ||
| 336 | |a text |2 rdacontent | ||
| 337 | |a unmediated |2 rdamedia | ||
| 338 | |a volume |2 rdacarrier | ||
| 400 | 0 | |a Wah Chun Chan | |
| 505 | 0 | |a Chapter 1; Modeling of Queueing Systems; 1.1 Mathematical Modeling; 1.2 The Poisson Input Process; 1.3 Superposition of Independent Poisson Processes; 1.4 Decomposition of a Poisson Process; 1.5 The Exponential Interarrival Time Distribution; 1.6 The Markov Property or Memoryless Property; 1.7 Relationship Between the Poisson Distribution and the Exponential Distribution; 1.8 The Service Time Distribution; 1.9 The Residual Service Time Distribution; 1.10 The Birth and Death Process; 1.11 The Outside Observer's Distribution and the Arriving Customer's Distribution; Review -- Chapter 2Queueing Systems with Losses; 2.1 Introduction; 2.2 The Erlang Loss System; 2.3 The Erlang Loss Formula; Review --Chapter 3; Queueing Systems Allowing Waiting; 3.1 Introduction; 3.2 The Erlang Delay System; 3.3 The Distribution Function of the Waiting Time; 3.4 Little's Formula; Review --Chapter 4; The Engset Loss and Delay Systems; 4.1 Introduction; 4.2 The Engset Loss System; 4.3 The Arriving Customer's Distribution for the Engset Loss System; 4.4 The Offered Load and Carried Load in the Engset Loss System; 4.5 The Engset Delay System. 4.6 The Waiting Time Distribution Function for the Engset Delay System4.7 The Mean Waiting Time in the Engset Delay System; 4.8 The Offered Load and Carried Load in the Engset Delay System; Review -- Chapter 5; Queueing Systems with a Single Server; 5.1 Introduction; 5.2 The M/M/1 Queue; 5.3 The M/G/1 Queue and the Pollaczek-Khinchin Formula for the Mean Waiting Time; 5.4 The M/G/1 Queue with Vacations; 5.5 The M/G/1 Queue with Priority Discipline; (A) The HOL Non-Preemptive Priority System; (B) The Preemptive Priority System; 5.6 The GI/M/1 Queue. (A) The Probability of Waiting and the Mean Waiting Time(B) The Waiting Time Distribution Function | |
| 520 | |a The book aims to highlight the fundamental concepts of queueing systems. It starts with the mathematical modeling of the arrival process (input) of customers to the system. It is shown that the arrival process can be described mathematically either by the number of arrival customers in a fixed time interval, or by the interarrival time between two consecutive arrivals. In the analysis of queueing systems, the book emphasizes the importance of exponential service time of customers. With this assumption of exponential service time, the analysis can be simplified by using the birth and death proc | ||
| 592 | |a JI 4860 |b 05/01/2016 |c RM 319.60 |h JENDELA INFORMASI | ||
| 650 | 0 | |a Queuing theory |x Mathematical models | |
| 999 | |a vtls000055768 |c 98041 |d 98041 | ||