MONTE CARLO SIMULATION STUDY ON M/M/1 AND M/M/2 QUEUEING MODELS IN A MULTI SPECIALITY HOSPITAL

Size: px
Start display at page:

Download "MONTE CARLO SIMULATION STUDY ON M/M/1 AND M/M/2 QUEUEING MODELS IN A MULTI SPECIALITY HOSPITAL"

Transcription

1 Volume 117 No , ISSN: (printed version); ISSN: (on-line version) url: ijpam.eu MONTE CARLO SIMULATION STUDY ON M/M/1 AND M/M/2 QUEUEING MODELS IN A MULTI SPECIALITY HOSPITAL S.Shanmugasundaram 1, P.Umarani 2 1 Department of Mathematics, Government Arts College,Salem , Tamil Nadu,India. sundaramsss@hotmail.com 2 Department of Mathematics, AVS Engineering College,Salem - 3, Tamil Nadu, India. umasaravana2000@gmail.com Abstract This paper tries to check and analyze the waiting time for the new patients as well as the previous patients through Monte Carlo simulation and provides M/M/1(single server) or M/M/2 (multi server). Additionally, Chi-Square test verifies the Poisson distribution which is suitable to the arrival and the uniform distribution of the service time of patients. The behaviour of the system has been analyzed both in simulation and analytical methods. The numerical study illustrates the originality of the model. The results have been recommended to the hospital management for implementation, which will definitely reduce the waiting time of the patients. AMS Subject Classification: 90B22; 60K25. Key Words and Phrases: Inter - arrival Time, Service time, Waiting time, M/M/1 and M/M/2 queueing models, Monte Carlo Simulation, Queue length. 1 INTRODUCTION In all the activities in our day to day life, we have to wait in a queue. The same holds good for the patients in a hospital, which will increase the physical as well as psychological discomfort during the waiting. When compared with the queues in other activities, the patients waiting in the hospital becomes an emergency and that is the reason for this topic has been chosen. Waiting time in the queue is analyzed through a stochastic process which comprises the simulation method and analytical method. Further Chi - Square test verifies the Poisson distribution is apt to the arrival and the uniform distribution of the service. Brief explanation about the topics viz: i) Queuing Theory, ii) Simulation Method, iii) Analytical Method and iv) Chi - Square Test are given below. Queueing theory was introduced by Agner Krarup Erlang ( ), a Danish Engineer cum mathematician. It is a quantitative technique which consists of constructing mathematical models of various types of queueing systems and deals with the analysis of queues and queueing behaviour. It is the mathematics of waiting lines. A queuing system can be described by the flow of units for service forming, or joining the queue 271 1

2 2 S.Shanmugasundaram, P.Umarani when service is not available soon, and leaving the system after being served.this theory is well explained by A.K.Erlang (1909) in his articles related to the study of congestion in telephone traffic[1]. Six characteristics of queueing processes are explored in this section. These are (i) Arrival pattern of customers. (ii) Service pattern of servers (iii) Queueing discipline (iv) System capacity (v) Number of service channels and (vi) Number of service phases. All the six characteristics decide the strength of the system. The arrival pattern is the number of arrivals per unit time. This is expressed in terms of the mean number or mean inter-arrival time. The arrival may be single, bulk or batches of fixed or varied sizes. Service pattern may also be described by the number of customers served per unit time or the time required to serve a customer. Queue discipline refers to the rule based on which customers are selected for service. There are many queue disciplines and the commonly observed one is First In First Out (FIFO). The capacity refers to the limitation on the number of customers allowed for that service. Service channels refer to the parallel counter offering the same type of service and Service in phases refers to a series of service counters. In queueing theory, a discipline within the mathematical theory of probability, an M/M/1 queue represents the queue length in a system having a single server, where arrivals are determined by a Poisson process and job service times have an exponential distribution. An extension of this model with more than one server is the M/M/C queue. The simulation was introduced by Mr. John von Neumann and Mr.Stanishlaw ulam. It is a method of solving decision-making problems by designing, constructing and manipulating a model of the real system. It is defined to be the action of performing experiments on a model of a given system. Mr. J.V Neumann and Mr. Stanishlaw gave the first important application in the behaviour of Neutrons in a Nuclear Shielding Problem with remarkable success. Banks.J (2001) has described that in a Monte Carlo simulation, a random value is selected for each of the task, based on the range of estimates[2]. The model is calculated based on this random value. The result of the model is recorded, and the process is repeated. A typical Monte Carlo simulation calculates the model hundreds or thousands of times, each time using different randomly-selected values. When the simulation is completed, there are a large number of results from the model, each is based on random input values. These results are used to describe the likelihood, or probability, of reaching various results in the model. The analytical method calculates the waiting time in the Queue using Little s Formula, which says that, under steady state conditions, the average number of items in a queuing system equals the average rate at which items arrive multiplied by the average time that an item spends in the system. L = λw, where L is the average number of items in the queuing system, W is the average waiting time in the system for an item, and λ is the average number of items arriving per unit time. Chi-square test is used to test the suitability of a distribution and the independence of the attributes. It is used to test the significance of the difference between the observed frequencies in a sample and expected frequencies obtained from the theoretical distribution. A set of observed frequencies obtained under some experiment has been given to test if the experimental results support a particular hypothesis. Karl Pearson developed a test for testing the significance of discrepancy between experimental values and the theoretical values obtained under some hypothesis. This is χ 2 test fitness. The test statistic is given (O i E i ) 2 i=1 E i by χ 2 = k, where O i is the observed frequency in the i th class interval and E i is the expected frequency in that class interval. The expected frequency for each class interval is computed as E i is the np i where p i is the theoretical, hypothesized probability associated with the i th class interval. It can be shown that χ 2 approximately follow the Chi-square distribution with k s 1 degrees of freedom, where s represents the number of parameters of the hypothesized distribution estimated by the sample statistics. The 272

