Data analysis and stochastic modeling
|
|
- Chad Andrews
- 5 years ago
- Views:
Transcription
1 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 jensen/ormm/instruction/powerpoint/or_models_09/14_queuing.ppt 1. A gentle introduction to probability 2. Data analysis 3. Cluster analysis 4. Estimation theory and practice 5. Mixture models 6. Random processes Where are we? 7. Queing systems discrete time Markov chains revisited continuous time processes queueing systems 8. Hypothesis testing What are we gonna talk about today? Typology of random processes Another look at discrete time Markov chains Continuous time processes continuous time Markov chains Birth and death processes Queueing theory what is a queueing system? M/M* queues other types of queues and queue networks A process is a collection of random variables {X(t) t T } over an index set T where X(t) take values in a state space I. T is discrete continuous discrete discrete-time continuous-time chain chain I is continuous discrete-time continuous-time continuous-state continuous-state process process
2 Markov property Discrete time Markov chains (DTMC) Markov property [slight change of notations from previous lecture] A stochastic process {X(t) t T } is a Markov process if, for any t 0 < t 1 <... < t n < t, the conditional distribution of X(t) given X(t 0 ),...,X(t n ) depends only on X(t n ), i.e. P[X(t) x X(t n ) x n,...,x(t 0 ) t 0 ] = P[X(t) x X(t n ) x n ] A Markov chain is said to be homogeneous if P[X(t) x X(t n ) x n ] = P[X(t t n ) x X(0) x n ]. Andreï A. Markov P[X n = x n X 0 = x 0,...,X n 1 = x n 1 ] = P[X n = x n X n 1 = x n 1 ] We want to study the following quantities (for homogeneous chains only) state of the process at step n: p i (n) = P[X n = i] n-step transition probability: p ij (n) = P[X m+n = j X m = i] The process is entirely defined by the initial distribution: p(0) = [p 0 (0),p 1 (0),...] the transition matrix: P = [p ij = p ij (1) = P[X n = j X n 1 = i]] n-step transitions Asymptotic behavior From the Markovian assumption, we can note that P[X t+m+n = j X t = i] = p ij (m + n) = k p ik (m)p kj (n), v i = lim n P[X n = i]? which gives us the following property (m 1, n n 1) P(n) = P P(n 1) = P n. The marginal distribution of X n is given by P[X n = i] = p i (n) = P[X 0 = k]p[x n = i X 0 = k] = k k and the state of the system at step n is given by [p 0 (n), p 1 (n),...] = p(n) = p(0) P n. p k (0)p ki (n), v i = long run proportion of time spent in state i when n, p ij (n) becomes independent of i and n all rows of P n converge toward a common limit v the limit satisfies v = v P under the constraint that v i 0, i v i = 1. conditions for the limit to be defined aperiodic the limiting state probabilities exists irreductible aperiodic the limit exists and is independent of the initial probabilities p(0) irreductible aperiodic with recurrent states (or finite state irreductible aperiodic) v is the unique stationary probability vector
3 Continuous time Markov chains (CTMC) P[X t = x X t0 = x 0,...,X tn 1 = x n 1 ] = P[X t = x X tn 1 = x n 1 ] We want to study the following quantities (for homogeneous chains only) state of the process at time t: p i (t) = P[X t = i] n-step transition probability: p ij (t) = P[X t = j X 0 = i] The process is entirely defined by the initial distribution: p(0) = [p 0 (0),p 1 (0),...] the transition probabilities: p ij (t) Properties of the transition probabilities p ij (t) 0 t j p ij(t) = 1 i, t p ij (t + s) = k p ik(t)p ki (s) t, s Transition probabilities and transition rates dealing with transition probabilities that are a function of time is a mess! use transition rates rather than probabilities p ij (t) q ij = lim t 0 t Q = P (0) and properties of the transition rate matrix d P(t) = QP(t) = P(t)Q dt P[X t+h = j X t = i] = q ij h + o(h) p ii (t, t + h) = 1 q ii h + o(h) q i = q ii = lim t 0 p ii (t) 1 t i j Jump process and embedded Markov chain T i is the time of the i-th jump the time to the next jump follows an exponential model P[T 1 > t X 0 = i] = e q it Y n = X Tn is a DTMC with transition probabilities p ij = q ij q i if i j and q i 0 0 if i j and q i = 0 0 if i = j and q i 0 1 if i = j and q i = 0 Limiting probabilities Under certain conditions, we have for a CTMC X lim p ij(t) = v j = t π j/q j π k /q k where π is the unique invariant measure associated with Y. The limiting probabilities, if they exist, are obtained by solving the equation system vq = 0 v1 = 1 k
4 Homogeneous Poisson process Classical discrete distributions: Poisson N(t) = number of occurences of an event (with rate ) in [0,t] P[N(t + τ) N(t) = k] = e τ (τ) k k! Poisson law a counting process with the following property is a Poisson process lim P[N(t + τ) N(t) > 1 N(t + τ) N(t) 1] = 0 τ memoryless process interarrival times are independent and exponentially distributed (mean ) A Poisson P(α) is defined as P[X = k] = k e Probability of k events occuring at a rate c over an interval of duration t ( = ct) Approximation of the binomial for small p and large n E[X] = V [X] = k! Siméon D. Poisson [Illustration: Skbkekas (from wikipedia.org)] Poisson process and CTMC A Poisson process is a continuous time Markov chain with rate transition matrix Q = Birth and death process N(t) = size of a population at time t Birth distribution n = birth rate for a population of size n remaining time until the next birth exp( n ) Death distribution n = death rate for a population of size n remaining time until the next death exp( n ) 0 1 k 1 k k+1 N(t) is a CTMC with transition rate diagram
5 Birth and death process equilibrium Expected rate in = Expected rate out The equilibrium v is given by solving the system whose solution is given by vq = 0 v1 = 1 with S = i v 0 = S 0... i i. v i = i 1 S 1... i flow into 0 1 v 1 = 0 v 0 flow out of 0 flow into 1 0 v v 2 = ( )v 1 flow out of 1 flow into 2 1 v v 3 = ( )v 2 flow out of 2. flow into i i 1 v i 1 + i+1 v i+1 = ( i + i )v i flow out of i. Particular case: if i = and i =, then v i = ρ i (1 ρ) with ρ = /. All this is true only if S < or, in the particular case, if ρ < 1. v 1 = 0 1 v 0, v 2 = 1 2 v 1 = v 0,... v k = k k... 1 v 0 What is a queueing system? What are queueing systems good for? A queueing system is usefull to answer the following questions input population entry queue service mechanism exit What is the average number of customers in the queue? in the system? What is the average time a customer spends in the queue? in the system? What is the probability of a customer to be rejected? Arrival process size of the population bulk vs. individual arrivals interarrival distribution customer balking Service process number of servers batch or single service service time distribution What is the fraction of time a server is idle? What is the probability distribution of a customer s waiting time in the queue? in the system? In turn, answering those questions supports decision making Should we have one or several queues? Queue What is the best queueing discipline for my application? finite or infinite discipline (FIFO, LIFO, priorities, etc.)
6 Kendall s notation A/B/N/m/s A and B = distribution of resp. the interarrival and the service time M exponential model E k Erlang model D deterministic time G arbitrary iid model Erlang distribution f(x;k,) = k x k 1 e x (k 1)! N = number of parallel servers m = max. number of customers in the system s = population size Examples: M/M/1/ /, M/M/S/ /, M/M/1/C/, M/M/1/K/K M/G/1, M/D/1, etc. Quantities of interest Quantities of interest (cont d) n = n = N(t) = P n (t) = mean arrival rate of entering customers when n customers are in the system mean service of the overall system when n customers are in the system number of customers in the system (queue and service) at time t the probability that there are exactly n customers in the system at time t R i = time spent in the system by the ith customer We are primarily interested in the following steady state quantities N : number of clients in the system 1 t L = E[N] = lim N(s)ds t t 0 R: time spent in the system by a client 1 W = E[R] = lim n n nr i i=1 N(t) and P n (t) are difficult to compute for an arbitrary time t study steady-state regime when t We can define in a similar way the two quantities excluding service time, L Q and W Q, where L = L S + L Q.
7 Little s law The M/G/1 model and the PASTA property For any queueing system with a steady state, with an average arrival rate of, L = W. Example: if the average waiting time is 2h and customers arrive at an average rate of 3 per hour, then the average number of customers in the queue is 6. The same equality holds for L Q and W Q. Note: for a constant death rate, W = W Q + 1/. Poisson arrival process with an average arrival rate of FIFO discipline no assumption on service time (apart from the iid one) memoryless property is not verified N(t) is not Markovian study a snapshot of the system immediately after each arrival embedded Markov chain X n = N(t n ) Poisson Arrivals See Temporal Average (PASTA) π k = lim t P[N(t) = k] = lim n P[X n = k] [R. Wolf. Poisson arrivals see time averages. Op. Res., 20: , 1982] Death and birth queues Steady state results memoryless arrival process interarrival law is exp( n ) given n customers in the system probability of an arrival in [t, t + dt] = n dt + o(t) memoryless service process service law is exp( n ) when n customers are in the system probability of a departure in [t, t + dt] = n dt + o(t) Durations and transitions to/from state i stays in i exp( i + i ) transits to i 1 with probability i /( i + i ) transits to i + 1 with probability i /( i + i ) π 1 = 0 π 0, π 2 = 1 π 1 = 0 1 π 0,... π k = k π k... 1 expected number in the system L = E[N] = kπ k expected number in the queue L Q = E[N Q ] = average (effective) arrival rate = efficienty of the system k π k k=0 k=1 E = (L L Q )/s (k s)π k k=s
8 The three server example The three server example (cont d) Consider a birth-and-death queueing system with s = 3 servers and the following characteristics: average arrival rate = 5 per hour average service rate = 2 per hour customers balk when 6 are already in the system k = π k = What is the probability that... all servers are idle? P[N(t) 0] = a customer will not have to wait? P[N(t) 2] = π 0 + π 1 + π 2 = 0.45 a customer will have to wait? P[N(t) 3] = 0.55 a customer balks? P[N(t) = 6] = The three server example (cont d) The methodology Expected number in queue: L Q = π 4 + 2π 5 + 3π 6 = 0.7 Expected number in service: L S = π 1 + 2π 2 + 3(1 π 0 π 1 π 2 ) = Efficiency of the system: E = L S /s = 74.8 % Average arrival rate: = (π π 5 ) = per hour 1. model the system and construct the rate diagram 2. develop the balance equation and solve for π i i = 0, 1,... use general birth-and-death process results whenever they apply 3. use steady-state distribution to L and L Q 4. use Little s law to get W and W Q Expected waiting times using Little s law with W S = L S / = 0.5 hours W Q = L Q / = hours W = L/ = W S + W Q = hours 3 3
9 The M/M/1 model exponential interarrival time with constant parameter k = k exponential service time with constant parameter k = k π n = ρ n (1 ρ) 5 6 The repairman example A maintenance worker must maintain 2 machines, where the 2 machines operate simultaneously when both are up. We make the following hypotheses: time until a machine breaks down exp with mean 10 hours time until a machine is fixed exp with mean 8 hours the repairman can only fix one machine at a time M/M/1/2/2 L = nπ n = n=1 2 L Q = L (1 π 0 ) = ( ) W = L/ = 1 W Q = L Q / = ( ) The repairman example (cont d) flow into 0 1 π 1 = 2π 0 flow out of 0 flow into 1 2π 0 + π 2 = ( + )π 1 flow out of 1 normalize π 1 = π 2 π 0 = π 1 = π 2 = = L = π 1 + 2π 2 = L Q = π 2 = 0.33 W = L = 11.55hour W Q = L Q = 3.56hour Proportion of time the repairman is busy = π 1 + π 2 = Proportion of time machine #1 is working = π π 1 = The telephone answering example A utility company wants to determine a staffing plan for its customer representatives. Calls arrive at an average rate of 10 per minute and the average service time is 1 minute. Determine the number of operators that would provide a satisfactory service to the calling population. Parameters: = 10, = 1,ρ = /s < 1 s > 10 M/M/11 M/M/12 M/M/13 L Q W Q P[T Q = 0] P[T q > 1]
10 One last for the road Networks of queues Packets arrive to a router at a rate of 1.5 min. The mean routing time is 30 seconds and if more than 3 packets are in the queue, an alternative routeur is seeked. Does this setting meet the following criteria: no more than 5% of the packets goes to another routeur and no more than 10% of the packets stay more than 1 min in the queue? Using the M/M/1/4 model, you should be able to demonstrate that the balking probability = π 4 =.104 does not meet the 5 % criteria the probability P[T Q > 1] = does not meet the 10 % objective However, a M/M/2/5 configuration does and so you need to buy one more routeur! 3 3
Markov Chains. X(t) is a Markov Process if, for arbitrary times t 1 < t 2 <... < t k < t k+1. If X(t) is discrete-valued. If X(t) is continuous-valued
Markov Chains X(t) is a Markov Process if, for arbitrary times t 1 < t 2
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 informationLecture 7: Simulation of Markov Processes. Pasi Lassila Department of Communications and Networking
Lecture 7: Simulation of Markov Processes Pasi Lassila Department of Communications and Networking Contents Markov processes theory recap Elementary queuing models for data networks Simulation of Markov
More informationThe Transition Probability Function P ij (t)
The Transition Probability Function P ij (t) Consider a continuous time Markov chain {X(t), t 0}. We are interested in the probability that in t time units the process will be in state j, given that it
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 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 informationLECTURE #6 BIRTH-DEATH PROCESS
LECTURE #6 BIRTH-DEATH PROCESS 204528 Queueing Theory and Applications in Networks Assoc. Prof., Ph.D. (รศ.ดร. อน นต ผลเพ ม) Computer Engineering Department, Kasetsart University Outline 2 Birth-Death
More informationStatistics 150: Spring 2007
Statistics 150: Spring 2007 April 23, 2008 0-1 1 Limiting Probabilities If the discrete-time Markov chain with transition probabilities p ij is irreducible and positive recurrent; then the limiting probabilities
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 informationMARKOV PROCESSES. Valerio Di Valerio
MARKOV PROCESSES Valerio Di Valerio Stochastic Process Definition: a stochastic process is a collection of random variables {X(t)} indexed by time t T Each X(t) X is a random variable that satisfy some
More informationBIRTH 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 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 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 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 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 informationCDA6530: Performance Models of Computers and Networks. Chapter 3: Review of Practical Stochastic Processes
CDA6530: Performance Models of Computers and Networks Chapter 3: Review of Practical Stochastic Processes Definition Stochastic process X = {X(t), t2 T} is a collection of random variables (rvs); one rv
More informationRecap. 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 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 informationM/G/1 and M/G/1/K systems
M/G/1 and M/G/1/K systems Dmitri A. Moltchanov dmitri.moltchanov@tut.fi http://www.cs.tut.fi/kurssit/elt-53606/ OUTLINE: Description of M/G/1 system; Methods of analysis; Residual life approach; Imbedded
More informationQUEUING 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 informationContinuous-Time Markov Chain
Continuous-Time Markov Chain Consider the process {X(t),t 0} with state space {0, 1, 2,...}. The process {X(t),t 0} is a continuous-time Markov chain if for all s, t 0 and nonnegative integers i, j, x(u),
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 information1 IEOR 4701: Continuous-Time Markov Chains
Copyright c 2006 by Karl Sigman 1 IEOR 4701: Continuous-Time Markov Chains A Markov chain in discrete time, {X n : n 0}, remains in any state for exactly one unit of time before making a transition (change
More informationStochastic process. X, a series of random variables indexed by t
Stochastic process X, a series of random variables indexed by t X={X(t), t 0} is a continuous time stochastic process X={X(t), t=0,1, } is a discrete time stochastic process X(t) is the state at time t,
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 informationChapter 5. Continuous-Time Markov Chains. Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan
Chapter 5. Continuous-Time Markov Chains Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan Continuous-Time Markov Chains Consider a continuous-time stochastic process
More informationMarkov processes and queueing networks
Inria September 22, 2015 Outline Poisson processes Markov jump processes Some queueing networks The Poisson distribution (Siméon-Denis Poisson, 1781-1840) { } e λ λ n n! As prevalent as Gaussian distribution
More informationLink Models for Circuit Switching
Link Models for Circuit Switching The basis of traffic engineering for telecommunication networks is the Erlang loss function. It basically allows us to determine the amount of telephone traffic that can
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 informationCDA5530: Performance Models of Computers and Networks. Chapter 3: Review of Practical
CDA5530: Performance Models of Computers and Networks Chapter 3: Review of Practical Stochastic Processes Definition Stochastic ti process X = {X(t), t T} is a collection of random variables (rvs); one
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 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 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 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 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 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 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 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 informationChapter 2. Poisson Processes. Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan
Chapter 2. Poisson Processes Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan Outline Introduction to Poisson Processes Definition of arrival process Definition
More informationContinuous Time Markov Chains
Continuous Time Markov Chains Stochastic Processes - Lecture Notes Fatih Cavdur to accompany Introduction to Probability Models by Sheldon M. Ross Fall 2015 Outline Introduction Continuous-Time Markov
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 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 informationQueueing. Chapter Continuous Time Markov Chains 2 CHAPTER 5. QUEUEING
2 CHAPTER 5. QUEUEING Chapter 5 Queueing Systems are often modeled by automata, and discrete events are transitions from one state to another. In this chapter we want to analyze such discrete events systems.
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 informationIntroduction to Queuing Networks Solutions to Problem Sheet 3
Introduction to Queuing Networks Solutions to Problem Sheet 3 1. (a) The state space is the whole numbers {, 1, 2,...}. The transition rates are q i,i+1 λ for all i and q i, for all i 1 since, when a bus
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 information57: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 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 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 informationTime Reversibility and Burke s Theorem
Queuing Analysis: Time Reversibility and Burke s Theorem Hongwei Zhang http://www.cs.wayne.edu/~hzhang Acknowledgement: this lecture is partially based on the slides of Dr. Yannis A. Korilis. Outline Time-Reversal
More informationCS 798: Homework Assignment 3 (Queueing Theory)
1.0 Little s law Assigned: October 6, 009 Patients arriving to the emergency room at the Grand River Hospital have a mean waiting time of three hours. It has been found that, averaged over the period of
More informationQuantitative Model Checking (QMC) - SS12
Quantitative Model Checking (QMC) - SS12 Lecture 06 David Spieler Saarland University, Germany June 4, 2012 1 / 34 Deciding Bisimulations 2 / 34 Partition Refinement Algorithm Notation: A partition P over
More informationQueuing Theory. Richard Lockhart. Simon Fraser University. STAT 870 Summer 2011
Queuing Theory Richard Lockhart Simon Fraser University STAT 870 Summer 2011 Richard Lockhart (Simon Fraser University) Queuing Theory STAT 870 Summer 2011 1 / 15 Purposes of Today s Lecture Describe general
More informationTCOM 501: Networking Theory & Fundamentals. Lecture 6 February 19, 2003 Prof. Yannis A. Korilis
TCOM 50: Networking Theory & Fundamentals Lecture 6 February 9, 003 Prof. Yannis A. Korilis 6- Topics Time-Reversal of Markov Chains Reversibility Truncating a Reversible Markov Chain Burke s Theorem Queues
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 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 informationChapter 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 informationPerformance Modelling of Computer Systems
Performance Modelling of Computer Systems Mirco Tribastone Institut für Informatik Ludwig-Maximilians-Universität München Fundamentals of Queueing Theory Tribastone (IFI LMU) Performance Modelling of Computer
More informationECE-517: Reinforcement Learning in Artificial Intelligence. Lecture 4: Discrete-Time Markov Chains
ECE-517: Reinforcement Learning in Artificial Intelligence Lecture 4: Discrete-Time Markov Chains September 1, 215 Dr. Itamar Arel College of Engineering Department of Electrical Engineering & Computer
More informationContents Preface The Exponential Distribution and the Poisson Process Introduction to Renewal Theory
Contents Preface... v 1 The Exponential Distribution and the Poisson Process... 1 1.1 Introduction... 1 1.2 The Density, the Distribution, the Tail, and the Hazard Functions... 2 1.2.1 The Hazard Function
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 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: http://www.cse.wustl.edu/~jain/cse567-11/
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 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 informationIntroduction 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 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 informationQueueing Theory II. Summary. ! M/M/1 Output process. ! Networks of Queue! Method of Stages. ! General Distributions
Queueing Theory II Summary! M/M/1 Output process! Networks of Queue! Method of Stages " Erlang Distribution " Hyperexponential Distribution! General Distributions " Embedded Markov Chains M/M/1 Output
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 informationM/G/1 and Priority Queueing
M/G/1 and Priority Queueing Richard T. B. Ma School of Computing National University of Singapore CS 5229: Advanced Compute Networks Outline PASTA M/G/1 Workload and FIFO Delay Pollaczek Khinchine Formula
More informationContinuous time Markov chains
Continuous time Markov chains Alejandro Ribeiro Dept. of Electrical and Systems Engineering University of Pennsylvania aribeiro@seas.upenn.edu http://www.seas.upenn.edu/users/~aribeiro/ October 16, 2017
More informationMarkov chains. 1 Discrete time Markov chains. c A. J. Ganesh, University of Bristol, 2015
Markov chains c A. J. Ganesh, University of Bristol, 2015 1 Discrete time Markov chains Example: A drunkard is walking home from the pub. There are n lampposts between the pub and his home, at each of
More informationSYMBOLS AND ABBREVIATIONS
APPENDIX A SYMBOLS AND ABBREVIATIONS This appendix contains definitions of common symbols and abbreviations used frequently and consistently throughout the text. Symbols that are used only occasionally
More informationThe story of the film so far... Mathematics for Informatics 4a. Continuous-time Markov processes. Counting processes
The story of the film so far... Mathematics for Informatics 4a José Figueroa-O Farrill Lecture 19 28 March 2012 We have been studying stochastic processes; i.e., systems whose time evolution has an element
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 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 informationIrreducibility. Irreducible. every state can be reached from every other state For any i,j, exist an m 0, such that. Absorbing state: p jj =1
Irreducibility Irreducible every state can be reached from every other state For any i,j, exist an m 0, such that i,j are communicate, if the above condition is valid Irreducible: all states are communicate
More informationSTOCHASTIC PROCESSES Basic notions
J. Virtamo 38.3143 Queueing Theory / Stochastic processes 1 STOCHASTIC PROCESSES Basic notions Often the systems we consider evolve in time and we are interested in their dynamic behaviour, usually involving
More informationOutline. 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 informationIEOR 6711: Stochastic Models I, Fall 2003, Professor Whitt. Solutions to Final Exam: Thursday, December 18.
IEOR 6711: Stochastic Models I, Fall 23, Professor Whitt Solutions to Final Exam: Thursday, December 18. Below are six questions with several parts. Do as much as you can. Show your work. 1. Two-Pump Gas
More informationIEOR 4106: Introduction to Operations Research: Stochastic Models Spring 2011, Professor Whitt Class Lecture Notes: Tuesday, March 1.
IEOR 46: Introduction to Operations Research: Stochastic Models Spring, Professor Whitt Class Lecture Notes: Tuesday, March. Continuous-Time Markov Chains, Ross Chapter 6 Problems for Discussion and Solutions.
More informationQ = (c) Assuming that Ricoh has been working continuously for 7 days, what is the probability that it will remain working at least 8 more days?
IEOR 4106: Introduction to Operations Research: Stochastic Models Spring 2005, Professor Whitt, Second Midterm Exam Chapters 5-6 in Ross, Thursday, March 31, 11:00am-1:00pm Open Book: but only the Ross
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 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 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 informationSTAT 380 Continuous Time Markov Chains
STAT 380 Continuous Time Markov Chains Richard Lockhart Simon Fraser University Spring 2018 Richard Lockhart (Simon Fraser University)STAT 380 Continuous Time Markov Chains Spring 2018 1 / 35 Continuous
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 informationName 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 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 informationGlossary availability cellular manufacturing closed queueing network coefficient of variation (CV) conditional probability CONWIP
Glossary availability The long-run average fraction of time that the processor is available for processing jobs, denoted by a (p. 113). cellular manufacturing The concept of organizing the factory into
More informationLecture 4a: Continuous-Time Markov Chain Models
Lecture 4a: Continuous-Time Markov Chain Models Continuous-time Markov chains are stochastic processes whose time is continuous, t [0, ), but the random variables are discrete. Prominent examples of continuous-time
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 informationMarkov Processes Cont d. Kolmogorov Differential Equations
Markov Processes Cont d Kolmogorov Differential Equations The Kolmogorov Differential Equations characterize the transition functions {P ij (t)} of a Markov process. The time-dependent behavior of the
More informationIntro to Queueing Theory
1 Intro to Queueing Theory Little s Law M/G/1 queue Conservation Law 1/31/017 M/G/1 queue (Simon S. Lam) 1 Little s Law No assumptions applicable to any system whose arrivals and departures are observable
More information2905 Queueing Theory and Simulation PART III: HIGHER DIMENSIONAL AND NON-MARKOVIAN QUEUES
295 Queueing Theory and Simulation PART III: HIGHER DIMENSIONAL AND NON-MARKOVIAN QUEUES 16 Queueing Systems with Two Types of Customers In this section, we discuss queueing systems with two types of customers.
More informationThe exponential distribution and the Poisson process
The exponential distribution and the Poisson process 1-1 Exponential Distribution: Basic Facts PDF f(t) = { λe λt, t 0 0, t < 0 CDF Pr{T t) = 0 t λe λu du = 1 e λt (t 0) Mean E[T] = 1 λ Variance Var[T]
More informationINDEX. production, see Applications, manufacturing
INDEX Absorbing barriers, 103 Ample service, see Service, ample Analyticity, of generating functions, 100, 127 Anderson Darling (AD) test, 411 Aperiodic state, 37 Applications, 2, 3 aircraft, 3 airline
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 informationEXAM IN COURSE TMA4265 STOCHASTIC PROCESSES Wednesday 7. August, 2013 Time: 9:00 13:00
Norges teknisk naturvitenskapelige universitet Institutt for matematiske fag Page 1 of 7 English Contact: Håkon Tjelmeland 48 22 18 96 EXAM IN COURSE TMA4265 STOCHASTIC PROCESSES Wednesday 7. August, 2013
More information(b) What is the variance of the time until the second customer arrives, starting empty, assuming that we measure time in minutes?
IEOR 3106: Introduction to Operations Research: Stochastic Models Fall 2006, Professor Whitt SOLUTIONS to Final Exam Chapters 4-7 and 10 in Ross, Tuesday, December 19, 4:10pm-7:00pm Open Book: but only
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 information