IOE 202: lectures 11 and 12 outline
|
|
- Rafe Morris
- 6 years ago
- Views:
Transcription
1 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, including M/M/s and M/M/s/s Cost analysis of queueing systems IOE 202: Operations Modeling, Fall 2009 Page 1 Last time: characterizing behavior of uncertain continuous quantities Characterization through range of possible values and probability density function over that range Probability of taking on a particular value is 0 Probability of taking on a value in a given range equals to the integral of the density function over this range. Examples of 3 important distributions of continuous r.v. s: Uniform (U(a, b)) everything between a and b equally likely Normal (N(µ, σ)) known quantilies in terms of standard deviations Exponential (Exponential with rate λ) memoryless! IOE 202: Operations Modeling, Fall 2009 Page 2
2 Queues and queueing models Waiting in line: in a bank, a store, toll booth, traffic light Submitting jobs to a server, or to a printer, or to a repair shop One purpose of building queueing models is to analyze an existing system to quantify its performance characteristics (such as the average waiting time, average number of customers in line, what fraction of the servers are busy, etc.) Another purpose is to explore how the system can be made better Analysis of queueing systems sometimes can be performed analytically; sometimes, simulation analysis is needed. In the forthcoming lectures, we will mostly focus on the systems for which analytical results are available; however, they are too complicated to be derived from first principles, so a lot of formulas will be given, not derived... IOE 202: Operations Modeling, Fall 2009 Page 3 A very simple queueing system Jobs are submitted to the computer server every 15 seconds. It takes the server exactly 13 seconds to process each job; jobs are executed in order of submission, one at a time. 1. How long does a job wait to start? 2. At any given time, how many jobs are waiting in the queue? 3. What fraction of the time is the server busy? 4. The activity monitor displays IDs of the next 8 jobs to be processed (after the current job is completed). What fraction of the time is there room on this list? 5. Assuming the number of jobs submitted to the server is not going to change in the near future, is it worthwhile to replace it with a faster server? 6. What if the server is slower than usual, and so takes 14 seconds to complete each job? IOE 202: Operations Modeling, Fall 2009 Page 4
3 A more complicated queueing system Jobs are submitted to the computer server, on average, every 15 seconds; theinterarrivaltimesareexponentially distributed. The time the server spends on each job is exponentially distributed, with the mean of 13 seconds. 1. How long does a job wait to start? 2. At any given time, how many jobs are waiting in the queue? 3. What fraction of the time is the server busy? 4. The activity monitor displays IDs of the next 8 jobs to be processed. What fraction of the time is there room on this list? 5. Assuming the number of jobs submitted to the server is not going to change in the near future, is it worthwhile to replace it with another server? 6. What if the server is slower than usual, and so takes on average 14 seconds to complete each job? IOE 202: Operations Modeling, Fall 2009 Page 5 Spreadsheet simulation model for the server problem Recall: an exponentially distributed random variable with rate α has mean 1 α For job k =1, 2, 3, 4,..., let us denote by... T (k) the interarrival time, i.e., the time between arrivals of (k 1)st and kth jobs, exponentials with parameter λ =1/15 S(k) the time the job takes to execute, exponentials with parameter µ = 1/13 Note: W (k) =W q (k)+s(k), where W q (k) timethekth job spends waiting W (k) total time the kth job spends in the system Also note: W q (k) =max(0, W (k 1) T (k)). To see why this is true: (k 1)st job spends a total of W (k 1) sec in the system The kth job arrives T (k) secafterthe(k 1)st job does If W (k 1) T (k) sec,kth job does not have to wait at all If W (k 1) > T (k) sec,kth job has to wait W (k 1) T (k) secinthequeue IOE 202: Operations Modeling, Fall 2009 Page 6
4 Impact of uncertainty on the queue Uncertainty/variability in Times between arrivals of successive jobs, and Service times required by the jobs has a profound effect on the performance of the queueing system, seen through Variability of waiting times and total times spend in the system by each job Fluctuation of the length of the queue and overall number of jobs in the system over time We observed in the simulation of the computer server that, over a long observation period, the system shows a long-run behavioral pattern (e.g., every once in a while, the queue empties, etc.) IOE 202: Operations Modeling, Fall 2009 Page 7 Short-run vs. steady-state (long-run) behavior Example: line at Quiznos starting at noon For the next 15 or 30 minutes short-run After 2 PM steady state To distinguish, consider whether initial conditions affect the average behavior. If no significant effect is observed, steady-state performance is being observed. Suppose one day a group of 15 visiting HS students is taken to buy lunch at Quiznos at 11:50 On that day, the average queue length between noon at 12:30 is much larger than on a typical day Average queue length between noon at 6 PM is about the same as on a typical day Requirements for a system to reach steady state: Parameters of the system remain constant System is stable, i.e., on average, the servers are fast enough to keep up with arrivals. IOE 202: Operations Modeling, Fall 2009 Page 8
5 Average performance measures The performance of a queueing system in steady state can be summarized through averages. For instance, one could ask On average, how long is the line at Quiznos in the afternoon? On average, how often are the cashiers at Quiznos doing nothing, because there are no customers? On average, how long would I have to wait in line if I go to Quiznos in the afternoon? IOE 202: Operations Modeling, Fall 2009 Page 9 Performance measures for a stable system in steady state: Time averages L Q, the average/expected number of jobs in the queue L Sys, the average/expected number of jobs in the system L Serv, the average/expected number of jobs in service P(busy), probability/fraction of time that the server is busy, etc. To estimate these from empirical observations, check the system at many points in time, record the observed data at each point in time (e.g., how many jobs are in the queue, or whether or not the server busy), and take the average these numbers. I.e., you are computing the average over time. IOE 202: Operations Modeling, Fall 2009 Page 10
6 Performance measures for a stable system in steady state: Job averages W Q, the average/expected time a job waits in the queue W Sys, the average/expected time a job spends in the system W Serv, the average/expected time a customer spends in service, etc. To estimate these from empirical observations, observe many jobs, record the observed data for each job (e.g., time in the queue), and average these numbers. I.e., you are computing the average over jobs. IOE 202: Operations Modeling, Fall 2009 Page 11 The basic single-server model, a.k.a. the M/M/1 model The first M: interarrival times is exponentially distributed, hence the arrival process is memoryless Arrival rate denoted by λ (that is, 1/λ is the avg. time between arrivals) The second M: service times are exponentially distributed, hence memoryless Service rate is denoted by µ (that is, on average, it takes 1/µ units of time to perform a job) The 1 indicates that there is a single server. ρ = λ µ is the server utilization for M/M/1 queue. If ρ > 1, the arrivals are more frequent than the service completions (i.e., the departures), and the queue will get more and more full. Hence, for an M/M/1 queueing system to be stable in the long run it is necessary (and sufficient) that ρ < 1. IOE 202: Operations Modeling, Fall 2009 Page 12
7 Intuition behind steady-state analysis of M/M/1 queue At any point in time, the number of customers in the system, n, completely characterizes what s going on! (Exponential service and interarrival times are crucial.) Hence, we refer to n as the state of the system. With the system in steady state, let P n denote the probability that there are n customers in the system. In other words, P n is the fraction of time, over a long horizon, the system spends in state n. When the system is in state n, thenexttimethesystemwill change state, it will transition either into state n + 1, or, if n > 0, into n 1. IOE 202: Operations Modeling, Fall 2009 Page 13 State transition diagram for an M/M/1 queue In steady state, the net flux across the line separating state n 1 and state n is equal to zero, i.e., λp 0 = µp 1, λp 1 = µp 2,, λp n = µp n+1, From probability laws: P n =1 n=0 Solving the above system of equations, we obtain: P n =(1 ρ)ρ n, n =0, 1, 2,... IOE 202: Operations Modeling, Fall 2009 Page 14
8 Steady state analysis of an M/M/1 queue I Assume ρ = λ µ < 1. Solving the above equations, we obtain: P n =(1 ρ)ρ n, n =0, 1, 2,... L Sys = n=0 np n = ρ 1 ρ L Q = n=1 (n 1)P n = ρ2 1 ρ L Serv =0 P 0 +1 (1 P 0 )=ρ IOE 202: Operations Modeling, Fall 2009 Page 15 Little s Formula(s) and other relationships Holds for all queues in steady state, not just M/M/1 Consider any queueing system. We have: L Sys = L Q + L Serv, W Sys = W Q + W Serv, Little s law: If arrival rate to a queueing system is λ, andthe system is in steady state, then L Sys = λw Sys, L Q = λw Q, L Serv = λw Serv Reasoning: Consider a long period of time T. During this period of time, we expect about λt customers to arrive, each waiting in the queue for an average time W Q. Hence, the average number of customer-minutes spent in line is λtw Q. On the other hand, the average number of customer-minutes spent in the queue can be also computed as TL Q. IOE 202: Operations Modeling, Fall 2009 Page 16
9 Steady state analysis of an M/M/1 queue II Notice: L Sys L Serv = ρ 1 ρ ρ2 1 ρ = ρ = L Serv Also, using Little s law: W Sys = L Sys λ = 1 µ λ, W Q = L Q λ = λ µ(µ λ) IOE 202: Operations Modeling, Fall 2009 Page 17 Back to our computer server... Suppose the interarrival and service times are exponential, with λ =1/15 jobs per second (or 4 jobs per minute), and µ =1/13 jobs per second (or 4.62 jobs per minute). Note: ρ = < 1 How long does a job wait to start (on average)? How many jobs, on average, are waiting in the queue, at any given time? What fraction of the time is the server busy? IOE 202: Operations Modeling, Fall 2009 Page 18
10 Computer server example continued... The activity monitor displays IDs of the next 8 jobs to be processed. What fraction of the time is there room on this list? There is no room on the activity monitor when there are 9 or more jobs in the system the probability of this happening is P 9 + P 10 + P 11 + =(1 ρ)ρ 9 +(1 ρ)ρ 10 +(1 ρ)ρ 11 + =(1 ρ)ρ 9 (1 + ρ + ρ 2 + ) = ρ 9 Thus, there is room on the monitor 1 Prob(n 9) = 1 ρ 9 fraction of the time IOE 202: Operations Modeling, Fall 2009 Page 19 Computer server example continued... What if the server is slower than usual, and so takes an average of 14 seconds to complete each job? Determine the values of λ, µ, and ρ. Answer same questions for the new values 1/µ =13 sec 1/µ =14 sec W Q 84.5 sec L Q jobs 1 P Prob(n 9) IOE 202: Operations Modeling, Fall 2009 Page 20
11 System performance vs. server utilization Recall: L Q = λw Q = λ λ µ(µ λ) = ρ2 (1 ρ) )$!./ :42;424<68=9>?84?<4;01/01469>7>@29>?84?<4284ABAB)4;C;90D )*$ )+! )!$, - E + BF) G (!, - &$ %! #$ *! )$!!"#!"$!"%!"&!"'!"( ) IOE 202: Operations Modeling, Fall 2009 Page 21 When is an M/M/1 model of a queueing system appropriate? Customers arrive one at a time Inter-arrival times are uncertain, with average time 1/λ between arrivals independent of each other and can be modeled as exponential random variables with rate λ All customers join the line and wait for service Any number of waiting customers can be accommodated Customers form one line and are served FCFS There is one server, serving one customer at a time Service times of customers are uncertain, with average 1/µ independent of each other and can be modeled as exponential random variables with rate µ IOE 202: Operations Modeling, Fall 2009 Page 22
12 Other types of queueing systems (would require different models!) Arrivals and customer behavior: Timing of arrivals: inter-arrival times may not fit exponential distribution Customers may be arriving in batches Some arriving customers may balk and not join the queue, while some customers may renege System may be able to accommodate only a limited number of waiting customers Service: Service times may not fit exponential distribution Queue discipline There may be multiple servers Order of serving customers may be Shortest processing time first (SPT), based on priority level Also, if there are several servers, do customers form one line, or multiple lines? (Supermarket vs. airline check-in counter) IOE 202: Operations Modeling, Fall 2009 Page 23 The basic multiple-server model, a.k.a. M/M/s model Arrivals and waiting the same as in M/M/1: The first M: inter-arrival times are exponentially distributed with rate λ The second M: service time of each customer on either server is exponentially distributed with rate µ The s indicates that there are s servers. The servers are identical and work in parallel; first customer in line goes to the next available server ρ = λ sµ is the server utilization. Ifρ > 1, the arrivals are more frequent than the service completions (i.e., the departures), and the queue will get more and more full. Hence, for an M/M/s queueing system to be stable it is necessary (and sufficient) that ρ < 1. Formulae for many output measures for an M/M/s queue in steady state are available; see handout and the file MMS TEMPLATE.XLS (make sure to enable macros). IOE 202: Operations Modeling, Fall 2009 Page 24
13 Example: a dual processor? IOE s computer system manager has been receiving complaints from students and faculty using the departmental server. They claim it frequently takes too long to run a computer job! Currently, the server functions as an M/M/1 queue with λ = 1 15 and µ = 1 13 jobs per second. The system manager has limited funds for upgrading the system. He identified the only option: exchange the current server for one with a dual processor, which would increase computer operating costs by $200 per hour. Average job completion time on either of the two processors is 20 seconds, and each processor can work on one job independently. System manager (who has an MSE from IOE!) estimated that user s time is worth $0.02 per second of waiting for a job to complete. Should he change computers? What if this estimate is inaccurate? IOE 202: Operations Modeling, Fall 2009 Page 25 ρ One processor or two? λ = 1 15 M/M/1 with µ = 1 13 M/M/2 with µ = 1 20 W Sys W Q L Sys L Q IOE 202: Operations Modeling, Fall 2009 Page 26
14 One processor or two? Continued Formula for computing total cost (per unit of time): Total cost with the old server: Total cost with the new server: Sensitivity analysis w.r.t. value of user s time: IOE 202: Operations Modeling, Fall 2009 Page 27 No waiting room, a.k.a. M/M/s/s queueing model This model represents a system with exponential inter-arrival and service times, s identical servers, and no waiting room. The fourth parameter indicates how many customers can be in the system; since it is equal to the number of servers, there is no waiting room. In previous models, the number of customers was not limited, so the fourth parameter was omitted. Technically, they were M/M/1/ and M/M/s/ models. More generally, one may consider an M/M/s/K system, e.g., acallcenterwiths operators and K trunk lines, so that up to K s customers can be put on hold simultaneously. IOE 202: Operations Modeling, Fall 2009 Page 28
15 State transition diagram for an M/M/s/s queue Let P n =probability that there are n customers in the system. Notice: the system is always stable, because its size is limited! In steady state, the net flux across the line separating state n 1 and state n is equal to zero. Equations: λp 0 = µp 1, λp 1 =2µP 2, λp 2 =3µP 3,, λp s 1 = sµp s, s P n =1 n=0 IOE 202: Operations Modeling, Fall 2009 Page 29 Formulae for an M/M/s/s system in steady state Solving above system of equations, P n = λn n!µ n P 0, n =0, 1,...,s, where P 0 = 1+ s n=1 1 λ n n!µ n. For example, if s = 3, λ =1andµ = 2, then we can calculate P 0 = ! ! ! 2 3 = =0.608, P 1 = 1 2 P 0 =0.304, P 2 = 1 2! 2 2 P 0 =0.076, P 3 = 1 3! 2 3 P 0 =0.013 IOE 202: Operations Modeling, Fall 2009 Page 30
16 M/M/s/s formulae continued In the above example, approximately 61% of the time, there is noone in the system, 30% of the time there is 1 customer, 8% of the time there are 2 customers, and only 1% of the time there are 3 customers in the system. We can now figure out the measures of system performance such as Mean number of customers in the system L Sys = s n=1 np n = Mean number of customers in the line L Q =0 Probability that an arriving customer will find a full system (and thus will be lost) = P 3 =1.3%. IOE 202: Operations Modeling, Fall 2009 Page 31 Example: how many servers to install? A startup company is trying to decide how many satellite phone channels (or lines) to lease. It costs $144 to lease a line for each day of operation. Calls arrive at a rate of 600 per hour, and if an arriving call finds that all lines are busy, the caller hangs up and doesn t try again. On average, a call lasts 4 minutes, and calls are billed at $1 each. How many lines should be leased to maximize profits? IOE 202: Operations Modeling, Fall 2009 Page 32
17 Decision variable: Formulating as a decision problem Appropriate model for the system: Costs incurred by the system: Revenues collected by the system: IOE 202: Operations Modeling, Fall 2009 Page 33 Solution of the decision problem Model: M/M/s/s queue Decision variable: s > 0 Inputs: λ = 10 calls per minute, µ =0.25 calls per minute Profit: 10(1 P s ) 0.1s per minute. Using a spreadsheet, we calculate P s and the corresponding profit for a variety of values of s. Profit is maximized at s = 45, and is equal to $4.96 per minute. IOE 202: Operations Modeling, Fall 2009 Page 34
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 informationPBW 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 informationChapter 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 informationSlides 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 informationIntroduction to Queueing Theory with Applications to Air Transportation Systems
Introduction to Queueing Theory with Applications to Air Transportation Systems John Shortle George Mason University February 28, 2018 Outline Why stochastic models matter M/M/1 queue Little s law Priority
More informationQueueing 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 informationQueueing 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 informationQueueing Theory (Part 4)
Queueing Theory (Part 4) Nonexponential Queueing Systems and Economic Analysis Queueing Theory-1 Queueing Models with Nonexponential Distributions M/G/1 Model Poisson input process, general service time
More informationClassification 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 informationWaiting 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 informationCPSC 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 informationQueueing 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 information4.7 Finite Population Source Model
Characteristics 1. Arrival Process R independent Source All sources are identical Interarrival time is exponential with rate for each source No arrivals if all sources are in the system. OR372-Dr.Khalid
More information5/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 informationQueueing Systems: Lecture 3. Amedeo R. Odoni October 18, Announcements
Queueing Systems: Lecture 3 Amedeo R. Odoni October 18, 006 Announcements PS #3 due tomorrow by 3 PM Office hours Odoni: Wed, 10/18, :30-4:30; next week: Tue, 10/4 Quiz #1: October 5, open book, in class;
More informationSandwich 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 informationChapter 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 informationQueuing Theory. 3. Birth-Death Process. Law of Motion Flow balance equations Steady-state probabilities: , if
1 Queuing Theory 3. Birth-Death Process Law of Motion Flow balance equations Steady-state probabilities: c j = λ 0λ 1...λ j 1 µ 1 µ 2...µ j π 0 = 1 1+ j=1 c j, if j=1 c j is finite. π j = c j π 0 Example
More informationPerformance 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 informationIntroduction 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 informationSolutions to Homework Discrete Stochastic Processes MIT, Spring 2011
Exercise 6.5: Solutions to Homework 0 6.262 Discrete Stochastic Processes MIT, Spring 20 Consider the Markov process illustrated below. The transitions are labelled by the rate q ij at which those transitions
More informationSystems 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 informationNetworking = 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 informationKendall 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 informationContinuous 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 informationAll models are wrong / inaccurate, but some are useful. George Box (Wikipedia). wkc/course/part2.pdf
PART II (3) Continuous Time Markov Chains : Theory and Examples -Pure Birth Process with Constant Rates -Pure Death Process -More on Birth-and-Death Process -Statistical Equilibrium (4) Introduction to
More informationAnalysis of an M/M/1/N Queue with Balking, Reneging and Server Vacations
Analysis of an M/M/1/N Queue with Balking, Reneging and Server Vacations Yan Zhang 1 Dequan Yue 1 Wuyi Yue 2 1 College of Science, Yanshan University, Qinhuangdao 066004 PRChina 2 Department of Information
More informationQueueing 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 informationIntroduction 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 informationIEOR 6711, HMWK 5, Professor Sigman
IEOR 6711, HMWK 5, Professor Sigman 1. Semi-Markov processes: Consider an irreducible positive recurrent discrete-time Markov chain {X n } with transition matrix P (P i,j ), i, j S, and finite state space.
More informationEquilibrium solutions in the observable M/M/1 queue with overtaking
TEL-AVIV UNIVERSITY RAYMOND AND BEVERLY SACKLER FACULTY OF EXACT SCIENCES SCHOOL OF MATHEMATICAL SCIENCES, DEPARTMENT OF STATISTICS AND OPERATION RESEARCH Equilibrium solutions in the observable M/M/ queue
More informationAnalysis of Software Artifacts
Analysis of Software Artifacts System Performance I Shu-Ngai Yeung (with edits by Jeannette Wing) Department of Statistics Carnegie Mellon University Pittsburgh, PA 15213 2001 by Carnegie Mellon University
More informationFigure 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 informationQueuing 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 informationIntroduction 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 informationQuiz 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 informationQueuing 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 informationInternational Journal of Pure and Applied Mathematics Volume 28 No ,
International Journal of Pure and Applied Mathematics Volume 28 No. 1 2006, 101-115 OPTIMAL PERFORMANCE ANALYSIS OF AN M/M/1/N QUEUE SYSTEM WITH BALKING, RENEGING AND SERVER VACATION Dequan Yue 1, Yan
More informationISyE 2030 Practice Test 2
1 NAME ISyE 2030 Practice Test 2 Summer 2005 This test is open notes, open books. You have exactly 75 minutes. 1. Short-Answer Questions (a) TRUE or FALSE? If arrivals occur according to a Poisson process
More informationIntroduction to Queuing Theory. Mathematical Modelling
Queuing Theory, COMPSCI 742 S2C, 2014 p. 1/23 Introduction to Queuing Theory and Mathematical Modelling Computer Science 742 S2C, 2014 Nevil Brownlee, with acknowledgements to Peter Fenwick, Ulrich Speidel
More informationGI/M/1 and GI/M/m queuing systems
GI/M/1 and GI/M/m queuing systems Dmitri A. Moltchanov moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/tlt-2716/ OUTLINE: GI/M/1 queuing system; Methods of analysis; Imbedded Markov chain approach; Waiting
More informationReview of Queuing Models
Review of Queuing Models Recitation, Apr. 1st Guillaume Roels 15.763J Manufacturing System and Supply Chain Design http://michael.toren.net/slides/ipqueue/slide001.html 2005 Guillaume Roels Outline Overview,
More informationThe 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 informationAnalysis of A Single Queue
Analysis of A Single Queue 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 informationCS418 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 informationChapter 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λ, µ, ρ, 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 informationEE 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 informationScheduling I. Today Introduction to scheduling Classical algorithms. Next Time Advanced topics on scheduling
Scheduling I Today Introduction to scheduling Classical algorithms Next Time Advanced topics on scheduling Scheduling out there You are the manager of a supermarket (ok, things don t always turn out the
More informationQueueing systems. Renato Lo Cigno. Simulation and Performance Evaluation Queueing systems - Renato Lo Cigno 1
Queueing systems Renato Lo Cigno Simulation and Performance Evaluation 2014-15 Queueing systems - Renato Lo Cigno 1 Queues A Birth-Death process is well modeled by a queue Indeed queues can be used to
More informationNATCOR: Stochastic Modelling
NATCOR: Stochastic Modelling Queueing Theory II Chris Kirkbride Management Science 2017 Overview of Today s Sessions I Introduction to Queueing Modelling II Multiclass Queueing Models III Queueing Control
More informationChapter 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 informationScheduling I. Today. Next Time. ! Introduction to scheduling! Classical algorithms. ! Advanced topics on scheduling
Scheduling I Today! Introduction to scheduling! Classical algorithms Next Time! Advanced topics on scheduling Scheduling out there! You are the manager of a supermarket (ok, things don t always turn out
More informationλ λ λ 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 informationCOMP9334: Capacity Planning of Computer Systems and Networks
COMP9334: Capacity Planning of Computer Systems and Networks Week 2: Operational analysis Lecturer: Prof. Sanjay Jha NETWORKS RESEARCH GROUP, CSE, UNSW Operational analysis Operational: Collect performance
More informationSolutions 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 informationComputer 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 informationMultiaccess Problem. How to let distributed users (efficiently) share a single broadcast channel? How to form a queue for distributed users?
Multiaccess Problem How to let distributed users (efficiently) share a single broadcast channel? How to form a queue for distributed users? z The protocols we used to solve this multiaccess problem are
More informationLink Models for Packet Switching
Link Models for Packet Switching To begin our study of the performance of communications networks, we will study a model of a single link in a message switched network. The important feature of this model
More informationSection 1.2: A Single Server Queue
Section 12: A Single Server Queue Discrete-Event Simulation: A First Course c 2006 Pearson Ed, Inc 0-13-142917-5 Discrete-Event Simulation: A First Course Section 12: A Single Server Queue 1/ 30 Section
More informationRichard C. Larson. March 5, Photo courtesy of Johnathan Boeke.
ESD.86 Markov Processes and their Application to Queueing Richard C. Larson March 5, 2007 Photo courtesy of Johnathan Boeke. http://www.flickr.com/photos/boeke/134030512/ Outline Spatial Poisson Processes,
More informationQueues and Queueing Networks
Queues and Queueing Networks Sanjay K. Bose Dept. of EEE, IITG Copyright 2015, Sanjay K. Bose 1 Introduction to Queueing Models and Queueing Analysis Copyright 2015, Sanjay K. Bose 2 Model of a Queue Arrivals
More informationSince D has an exponential distribution, E[D] = 0.09 years. Since {A(t) : t 0} is a Poisson process with rate λ = 10, 000, A(0.
IEOR 46: Introduction to Operations Research: Stochastic Models Chapters 5-6 in Ross, Thursday, April, 4:5-5:35pm SOLUTIONS to Second Midterm Exam, Spring 9, Open Book: but only the Ross textbook, the
More informationQueuing 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 informationElementary queueing system
Elementary queueing system Kendall notation Little s Law PASTA theorem Basics of M/M/1 queue M/M/1 with preemptive-resume priority M/M/1 with non-preemptive priority 1 History of queueing theory An old
More informationNon 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 informationSession-Based Queueing Systems
Session-Based Queueing Systems Modelling, Simulation, and Approximation Jeroen Horters Supervisor VU: Sandjai Bhulai Executive Summary Companies often offer services that require multiple steps on the
More informationSystem with a Server Subject to Breakdowns
Applied Mathematical Sciences Vol. 7 213 no. 11 539 55 On Two Modifications of E 2 /E 2 /1/m Queueing System with a Server Subject to Breakdowns Michal Dorda VSB - Technical University of Ostrava Faculty
More informationExercises 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 informationCOMP9334 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 informationYORK 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 informationreversed chain is ergodic and has the same equilibrium probabilities (check that π j =
Lecture 10 Networks of queues In this lecture we shall finally get around to consider what happens when queues are part of networks (which, after all, is the topic of the course). Firstly we shall need
More informationPart I Stochastic variables and Markov chains
Part I Stochastic variables and Markov chains Random variables describe the behaviour of a phenomenon independent of any specific sample space Distribution function (cdf, cumulative distribution function)
More informationClass 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 informationIntroduction to Queueing Theory
Introduction to Queueing Theory Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings of this lecture are available at: 30-1 Overview Queueing Notation
More informationChapter 8 Queuing Theory Roanna Gee. W = average number of time a customer spends in the system.
8. Preliminaries L, L Q, W, W Q L = average number of customers in the system. L Q = average number of customers waiting in queue. W = average number of time a customer spends in the system. W Q = average
More informationAn 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 informationQueueing 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 informationCDA5530: Performance Models of Computers and Networks. Chapter 4: Elementary Queuing Theory
CDA5530: Performance Models of Computers and Networks Chapter 4: Elementary Queuing Theory Definition Queuing system: a buffer (waiting room), service facility (one or more servers) a scheduling policy
More informationNICTA 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 informationLecture 4: Bernoulli Process
Lecture 4: Bernoulli Process Hyang-Won Lee Dept. of Internet & Multimedia Eng. Konkuk University Lecture 4 Hyang-Won Lee 1 / 12 Stochastic Process A stochastic process is a mathematical model of a probabilistic
More informationCourse 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 informationQUEUING MODELS AND MARKOV PROCESSES
QUEUING MODELS AND MARKOV ROCESSES Queues form when customer demand for a service cannot be met immediately. They occur because of fluctuations in demand levels so that models of queuing are intrinsically
More informationGeneration of Discrete Random variables
Simulation Simulation is the imitation of the operation of a realworld process or system over time. The act of simulating something first requires that a model be developed; this model represents the key
More informationQueuing Networks: Burke s Theorem, Kleinrock s Approximation, and Jackson s Theorem. Wade Trappe
Queuing Networks: Burke s Theorem, Kleinrock s Approximation, and Jackson s Theorem Wade Trappe Lecture Overview Network of Queues Introduction Queues in Tandem roduct Form Solutions Burke s Theorem What
More informationPart II: continuous time Markov chain (CTMC)
Part II: continuous time Markov chain (CTMC) Continuous time discrete state Markov process Definition (Markovian property) X(t) is a CTMC, if for any n and any sequence t 1
More informationCSE 4201, Ch. 6. Storage Systems. Hennessy and Patterson
CSE 4201, Ch. 6 Storage Systems Hennessy and Patterson Challenge to the Disk The graveyard is full of suitors Ever heard of Bubble Memory? There are some technologies that refuse to die (silicon, copper...).
More informationData 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 informationOn the Partitioning of Servers in Queueing Systems during Rush Hour
On the Partitioning of Servers in Queueing Systems during Rush Hour This paper is motivated by two phenomena observed in many queueing systems in practice. The first is the partitioning of server capacity
More informationSection 3.3: Discrete-Event Simulation Examples
Section 33: Discrete-Event Simulation Examples Discrete-Event Simulation: A First Course c 2006 Pearson Ed, Inc 0-13-142917-5 Discrete-Event Simulation: A First Course Section 33: Discrete-Event Simulation
More informationWaiting 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 informationChapter 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 informationComputer Networks More general queuing systems
Computer Networks More general queuing systems Saad Mneimneh Computer Science Hunter College of CUNY New York M/G/ Introduction We now consider a queuing system where the customer service times have a
More informationDiscrete-event simulations
Discrete-event simulations Lecturer: Dmitri A. Moltchanov E-mail: moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/elt-53606/ OUTLINE: Why do we need simulations? Step-by-step simulations; Classifications;
More informationLecture 20: Reversible Processes and Queues
Lecture 20: Reversible Processes and Queues 1 Examples of reversible processes 11 Birth-death processes We define two non-negative sequences birth and death rates denoted by {λ n : n N 0 } and {µ n : n
More informationBernoulli Counting Process with p=0.1
Stat 28 October 29, 21 Today: More Ch 7 (Sections 7.4 and part of 7.) Midterm will cover Ch 7 to section 7.4 Review session will be Nov. Exercises to try (answers in book): 7.1-, 7.2-3, 7.3-3, 7.4-7 Where
More informationMAT SYS 5120 (Winter 2012) Assignment 5 (not to be submitted) There are 4 questions.
MAT 4371 - SYS 5120 (Winter 2012) Assignment 5 (not to be submitted) There are 4 questions. Question 1: Consider the following generator for a continuous time Markov chain. 4 1 3 Q = 2 5 3 5 2 7 (a) Give
More informationA Semiconductor Wafer
M O T I V A T I O N Semi Conductor Wafer Fabs A Semiconductor Wafer Clean Oxidation PhotoLithography Photoresist Strip Ion Implantation or metal deosition Fabrication of a single oxide layer Etching MS&E324,
More informationA TANDEM QUEUEING SYSTEM WITH APPLICATIONS TO PRICING STRATEGY. Wai-Ki Ching. Tang Li. Sin-Man Choi. Issic K.C. Leung
Manuscript submitted to AIMS Journals Volume X, Number 0X, XX 00X Website: http://aimsciences.org pp. X XX A TANDEM QUEUEING SYSTEM WITH APPLICATIONS TO PRICING STRATEGY WAI-KI CHING SIN-MAN CHOI TANG
More informationM/G/1 queues and Busy Cycle Analysis
queues and Busy Cycle Analysis John C.S. Lui Department of Computer Science & Engineering The Chinese University of Hong Kong www.cse.cuhk.edu.hk/ cslui John C.S. Lui (CUHK) Computer Systems Performance
More information