3 MONTE CARLO SIMULATION STUDY ON M/M/1 AND M/M/2 QUEUEING MODELS IN A MULTI SPECIALITY HOSPITAL... 3 hypotheses are H 0 : The random variable conforms to the distributional assumption with the parameter given by the parameter estimates. H 1 : The random variable does not conform. The aims of this paper are i) to check the goodness-of-fit of arrival and service distribution, ii) to determine the waiting time of patients in the queue, iii) to determine the total time spent by the patients in the hospital, and iv) to determine the length of the queue. Shanmugasundaram,S and Punitha,S (2014) have analyzed the application of simulation in queueing model in tollgate[3]. Ishan P Lade, Sandeep A Chowriwar and Pranay B Sawaitul (2013) have described the use of queueing systems to decrease the waiting time of patients in the queueing system using simulation method[4]. Shanmugasundaram,S and Banumathi.P (2016) has aimed to reduce the queue length, system length, queue time and system time using simulation in Southern railway using simulation in queueing analysis. Simulation is a mimic of reality that exists or which is contemplated. Simulation is most effectively used as a queueing analysis[5]. Syed Shujauddin Sameer (2014) has helped in understanding the behaviour of a queueing system using simulation and also obtains certain very useful parameters. In this paper, simulation provides a good strategy to analyze the client - server systems and to solve the complicated problems. One of the important applications of the simulation is the analysis of the waiting line problem and it is classified into Deterministic Model, Probabilistic Model, Static Model and Dynamic Model[6]. Shanmugasundaram,S and Umarani,P (2016) have discussed the applications of simulation in queueing model at a medical center and how to calculate the queue time, system time, queue length and system length in the simulation table[7]. Soemon Takakuwa and Athula Wijewickrama (2008) have described the application of the simulation for patients coming to the hospital, the pertinent parameters like waiting time, service time, waiting time and service time ratio[8]. Shanmugasundaram,S and Umarani,P (2016) have analyzed the queueing system in a simulation model of a medical center in order to develop an efficient procedure for reducing the waiting time of the patients in the queue[9]. The researchers have dealt with the single classification of patients. They do not deal with new patients and previous patients served by a single server. They have analyzed the problem only in simulation and the analytical method was not explained. Moreover, the simulation table was also not used by them. All the above-mentioned issues are described in detail in this paper. 2 STATEMENT OF THE PROBLEM Generally, it is very tiresome for the patients to wait at a hospital as they may be both physically and psychologically weak. Further, patients have to wait for a long time in the queue for their turn which is undesirable. The problem of patients waiting in the queue is solved in this paper. 3 DESCRIPTION OF THE MODEL Initially, the patients arrival data in a multi specialty hospital has been collected for half an hour forenoon during the month of January The patients are classified into two categories like new patients and previous patients. Every department in a hospital has been assigned with two doctors the specialist and super specialist. The system is in such a way that a new patient has to meet the specialist and undergo the medical procedure; whereas the previous patients are directed to the super specialist (i.e. after the initial diag- 273

4 4 S.Shanmugasundaram, P.Umarani nosis and treatment methods, for the first visit and from the next arrival onwards the same patient is categorised as the previous patient and the treatment procedures are as per the super specialist s advice). This system generates two different parallel queues for each department. The actual waiting time of the patients in the queue at the hospital is calculated through Monte Carlo Simulation and Analytical methods. The results of both the models were identical and have the waiting time in the queue and they are illustrated in Table 15(a). Chi - Square test is used to check whether the arrival follows the Poisson distribution and the service time of the patients are uniformly distributed. As the objective of this paper is to minimize or nullify the waiting time of the patients, the multi server system is recommended and again the calculations were repeated to compare with the original results. This recommendation of M/M/2 queuing model resulted in Zero waiting time of the patients in the queue and are illustrated in Table 15(b). The frequency distributions are given below. TABLE: 1 ARRIVAL DISTRIBUTION FOR NEW PATIENTS TABLE: 2 CHI-SQUARE TEST FOR NEW PATIENTS S.No Time(min) No of Patients Probability S.NO X No of Patients f fx P(x) Ei χ Total Total From Table 2. Null Hypothesis H 0 : The Poisson distribution fits well with arrival. Alternative hypothesis: The Poisson distribution does not fit well into the data. The level of significance: α = 0.01(1%).λ = X = 15.45; Degrees of freedom = 17. Calculated value of χ 2 = Tabulated value of χ 2 for 17 degrees of freedom at 1% level of significance is Since χ 2 < χ , H 0 is accepted and concluded that the arrival follows the Poisson distribution and it is suitable for the given data. From Table 4. Null Hypothesis H 0 : The Poisson distribution fits well with arrival. Alternative hypothesis: The Poisson distribution does not fit well into the data. The level of significance: α = 0.01.λ = X = 14.67; Degrees of freedom = 17. Calculated value of χ 2 = Tabulated value of χ 2 for 17 degrees of freedom at 1% level of significance is Sinceχ 2 < χ , it is accepted as H 0 and concluded that the arrival follows the 274

5 MONTE CARLO SIMULATION STUDY ON M/M/1 AND M/M/2 QUEUEING MODELS IN A MULTI SPECIALITY HOSPITAL... 5 TABLE: 3 ARRIVAL DISTRIBUTIONS FOR PREVIOUS PATIENTS TABLE: 4 CHI-SQUARE TEST FOR PREVIOUS PATIENTS S.No Time(min) No of Patients Probability S.NO X No of Patients f fx P(x) Ei χ Total Total Poisson distribution and it is suitable for the given data. TABLE: 5 TAG NUMBER TABLE FOR NEW PATIENTS TABLE: 6 TAG NUMBER TABLE FOR PREVIOUS PATIENTS S.No Time (min) No of Patients Probability Cumulative Probability Tag numbers S.No Time (min) No of Patients Probability Cumulative Probability Tag numbers Total Total TABLE: 7 SERVICE DISTRIBUTION FOR SPECIALIST TABLE: 8 CHI-SQUARE TEST FOR SPECIALIST S.No Time(min) No of Patients Probability S.NO X No of Patients Ei χ Total Total From Table 8. Null Hypothesis H 0 : The service time of patients are uniformly distributed. The level of significance: α = Degrees of freedom = 7. Calculated value of χ 2 = Tabulated value of χ 2 for 7 degrees of freedom at 1% level of significance is Since χ 2 < χ , it is is accepted as H 0 and concluded that the arrival follows the Poisson distribution and it is suitable for the given time of interval. From Table 10. Null Hypothesis H 0 : The service time of patients are uniformly distributed. The level of significance: α = 0.01.Degrees of freedom = 7. Calculated value of χ 2 = Tabulated value of χ 2 for 7 degrees of freedom at 1% level of significance is 275

6 6 S.Shanmugasundaram, P.Umarani TABLE: 9 SERVICE DISTRIBUTION FOR SUPER SPECIALIST TABLE: 10 CHI-SQUARE TEST FOR SUPER SPECIALIST S.No Time (min) No of Patients Probability S.NO X No of Patients f Ei χ Total Total Since χ 2 < χ , it is accepted as H 0 and concluded that the arrival follows the Poisson distribution and it is fit for the given time of interval. TABLE 11: TAG NUMBER TABLE FOR SPECIALIST TABLE: 12 TAG NUMBER TABLE FOR SUPER SPECIALIST S.No Time(min) No of Patients Probability Cumulative Probability Tag numbers S.No Time(min) No of Patients Probability Cumulative Probability Tag numbers Total Total TABLE: 13 DISTRIBUTIONS FOR ARRIVAL CHOSEN S.No Arrival Probability Cumulative Probability 1 New patients Previous patients TABLE: 14 TAG NUMBER TABLE FOR ARRIVAL CHOSEN S.No Arrival Probability Cumulative Probability Tag numbers 1 New patients Previous patients CALCULATION SIMULATION METHOD [From the Table 15(a)] Expected Waiting Time of new Patient in Queue = 19.6 min Expected Waiting Time of the previous Patient in Queue = 32.75min Total Time spent by new Patient in Hospital = 36.6 min Total Time spent by the previous Patient in Hospital = 49.2 min Average number of new patients in the Queue = 0.88 Average number of previous patients in the Queue = ANALYTICAL METHOD Expected Waiting Time of new Patient in Queue = 15 min Expected Waiting Time of the previous Patient in Queue = 23.3 min Total Time spent by new Patient in Hospital = 25 min Total Time spent by the previous Patient in Hospital = 33.3 min Number of new patients in the Queue = 0.9 Number of previous patients in the Queue =

7 MONTE CARLO SIMULATION STUDY ON M/M/1 AND M/M/2 QUEUEING MODELS IN A MULTI SPECIALITY HOSPITAL NUMERICAL STUDY COMPARISION OF SIMULATION WITH ANALYTICAL IN M/M/1 Figure 1: Bar Chart comparing the waiting time (in minutes) of New & Previous patients in the queue for both Simulation and Analytical Methods (M/M/1 - model). In the chart, the first bar indicates the result through simulation method and the second bar indicates the result through Analytical method. Figure 2: Bar Chart comparing the total time (in minutes) spent by New & Previous patients in the Hospital for both Simulation and Analytical Methods (M/M/1 - model). In the chart, the first bar indicates the result through simulation method and the second bar indicates the result through Analytical method. Figure 3: Bar Chart comparing the Queue length of New & Previous patients for both Simulation and Analytical Methods (M/M/1 - model). In the chart, the first bar indicates the result through simulation method and the second bar indicates the result through Analytical method. 6 CALCULATION SIMULATION METHOD [From the Table 15(b)] Expected Waiting Time of new Patient in Queue = 0 min Expected Waiting Time of the previous Patient in Queue = 0.1 min Total Time spent by new Patient in Hospital = min Total Time spent by the previous Patient in Hospital = min Average number of new patients in the Queue = 0 Average number of previous patients in the Queue = ANALYTICAL METHOD Expected Waiting Time of new Patient in Queue = 1 min 277

8 8 S.Shanmugasundaram, P.Umarani Expected Waiting Time of the previous Patient in Queue = 1.28min Total Time spent by new Patient in Hospital = 11 min Total Time spent by the previous Patient in Hospital = min Number of new patients in the Queue = Number of previous patients in the Queue = NUMERICAL STUDY: COMPARISION OF SIMULATION WITH ANALYTICAL IN M/M/C Figure 4: Bar Chart comparing the total time (in minutes) spent by New and Previous patients in the Hospital for both Simulation and Analytical Methods (M/M/2 - model). In the chart, the first bar indicates the result through simulation method and the second bar indicates the result through Analytical method. 8 CONCLUSION This paper has analyzed the single server (M/M/1) and multi server (M/M/2) queueing models in both Monte Carlo Simulation and Analytical models. The queue formed by the arrival of new patients and the previous patients in the M/M/1 model has been resolved by recommending the M/M/2 model for the specialist doctor and the super specialist doctor. It brings out that the analytical model coincides with the simulation model. Though the study has been directed for a multi specialty hospital, the same technique can be adopted in all the sectors where queue formation is foreseen, which will be a remedial measure for reducing the waiting time of the society. References [1] A.K. Erlang, The Theory of Probabilities of Telephone Conversations, Nyt Jindsskriff Mathematic, B20, (1909), [2] J. Banks, J.S. Carson, B.L, Nelson, and D.M. Nicol, Discrete Event System Simulation, Prentice Hall International Series, Third Edition, (2001), [3] S. Shanmugasundaram and S.Punitha, A Simulation Study on Toll Gate System in M/M/1 Queueing Models, IOSR - Journal of Mathematics, Vol.10, (3), (2014). [4] Ishan P Lade, Sandeep A Chowriwar and Pranay B Sawaitul (2013), Simulation of Queueing Analysis in Hospital, International Journal of Mechanical Engineering and Robotics Research, (2013),Vol. 2, No. 3. [5] S. Shanmugasundaram, and P. Banumathi A Simulation Study on M/M/C Queueing Models, International Journal for Research in Mathematics and Mathematical Sciences, (2016), Vol.2 (2). 278

9 MONTE CARLO SIMULATION STUDY ON M/M/1 AND M/M/2 QUEUEING MODELS IN A MULTI SPECIALITY HOSPITAL... 9 [6] Syed Shujauddin Sameer, Simulation: Analysis of Single Server Queueing Model, International Journal of Information Theory, Vol.3, No.3, (2014). [7] S. Shanmugasundaram and P. Umarani, A Study on M/M/C Queueing Model under Monte Carlo Simulation in a Hospital, International Journal of Pure and Applied Mathematical Sciences. Vol. 9 (2), (2016), [8] Soemon Takakuwa and Athula Wijewickrama, Optimizing Staffing Schedule in Light of Patient Satisfaction for the whole Outpatient Hospital Ward, Proceedings of the 2008 Winter Simulation Conference (2008). [9] S. Shanmugasundaram and P. Umarani A Simulation Study on M/M/1 and M/M/C Queueing Models in a Medical Centre, Mathematical Sciences International Research Journal, Vol.5 (2), (2016). 279

10 10 S.Shanmugasundaram, P.Umarani Above Table continue

11 MONTE CARLO SIMULATION STUDY ON M/M/1 AND M/M/2 QUEUEING MODELS IN A MULTI SPECIALITY HOSPITAL Above Table continue

12 282

ANALYZING ROUGH QUEUEING MODELS WITH PRIORITY DISCIPLINE

ANALYZING ROUGH QUEUEING MODELS WITH PRIORITY DISCIPLINE Inter national Journal of Pure and Applied Mathematics Volume 113 No. 8 2017, 95 103 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu ANALYZING ROUGH

More information

Queuing Theory. The present section focuses on the standard vocabulary of Waiting Line Models.

Queuing Theory. The present section focuses on the standard vocabulary of Waiting Line Models. Queuing Theory Introduction Waiting lines are the most frequently encountered problems in everyday life. For example, queue at a cafeteria, library, bank, etc. Common to all of these cases are the arrivals

More information

Waiting Time Analysis of A Single Server Queue in an Out- Patient Clinic

Waiting Time Analysis of A Single Server Queue in an Out- Patient Clinic IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 11, Issue 3 Ver. V (May - Jun. 2015), PP 54-58 www.iosrjournals.org Waiting Time Analysis of A Single Server Queue in

More information

Non Markovian Queues (contd.)

Non Markovian Queues (contd.) MODULE 7: RENEWAL PROCESSES 29 Lecture 5 Non Markovian Queues (contd) For the case where the service time is constant, V ar(b) = 0, then the P-K formula for M/D/ queue reduces to L s = ρ + ρ 2 2( ρ) where

More information

Classification of Queuing Models

Classification of Queuing Models Classification of Queuing Models Generally Queuing models may be completely specified in the following symbol form:(a/b/c):(d/e)where a = Probability law for the arrival(or inter arrival)time, b = Probability

More information

Chapter 10. Queuing Systems. D (Queuing Theory) Queuing theory is the branch of operations research concerned with waiting lines.

Chapter 10. Queuing Systems. D (Queuing Theory) Queuing theory is the branch of operations research concerned with waiting lines. Chapter 10 Queuing Systems D. 10. 1. (Queuing Theory) Queuing theory is the branch of operations research concerned with waiting lines. D. 10.. (Queuing System) A ueuing system consists of 1. a user source.

More information

The effect of probabilities of departure with time in a bank

The effect of probabilities of departure with time in a bank International Journal of Scientific & Engineering Research, Volume 3, Issue 7, July-2012 The effect of probabilities of departure with time in a bank Kasturi Nirmala, Shahnaz Bathul Abstract This paper

More information

Performance Evaluation of Queuing Systems

Performance Evaluation of Queuing Systems Performance Evaluation of Queuing Systems Introduction to Queuing Systems System Performance Measures & Little s Law Equilibrium Solution of Birth-Death Processes Analysis of Single-Station Queuing Systems

More information

PBW 654 Applied Statistics - I Urban Operations Research

PBW 654 Applied Statistics - I Urban Operations Research PBW 654 Applied Statistics - I Urban Operations Research Lecture 2.I Queuing Systems An Introduction Operations Research Models Deterministic Models Linear Programming Integer Programming Network Optimization

More information

QUEUING SYSTEM. Yetunde Folajimi, PhD

QUEUING SYSTEM. Yetunde Folajimi, PhD QUEUING SYSTEM Yetunde Folajimi, PhD Part 2 Queuing Models Queueing models are constructed so that queue lengths and waiting times can be predicted They help us to understand and quantify the effect of

More information

I, A BRIEF REVIEW ON INFINITE QUEUE MODEL M.

I, A BRIEF REVIEW ON INFINITE QUEUE MODEL M. A BRIEF REVIEW ON INFINITE QUEUE MODEL M. Vasuki*, A. Dinesh Kumar** & G. Vijayaprabha** * Assistant Professor, Department of Mathematics, Srinivasan College of Arts and Science, Perambalur, Tamilnadu

More information

Waiting Line Models: Queuing Theory Basics. Metodos Cuantitativos M. En C. Eduardo Bustos Farias 1

Waiting Line Models: Queuing Theory Basics. Metodos Cuantitativos M. En C. Eduardo Bustos Farias 1 Waiting Line Models: Queuing Theory Basics Cuantitativos M. En C. Eduardo Bustos Farias 1 Agenda Queuing system structure Performance measures Components of queuing systems Arrival process Service process

More information

Figure 10.1: Recording when the event E occurs

Figure 10.1: Recording when the event E occurs 10 Poisson Processes Let T R be an interval. A family of random variables {X(t) ; t T} is called a continuous time stochastic process. We often consider T = [0, 1] and T = [0, ). As X(t) is a random variable

More information

EE 368. Weeks 3 (Notes)

EE 368. Weeks 3 (Notes) EE 368 Weeks 3 (Notes) 1 State of a Queuing System State: Set of parameters that describe the condition of the system at a point in time. Why do we need it? Average size of Queue Average waiting time How

More information

Queueing Theory. VK Room: M Last updated: October 17, 2013.

Queueing Theory. VK Room: M Last updated: October 17, 2013. Queueing Theory VK Room: M1.30 knightva@cf.ac.uk www.vincent-knight.com Last updated: October 17, 2013. 1 / 63 Overview Description of Queueing Processes The Single Server Markovian Queue Multi Server

More information

Networking = Plumbing. Queueing Analysis: I. Last Lecture. Lecture Outline. Jeremiah Deng. 29 July 2013

Networking = Plumbing. Queueing Analysis: I. Last Lecture. Lecture Outline. Jeremiah Deng. 29 July 2013 Networking = Plumbing TELE302 Lecture 7 Queueing Analysis: I Jeremiah Deng University of Otago 29 July 2013 Jeremiah Deng (University of Otago) TELE302 Lecture 7 29 July 2013 1 / 33 Lecture Outline Jeremiah

More information

Introduction to queuing theory

Introduction to queuing theory Introduction to queuing theory Claude Rigault ENST claude.rigault@enst.fr Introduction to Queuing theory 1 Outline The problem The number of clients in a system The client process Delay processes Loss

More information

Queuing Theory. Using the Math. Management Science

Queuing Theory. Using the Math. Management Science Queuing Theory Using the Math 1 Markov Processes (Chains) A process consisting of a countable sequence of stages, that can be judged at each stage to fall into future states independent of how the process

More information

NICTA Short Course. Network Analysis. Vijay Sivaraman. Day 1 Queueing Systems and Markov Chains. Network Analysis, 2008s2 1-1

NICTA Short Course. Network Analysis. Vijay Sivaraman. Day 1 Queueing Systems and Markov Chains. Network Analysis, 2008s2 1-1 NICTA Short Course Network Analysis Vijay Sivaraman Day 1 Queueing Systems and Markov Chains Network Analysis, 2008s2 1-1 Outline Why a short course on mathematical analysis? Limited current course offering

More information

Chapter 6 Queueing Models. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation

Chapter 6 Queueing Models. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation Chapter 6 Queueing Models Banks, Carson, Nelson & Nicol Discrete-Event System Simulation Purpose Simulation is often used in the analysis of queueing models. A simple but typical queueing model: Queueing

More information

Dr. Maddah ENMG 617 EM Statistics 10/15/12. Nonparametric Statistics (2) (Goodness of fit tests)

Dr. Maddah ENMG 617 EM Statistics 10/15/12. Nonparametric Statistics (2) (Goodness of fit tests) Dr. Maddah ENMG 617 EM Statistics 10/15/12 Nonparametric Statistics (2) (Goodness of fit tests) Introduction Probability models used in decision making (Operations Research) and other fields require fitting

More information

CHAPTER 3 STOCHASTIC MODEL OF A GENERAL FEED BACK QUEUE NETWORK

CHAPTER 3 STOCHASTIC MODEL OF A GENERAL FEED BACK QUEUE NETWORK CHAPTER 3 STOCHASTIC MODEL OF A GENERAL FEED BACK QUEUE NETWORK 3. INTRODUCTION: Considerable work has been turned out by Mathematicians and operation researchers in the development of stochastic and simulation

More information

Chi-Squared Tests. Semester 1. Chi-Squared Tests

Chi-Squared Tests. Semester 1. Chi-Squared Tests Semester 1 Goodness of Fit Up to now, we have tested hypotheses concerning the values of population parameters such as the population mean or proportion. We have not considered testing hypotheses about

More information

12.10 (STUDENT CD-ROM TOPIC) CHI-SQUARE GOODNESS- OF-FIT TESTS

12.10 (STUDENT CD-ROM TOPIC) CHI-SQUARE GOODNESS- OF-FIT TESTS CDR4_BERE601_11_SE_C1QXD 1//08 1:0 PM Page 1 110: (Student CD-ROM Topic) Chi-Square Goodness-of-Fit Tests CD1-1 110 (STUDENT CD-ROM TOPIC) CHI-SQUARE GOODNESS- OF-FIT TESTS In this section, χ goodness-of-fit

More information

Chapter 5: Special Types of Queuing Models

Chapter 5: Special Types of Queuing Models Chapter 5: Special Types of Queuing Models Some General Queueing Models Discouraged Arrivals Impatient Arrivals Bulk Service and Bulk Arrivals OR37-Dr.Khalid Al-Nowibet 1 5.1 General Queueing Models 1.

More information

Systems Simulation Chapter 6: Queuing Models

Systems Simulation Chapter 6: Queuing Models Systems Simulation Chapter 6: Queuing Models Fatih Cavdur fatihcavdur@uludag.edu.tr April 2, 2014 Introduction Introduction Simulation is often used in the analysis of queuing models. A simple but typical

More information

Slides 9: Queuing Models

Slides 9: Queuing Models Slides 9: Queuing Models Purpose Simulation is often used in the analysis of queuing models. A simple but typical queuing model is: Queuing models provide the analyst with a powerful tool for designing

More information

Queueing Theory and Simulation. Introduction

Queueing Theory and Simulation. Introduction Queueing Theory and Simulation Based on the slides of Dr. Dharma P. Agrawal, University of Cincinnati and Dr. Hiroyuki Ohsaki Graduate School of Information Science & Technology, Osaka University, Japan

More information

Chapter 1. Introduction. 1.1 Stochastic process

Chapter 1. Introduction. 1.1 Stochastic process Chapter 1 Introduction Process is a phenomenon that takes place in time. In many practical situations, the result of a process at any time may not be certain. Such a process is called a stochastic process.

More information

Queuing Analysis. Chapter Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall

Queuing Analysis. Chapter Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall Queuing Analysis Chapter 13 13-1 Chapter Topics Elements of Waiting Line Analysis The Single-Server Waiting Line System Undefined and Constant Service Times Finite Queue Length Finite Calling Problem The

More information

COMP9334 Capacity Planning for Computer Systems and Networks

COMP9334 Capacity Planning for Computer Systems and Networks COMP9334 Capacity Planning for Computer Systems and Networks Week 2: Operational Analysis and Workload Characterisation COMP9334 1 Last lecture Modelling of computer systems using Queueing Networks Open

More information

Chapter 2 Queueing Theory and Simulation

Chapter 2 Queueing Theory and Simulation Chapter 2 Queueing Theory and Simulation Based on the slides of Dr. Dharma P. Agrawal, University of Cincinnati and Dr. Hiroyuki Ohsaki Graduate School of Information Science & Technology, Osaka University,

More information

λ λ λ In-class problems

λ λ λ In-class problems In-class problems 1. Customers arrive at a single-service facility at a Poisson rate of 40 per hour. When two or fewer customers are present, a single attendant operates the facility, and the service time

More information

Continuous Time Processes

Continuous Time Processes page 102 Chapter 7 Continuous Time Processes 7.1 Introduction In a continuous time stochastic process (with discrete state space), a change of state can occur at any time instant. The associated point

More information

Sandwich shop : a queuing net work with finite disposable resources queue and infinite resources queue

Sandwich shop : a queuing net work with finite disposable resources queue and infinite resources queue Sandwich shop : a queuing net work with finite disposable resources queue and infinite resources queue Final project for ISYE 680: Queuing systems and Applications Hongtan Sun May 5, 05 Introduction As

More information

Data analysis and stochastic modeling

Data analysis and stochastic modeling Data analysis and stochastic modeling Lecture 7 An introduction to queueing theory Guillaume Gravier guillaume.gravier@irisa.fr with a lot of help from Paul Jensen s course http://www.me.utexas.edu/ jensen/ormm/instruction/powerpoint/or_models_09/14_queuing.ppt

More information

ASSIGNMENT - 1 M.Sc. DEGREE EXAMINATION, MAY 2019 Second Year STATISTICS. Statistical Quality Control MAXIMUM : 30 MARKS ANSWER ALL QUESTIONS

ASSIGNMENT - 1 M.Sc. DEGREE EXAMINATION, MAY 2019 Second Year STATISTICS. Statistical Quality Control MAXIMUM : 30 MARKS ANSWER ALL QUESTIONS ASSIGNMENT - 1 Statistical Quality Control (DMSTT21) Q1) a) Explain the role and importance of statistical quality control in industry. b) Explain control charts for variables. Write the LCL, UCL for X,

More information

IOE 202: lectures 11 and 12 outline

IOE 202: lectures 11 and 12 outline IOE 202: lectures 11 and 12 outline Announcements Last time... Queueing models intro Performance characteristics of a queueing system Steady state analysis of an M/M/1 queueing system Other queueing systems,

More information

Network Analysis of Fuzzy Bi-serial and Parallel Servers with a Multistage Flow Shop Model

Network Analysis of Fuzzy Bi-serial and Parallel Servers with a Multistage Flow Shop Model 2st International Congress on Modelling and Simulation, Gold Coast, Australia, 29 Nov to 4 Dec 205 wwwmssanzorgau/modsim205 Network Analysis of Fuzzy Bi-serial and Parallel Servers with a Multistage Flow

More information

Introduction to queuing theory

Introduction to queuing theory Introduction to queuing theory Queu(e)ing theory Queu(e)ing theory is the branch of mathematics devoted to how objects (packets in a network, people in a bank, processes in a CPU etc etc) join and leave

More information

Exercises Stochastic Performance Modelling. Hamilton Institute, Summer 2010

Exercises Stochastic Performance Modelling. Hamilton Institute, Summer 2010 Exercises Stochastic Performance Modelling Hamilton Institute, Summer Instruction Exercise Let X be a non-negative random variable with E[X ]

More information

Computer Systems Modelling

Computer Systems Modelling Computer Systems Modelling Computer Laboratory Computer Science Tripos, Part II Michaelmas Term 2003 R. J. Gibbens Problem sheet William Gates Building JJ Thomson Avenue Cambridge CB3 0FD http://www.cl.cam.ac.uk/

More information

L = λ W time average number in Line or system arrival rate W average Waiting time per customer

L = λ W time average number in Line or system arrival rate W average Waiting time per customer IEOR 4615, Lecture 3, January 27, 2015 L λ Little s Law* L = λ W time average number in Line or system arrival rate W average Waiting time per customer *J. D. C. Little, A proof of the queueing formula:

More information

Analysis of Call Center Data

Analysis of Call Center Data University of Pennsylvania ScholarlyCommons Wharton Research Scholars Wharton School 4-1-2004 Analysis of Call Center Data Yu Chu Cheng University of Pennsylvania Follow this and additional works at: http://repository.upenn.edu/wharton_research_scholars

More information

57:022 Principles of Design II Final Exam Solutions - Spring 1997

57:022 Principles of Design II Final Exam Solutions - Spring 1997 57:022 Principles of Design II Final Exam Solutions - Spring 1997 Part: I II III IV V VI Total Possible Pts: 52 10 12 16 13 12 115 PART ONE Indicate "+" if True and "o" if False: + a. If a component's

More information

Queueing Review. Christos Alexopoulos and Dave Goldsman 10/6/16. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA

Queueing Review. Christos Alexopoulos and Dave Goldsman 10/6/16. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA 1 / 24 Queueing Review (mostly from BCNN) Christos Alexopoulos and Dave Goldsman Georgia Institute of Technology, Atlanta, GA, USA 10/6/16 2 / 24 Outline 1 Introduction 2 Queueing Notation 3 Transient

More information

1.225 Transportation Flow Systems Quiz (December 17, 2001; Duration: 3 hours)

1.225 Transportation Flow Systems Quiz (December 17, 2001; Duration: 3 hours) 1.225 Transportation Flow Systems Quiz (December 17, 2001; Duration: 3 hours) Student Name: Alias: Instructions: 1. This exam is open-book 2. No cooperation is permitted 3. Please write down your name

More information

Outline. Finite source queue M/M/c//K Queues with impatience (balking, reneging, jockeying, retrial) Transient behavior Advanced Queue.

Outline. Finite source queue M/M/c//K Queues with impatience (balking, reneging, jockeying, retrial) Transient behavior Advanced Queue. Outline Finite source queue M/M/c//K Queues with impatience (balking, reneging, jockeying, retrial) Transient behavior Advanced Queue Batch queue Bulk input queue M [X] /M/1 Bulk service queue M/M [Y]

More information

6 Solving Queueing Models

6 Solving Queueing Models 6 Solving Queueing Models 6.1 Introduction In this note we look at the solution of systems of queues, starting with simple isolated queues. The benefits of using predefined, easily classified queues will

More information

Calculation of Steady-State Probabilities of M/M Queues: Further Approaches. Queuing Theory and Applications (MA597)

Calculation of Steady-State Probabilities of M/M Queues: Further Approaches. Queuing Theory and Applications (MA597) Calculation of Steady-State Probabilities of M/M Queues: Further Approaches A assignment report submitted for the course Queuing Theory and Applications (MA597) by Ambati Narendar Reddy Roll No. 06212301

More information

Discrete-Event System Simulation

Discrete-Event System Simulation Discrete-Event System Simulation FOURTH EDITION Jerry Banks Independent Consultant John S. Carson II Brooks Automation Barry L. Nelson Northwestern University David M. Nicol University of Illinois, Urbana-Champaign

More information

λ, µ, ρ, A n, W n, L(t), L, L Q, w, w Q etc. These

λ, µ, ρ, A n, W n, L(t), L, L Q, w, w Q etc. These Queuing theory models systems with servers and clients (presumably waiting in queues). Notation: there are many standard symbols like λ, µ, ρ, A n, W n, L(t), L, L Q, w, w Q etc. These represent the actual

More information

Chapter 10. Chapter 10. Multinomial Experiments and. Multinomial Experiments and Contingency Tables. Contingency Tables.

Chapter 10. Chapter 10. Multinomial Experiments and. Multinomial Experiments and Contingency Tables. Contingency Tables. Chapter 10 Multinomial Experiments and Contingency Tables 1 Chapter 10 Multinomial Experiments and Contingency Tables 10-1 1 Overview 10-2 2 Multinomial Experiments: of-fitfit 10-3 3 Contingency Tables:

More information

Verification and Validation. CS1538: Introduction to Simulations

Verification and Validation. CS1538: Introduction to Simulations Verification and Validation CS1538: Introduction to Simulations Steps in a Simulation Study Problem & Objective Formulation Model Conceptualization Data Collection Model translation, Verification, Validation

More information

Queueing Review. Christos Alexopoulos and Dave Goldsman 10/25/17. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA

Queueing Review. Christos Alexopoulos and Dave Goldsman 10/25/17. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA 1 / 26 Queueing Review (mostly from BCNN) Christos Alexopoulos and Dave Goldsman Georgia Institute of Technology, Atlanta, GA, USA 10/25/17 2 / 26 Outline 1 Introduction 2 Queueing Notation 3 Transient

More information

Vehicle Arrival Models : Count

Vehicle Arrival Models : Count Transportation System Engineering 34. Vehicle Arrival Models : Count Chapter 34 Vehicle Arrival Models : Count h 1 h 2 h 3 h 4 h 5 h 6 h 7 h 8 h 9 h 10 t 1 t 2 t 3 t 4 Time Figure 34.1: Illustration of

More information

Queueing Theory I Summary! Little s Law! Queueing System Notation! Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K "

Queueing Theory I Summary! Little s Law! Queueing System Notation! Stationary Analysis of Elementary Queueing Systems  M/M/1  M/M/m  M/M/1/K Queueing Theory I Summary Little s Law Queueing System Notation Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K " Little s Law a(t): the process that counts the number of arrivals

More information

Advanced Computer Networks Lecture 3. Models of Queuing

Advanced Computer Networks Lecture 3. Models of Queuing Advanced Computer Networks Lecture 3. Models of Queuing Husheng Li Min Kao Department of Electrical Engineering and Computer Science University of Tennessee, Knoxville Spring, 2016 1/13 Terminology of

More information

YORK UNIVERSITY FACULTY OF ARTS DEPARTMENT OF MATHEMATICS AND STATISTICS MATH , YEAR APPLIED OPTIMIZATION (TEST #4 ) (SOLUTIONS)

YORK UNIVERSITY FACULTY OF ARTS DEPARTMENT OF MATHEMATICS AND STATISTICS MATH , YEAR APPLIED OPTIMIZATION (TEST #4 ) (SOLUTIONS) YORK UNIVERSITY FACULTY OF ARTS DEPARTMENT OF MATHEMATICS AND STATISTICS Instructor : Dr. Igor Poliakov MATH 4570 6.0, YEAR 2006-07 APPLIED OPTIMIZATION (TEST #4 ) (SOLUTIONS) March 29, 2007 Name (print)

More information

Kendall notation. PASTA theorem Basics of M/M/1 queue

Kendall notation. PASTA theorem Basics of M/M/1 queue Elementary queueing system Kendall notation Little s Law PASTA theorem Basics of M/M/1 queue 1 History of queueing theory An old research area Started in 1909, by Agner Erlang (to model the Copenhagen

More information

Little s result. T = average sojourn time (time spent) in the system N = average number of customers in the system. Little s result says that

Little s result. T = average sojourn time (time spent) in the system N = average number of customers in the system. Little s result says that J. Virtamo 38.143 Queueing Theory / Little s result 1 Little s result The result Little s result or Little s theorem is a very simple (but fundamental) relation between the arrival rate of customers, average

More information

Chapter 3 Balance equations, birth-death processes, continuous Markov Chains

Chapter 3 Balance equations, birth-death processes, continuous Markov Chains Chapter 3 Balance equations, birth-death processes, continuous Markov Chains Ioannis Glaropoulos November 4, 2012 1 Exercise 3.2 Consider a birth-death process with 3 states, where the transition rate

More information

5/15/18. Operations Research: An Introduction Hamdy A. Taha. Copyright 2011, 2007 by Pearson Education, Inc. All rights reserved.

5/15/18. Operations Research: An Introduction Hamdy A. Taha. Copyright 2011, 2007 by Pearson Education, Inc. All rights reserved. The objective of queuing analysis is to offer a reasonably satisfactory service to waiting customers. Unlike the other tools of OR, queuing theory is not an optimization technique. Rather, it determines

More information

Introduction to Markov Chains, Queuing Theory, and Network Performance

Introduction to Markov Chains, Queuing Theory, and Network Performance Introduction to Markov Chains, Queuing Theory, and Network Performance Marceau Coupechoux Telecom ParisTech, departement Informatique et Réseaux marceau.coupechoux@telecom-paristech.fr IT.2403 Modélisation

More information

Course Outline Introduction to Transportation Highway Users and their Performance Geometric Design Pavement Design

Course Outline Introduction to Transportation Highway Users and their Performance Geometric Design Pavement Design Course Outline Introduction to Transportation Highway Users and their Performance Geometric Design Pavement Design Speed Studies - Project Traffic Queuing Intersections Level of Service in Highways and

More information

Contents LIST OF TABLES... LIST OF FIGURES... xvii. LIST OF LISTINGS... xxi PREFACE. ...xxiii

Contents LIST OF TABLES... LIST OF FIGURES... xvii. LIST OF LISTINGS... xxi PREFACE. ...xxiii LIST OF TABLES... xv LIST OF FIGURES... xvii LIST OF LISTINGS... xxi PREFACE...xxiii CHAPTER 1. PERFORMANCE EVALUATION... 1 1.1. Performance evaluation... 1 1.2. Performance versus resources provisioning...

More information

One billion+ terminals in voice network alone

One billion+ terminals in voice network alone Traffic Engineering Traffic Engineering One billion+ terminals in voice networ alone Plus data, video, fax, finance, etc. Imagine all users want service simultaneously its not even nearly possible (despite

More information

Chapter 11 Output Analysis for a Single Model. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation

Chapter 11 Output Analysis for a Single Model. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation Chapter 11 Output Analysis for a Single Model Banks, Carson, Nelson & Nicol Discrete-Event System Simulation Purpose Objective: Estimate system performance via simulation If q is the system performance,

More information

Queuing Theory and Stochas St t ochas ic Service Syste y ms Li Xia

Queuing Theory and Stochas St t ochas ic Service Syste y ms Li Xia Queuing Theory and Stochastic Service Systems Li Xia Syllabus Instructor Li Xia 夏俐, FIT 3 618, 62793029, xial@tsinghua.edu.cn Text book D. Gross, J.F. Shortle, J.M. Thompson, and C.M. Harris, Fundamentals

More information

Name of the Student:

Name of the Student: SUBJECT NAME : Probability & Queueing Theory SUBJECT CODE : MA 6453 MATERIAL NAME : Part A questions REGULATION : R2013 UPDATED ON : November 2017 (Upto N/D 2017 QP) (Scan the above QR code for the direct

More information

CS418 Operating Systems

CS418 Operating Systems CS418 Operating Systems Lecture 14 Queuing Analysis Textbook: Operating Systems by William Stallings 1 1. Why Queuing Analysis? If the system environment changes (like the number of users is doubled),

More information

Hypothesis Tests and Estimation for Population Variances. Copyright 2014 Pearson Education, Inc.

Hypothesis Tests and Estimation for Population Variances. Copyright 2014 Pearson Education, Inc. Hypothesis Tests and Estimation for Population Variances 11-1 Learning Outcomes Outcome 1. Formulate and carry out hypothesis tests for a single population variance. Outcome 2. Develop and interpret confidence

More information

Chapter 11. Output Analysis for a Single Model Prof. Dr. Mesut Güneş Ch. 11 Output Analysis for a Single Model

Chapter 11. Output Analysis for a Single Model Prof. Dr. Mesut Güneş Ch. 11 Output Analysis for a Single Model Chapter Output Analysis for a Single Model. Contents Types of Simulation Stochastic Nature of Output Data Measures of Performance Output Analysis for Terminating Simulations Output Analysis for Steady-state

More information

Advanced/Advanced Subsidiary. You must have: Mathematical Formulae and Statistical Tables (Blue)

Advanced/Advanced Subsidiary. You must have: Mathematical Formulae and Statistical Tables (Blue) Write your name here Surname Other names Pearson Edexcel International Advanced Level Centre Number Statistics S2 Advanced/Advanced Subsidiary Candidate Number Monday 26 June 2017 Afternoon Time: 1 hour

More information

Section 9.5. Testing the Difference Between Two Variances. Bluman, Chapter 9 1

Section 9.5. Testing the Difference Between Two Variances. Bluman, Chapter 9 1 Section 9.5 Testing the Difference Between Two Variances Bluman, Chapter 9 1 This the last day the class meets before spring break starts. Please make sure to be present for the test or make appropriate

More information

Quiz Queue II. III. ( ) ( ) =1.3333

Quiz Queue II. III. ( ) ( ) =1.3333 Quiz Queue UMJ, a mail-order company, receives calls to place orders at an average of 7.5 minutes intervals. UMJ hires one operator and can handle each call in about every 5 minutes on average. The inter-arrival

More information

An M/M/1/N Queuing system with Encouraged Arrivals

An M/M/1/N Queuing system with Encouraged Arrivals Global Journal of Pure and Applied Mathematics. ISS 0973-1768 Volume 13, umber 7 (2017), pp. 3443-3453 Research India Publications http://www.ripublication.com An M/M/1/ Queuing system with Encouraged

More information

ISE/OR 762 Stochastic Simulation Techniques

ISE/OR 762 Stochastic Simulation Techniques ISE/OR 762 Stochastic Simulation Techniques Topic 0: Introduction to Discrete Event Simulation Yunan Liu Department of Industrial and Systems Engineering NC State University January 9, 2018 Yunan Liu (NC

More information

NANYANG TECHNOLOGICAL UNIVERSITY SEMESTER I EXAMINATION MH4702/MAS446/MTH437 Probabilistic Methods in OR

NANYANG TECHNOLOGICAL UNIVERSITY SEMESTER I EXAMINATION MH4702/MAS446/MTH437 Probabilistic Methods in OR NANYANG TECHNOLOGICAL UNIVERSITY SEMESTER I EXAMINATION 2013-201 MH702/MAS6/MTH37 Probabilistic Methods in OR December 2013 TIME ALLOWED: 2 HOURS INSTRUCTIONS TO CANDIDATES 1. This examination paper contains

More information

BIRTH DEATH PROCESSES AND QUEUEING SYSTEMS

BIRTH DEATH PROCESSES AND QUEUEING SYSTEMS BIRTH DEATH PROCESSES AND QUEUEING SYSTEMS Andrea Bobbio Anno Accademico 999-2000 Queueing Systems 2 Notation for Queueing Systems /λ mean time between arrivals S = /µ ρ = λ/µ N mean service time traffic

More information

Solutions to COMP9334 Week 8 Sample Problems

Solutions to COMP9334 Week 8 Sample Problems Solutions to COMP9334 Week 8 Sample Problems Problem 1: Customers arrive at a grocery store s checkout counter according to a Poisson process with rate 1 per minute. Each customer carries a number of items

More information

Computer Systems Modelling

Computer Systems Modelling Computer Systems Modelling Computer Laboratory Computer Science Tripos, Part II Lent Term 2010/11 R. J. Gibbens Problem sheet William Gates Building 15 JJ Thomson Avenue Cambridge CB3 0FD http://www.cl.cam.ac.uk/

More information

Readings: Finish Section 5.2

Readings: Finish Section 5.2 LECTURE 19 Readings: Finish Section 5.2 Lecture outline Markov Processes I Checkout counter example. Markov process: definition. -step transition probabilities. Classification of states. Example: Checkout

More information

Simulation model input analysis

Simulation model input analysis Construction Operation Simulation Lecture #8 Simulation model input analysis Amin Alvanchi, PhD Construction Engineering and Management Department of Civil Engineering, Sharif University of Technology

More information

EEC 686/785 Modeling & Performance Evaluation of Computer Systems. Lecture 19

EEC 686/785 Modeling & Performance Evaluation of Computer Systems. Lecture 19 EEC 686/785 Modeling & Performance Evaluation of Computer Systems Lecture 19 Department of Electrical and Computer Engineering Cleveland State University wenbing@ieee.org (based on Dr. Raj Jain s lecture

More information

Recap. Probability, stochastic processes, Markov chains. ELEC-C7210 Modeling and analysis of communication networks

Recap. Probability, stochastic processes, Markov chains. ELEC-C7210 Modeling and analysis of communication networks Recap Probability, stochastic processes, Markov chains ELEC-C7210 Modeling and analysis of communication networks 1 Recap: Probability theory important distributions Discrete distributions Geometric distribution

More information

Introduction to Queueing Theory

Introduction to Queueing Theory Introduction to Queueing Theory Raj Jain Washington University in Saint Louis Jain@eecs.berkeley.edu or Jain@wustl.edu A Mini-Course offered at UC Berkeley, Sept-Oct 2012 These slides and audio/video recordings

More information

Simulation & Modeling Event-Oriented Simulations

Simulation & Modeling Event-Oriented Simulations Simulation & Modeling Event-Oriented Simulations Outline Simulation modeling characteristics Concept of Time A DES Simulation (Computation) DES System = model + simulation execution Data Structures Program

More information

Outline. Simulation of a Single-Server Queueing System. EEC 686/785 Modeling & Performance Evaluation of Computer Systems.

Outline. Simulation of a Single-Server Queueing System. EEC 686/785 Modeling & Performance Evaluation of Computer Systems. EEC 686/785 Modeling & Performance Evaluation of Computer Systems Lecture 19 Outline Simulation of a Single-Server Queueing System Review of midterm # Department of Electrical and Computer Engineering

More information

EDEXCEL S2 PAPERS MARK SCHEMES AVAILABLE AT:

EDEXCEL S2 PAPERS MARK SCHEMES AVAILABLE AT: EDEXCEL S2 PAPERS 2009-2007. MARK SCHEMES AVAILABLE AT: http://www.physicsandmathstutor.com/a-level-maths-papers/s2-edexcel/ JUNE 2009 1. A bag contains a large number of counters of which 15% are coloured

More information

On Tandem Blocking Queues with a Common Retrial Queue

On Tandem Blocking Queues with a Common Retrial Queue On Tandem Blocking Queues with a Common Retrial Queue K. Avrachenkov U. Yechiali Abstract We consider systems of tandem blocking queues having a common retrial queue. The model represents dynamics of short

More information

2905 Queueing Theory and Simulation PART IV: SIMULATION

2905 Queueing Theory and Simulation PART IV: SIMULATION 2905 Queueing Theory and Simulation PART IV: SIMULATION 22 Random Numbers A fundamental step in a simulation study is the generation of random numbers, where a random number represents the value of a random

More information

CPSC 531: System Modeling and Simulation. Carey Williamson Department of Computer Science University of Calgary Fall 2017

CPSC 531: System Modeling and Simulation. Carey Williamson Department of Computer Science University of Calgary Fall 2017 CPSC 531: System Modeling and Simulation Carey Williamson Department of Computer Science University of Calgary Fall 2017 Motivating Quote for Queueing Models Good things come to those who wait - poet/writer

More information

Fuzzy Queues with Priority Discipline

Fuzzy Queues with Priority Discipline Applied Mathematical Sciences, Vol. 4,, no., 575-58 Fuzzy Queues with Priority Discipline W. Ritha* and Lilly Robert Department of Mathematics Holy Cross College (Autonomous) Trichirapalli, Tamilnadu,

More information

Operations Research II, IEOR161 University of California, Berkeley Spring 2007 Final Exam. Name: Student ID:

Operations Research II, IEOR161 University of California, Berkeley Spring 2007 Final Exam. Name: Student ID: Operations Research II, IEOR161 University of California, Berkeley Spring 2007 Final Exam 1 2 3 4 5 6 7 8 9 10 7 questions. 1. [5+5] Let X and Y be independent exponential random variables where X has

More information

Queuing Theory. Queuing Theory. Fatih Cavdur April 27, 2015

Queuing Theory. Queuing Theory. Fatih Cavdur April 27, 2015 Queuing Theory Fatih Cavdur fatihcavdur@uludag.edu.tr April 27, 2015 Introduction Introduction Simulation is often used in the analysis of queuing models. A simple but typical model is the single-server

More information

Lecture Notes of Communication Network I y: part 5. Lijun Qian. Rutgers The State University of New Jersey. 94 Brett Road. Piscataway, NJ

Lecture Notes of Communication Network I y: part 5. Lijun Qian. Rutgers The State University of New Jersey. 94 Brett Road. Piscataway, NJ Lecture Notes of Communication Network I y: part 5 Lijun Qian Department of Electrical Engineering Rutgers The State University of New Jersey 94 Brett Road Piscataway, NJ 08854-8058 October 6, 1998 Abstract

More information

Class 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis.

Class 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis. Service Engineering Class 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis. G/G/1 Queue: Virtual Waiting Time (Unfinished Work). GI/GI/1: Lindley s Equations

More information

Probability and Statistics Concepts

Probability and Statistics Concepts University of Central Florida Computer Science Division COT 5611 - Operating Systems. Spring 014 - dcm Probability and Statistics Concepts Random Variable: a rule that assigns a numerical value to each

More information

Uniform random numbers generators

Uniform random numbers generators Uniform random numbers generators Lecturer: Dmitri A. Moltchanov E-mail: moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/tlt-2707/ OUTLINE: The need for random numbers; Basic steps in generation; Uniformly

More information