Queuing Networks: Burke s Theorem, Kleinrock s Approximation, and Jackson s Theorem. Wade Trappe
|
|
- Valerie Riley
- 6 years ago
- Views:
Transcription
1 Queuing Networks: Burke s Theorem, Kleinrock s Approximation, and Jackson s Theorem Wade Trappe
2 Lecture Overview Network of Queues Introduction Queues in Tandem roduct Form Solutions Burke s Theorem What is reversibility? Kleinrock s Approximation Quick Jackson Theorem
3 Network of Queues: Setup In many networking scenarios, a customer or packet must receive service from many servers before its final task is completed. Hence, departures from a queue might become arrivals at another queue. All that discussion we did in M/G/ queues becomes very important for networks of queues! Consider two queues in tandem: Departures from first queue become arrivals at second queue First queue s arrival process is oisson with rate λ and service time is exponential with rate µ > λ Service time at the second queue is exponential with rate µ 2 and independent of first server s service time How do we model these two queues together? What s the state and state diagram? > λ
4 Two Queues in Tandem Queue µ Queue2 µ 2 We need to keep track of N (t) and N 2 (t) to describe the state of the system!
5 Our state diagram must keep track of both N (t) and N 2 (t), and the many transitions that are possible Two Queues in Tandem: State Diagram 3 µ 2 µ µ µ 2 µ 2 µ µ 2 2 λ λ λ µ 2 µ µ 2 µ µ 2 µ µ 2 λ λ λ µ 2 µ µ 2 µ µ µ 2 µ 2 n 2 =0 λ λ λ n =0 2 3
6 Global Balance Equations for 2 Queues, pg Define (N (t), N 2 (t)) to be the state vector for the two queues in tandem Notice, now, that we have a Markov rocess in terms of the state vector Recall the global balance equations for M/M/ queues: λp 0 = µ p ( λ + µ ) p = λp + µ p, j =,2,... j j What this means is: At steady state, the amount entering a state is equal to the amount leaving the state. We similarly may find the global balance equations for this two queue system j+
7 Global Balance Equations for 2 Queues, pg 2 Global Balance Equations: Case λ N = 0, N Case 2: n>0, m=0 Case 3: m>0, n=0 Case 4: n>0, m>0 ( = 0) = µ ( N = 0, N ) = ( λ + µ ) ( N = n, N = 0) = µ ( N = n, N = ) + λ( N = n, N 0) = ( λ + µ ) ( N = 0, N = m) = µ ( N = 0, N = m + ) + µ ( N =, N = m ) ( λ + µ + µ 2 ) ( N = n, N2 = m) = µ 2( N = n, N2 = m + ) + µ ( N = n +, N2 = m ) + λ( N = n, N = m) 2
8 Steady State MFs for Two M/M/ Queues We may show that the following joint probability mass function satisfies the global balance equations ( ) ( ) n N ( ) m = n, N2 = m = ρ ρ ρ2 ρ2 where ρ i =λ/µ i So, how do we get (N =n)? Easy, its just an M/M/! So (N =n) = (-ρ )ρ n for n=0,,2 How do we get (N 2 =m)? Answer: It s a marginal. Integrate out the joint pmf! Sum over all n to get: ( N ) ( ) m 2 = m = ρ2 ρ2 Check This!
9 Steady State MFs for Two Queues, pg 2 This looks interesting means ( ) ( ) n N ( ) m = n, N2 = m = ρ ρ ρ2 ρ2 ( N = n, N = m) = ( N = n) ( N m) 2 2 = Thus, the number of customers at queue and the number at queue 2 at a particular time are independent random variables! The steady state at queue 2 is the same as for an M/M/ queue with oisson arrival rate λ and exponential service time µ 2. Definition: A network of queues is said to have a product-form solution when the joint pmf of the number of customers at each queue is the product of the marginal pmfs of the number of customers at each queue.
10 Burke s Theorem Burke s Theorem is the fundamental result describing product form solutions Burke s Theorem: Consider an M/M/, M/M/m, M/M/infinity queuing system at steady state with arrival rate λ, then The departure process is oisson with rate λ; At each time t, the number of customers in the system N(t) is independent of the sequence of departure times prior to t. What Burke s Theorem implies: Two queue problem follows from Burke s Thm (arrivals to queue 2 are oisson with rate λ). Arrivals to queue 2 prior to time t are departures from queue prior to time t, thus Burke s theorem says queue- s departures (queue-2 s arrivals) are independent of N (t). N 2 (t) is determined by the sequence of arrivals from queue- prior to time t and independent of service times, then N (t) and N 2 (t) are independent as random variables. Note: N (t) and N 2 (t) are not independent as processes!
11 Example Application of Burke s Thm Consider the network of queues: /2 µ 2 λ µ /2 λ 2 µ 3 Here Queue is driven by a oisson process with rate λ,, and the departures are randomly routed to queues 2 and 3. Queue 3 has an additional, independent oisson arrival process with rate λ 2.
12 Example Application of Burke s Thm,, pg 2 Burke s Theorem says: N (t) and N 2 (t) are independent N (t) and N 3 (t) are independent Recall that the random split of a oisson process yields independent oisson processes Hence inputs to Queue 2 and Queue 3 are independent Input to Queue 2 is oisson with rate λ /2 Input to Queue 3 is oisson with rate λ /2 + λ 2 Thus k m ( N ) ( ) ( ) ( ) n (t) = k, N2(t) = m, N3(t) = n = ρ ρ ρ2 ρ2 ρ3 ρ3 where ρ =λ /µ, ρ 2 =λ /2µ 2, ρ 3 =(λ /2 +λ 2 )/µ 3. All queues are assumed to be stable.
13 Reversible Markov rocesses In order to prove Burke s theorem, we need the concept of the reversibility of a Markov process. A stationary Markov process X(t), with a countable state space (i.e. a Markov chain will do), is reversible if X(t) and Y(t)=X(-t) have the same joint distribution at arbitrarily chosen instants {t, t 2,, t N }. A necessary and sufficient condition for reversibility is p p = p i i, j where {p i } and {p ij } are the stationary probabilities and transition probabilities of X(t) This condition can be easily shown for M/M/ queues but we will show it in more general form In fact, it holds for any birth-death process, and N(-t) is statistically identical to N(t) j p j,i
14 Reversible Markov rocesses, pg 2 Time-Reversal Theorem: Let {X(t): t>=0} be a stationary Markov process with (infinitesimal) generator =[p ij ], and with initial distribution equal to stationary distribution. Then for all T>0, the time-reversed process is equivalent to a stationary ~ Markov process with (infinitesimal) generator ij given by: ~ p jp ji pij = p for all state pairs (i,j) { X(T t) :0 t T} i
15 Reversible Markov rocesses, pg 3 roof: Let Q(t)=[q ij (t)] denote the transition probabilities of X(t), [ N(t) = j N(0) i] q ij (t) = = We need to show X(T-t) is a Markov process with transition probabilities Q ~ (t) ~ q (t) = ij Then we obtain the necessary and sufficient condition by differentiating this and setting t=0. (Its an infinitesimal generator) p j q p ji i (t)
16 Reversible Markov rocesses, pg 4 Consider the interval (0,t+s] and divide it into (0,t] and (t,t+s], i.e. set T=t+s. The joint probability of the three random variables is Similarly we have X ~ (0) = X(t + s) X ~ (t) = X(s) X ~ (t + s) = = = ( X ~ (0) = i, X ~ (t) = i, X ~ (t + s) = i ) p = ( X(0) = i,x(s) = i,x(t + s) = i ) i q 0 2 (s)q 2 i2,i i, i0 (t) 2 0 X(0) ( X ~ (0) = i,x ~ (t) = i ) = ( X(s) = i,x(s + t) = i ) p i q i, i0 0 (t) 0
17 Reversible Markov rocesses, pg 5 The conditional probability = ( X ~ (t + s) = i X ~ (t) = i, X ~ (0) = i ) p i = = ~ q 2 ( X ~ (t + s) = i X ~ (t) = i ) i, j q i p 2 i,i (t) 2 2 Hence, we have shown that X ~ ( t) is a Markov process with ~ generator (after differentiation). 0
18 B-D D rocesses are Reversible It is now easy to show the following Time Reversibility of B-D rocesses: The stationary B-D process N(t) with generator and steady state probabilities p is a time-reversible Markov process. Thus, the time-reversal of the death process is a birth process. Burke s Theorem follows from this: Interdeparture times of the forward-time system are the interarrival times of the time-reversed system... Hence we have oisson with rate λ coming out of the system. Fix a time t, then the departures before time t from the forward system are arrivals after time t in the reverse system. Arrivals in reverse system are oisson, and thus arrivals in reverse system after time t do not depend on N(t) Consequently, departures after time t in forward system do not depend on N(t)
19 Step back to Network of Queues What we derived held true because the first queue was M/M/ and implicitly we assumed it had achieved steady state and independent service times between queues! The problem is more complicated when we have more general networks of queues. Again, consider two transmission lines in sequence. The arrivals to the first are oisson of rate λ, but all customers (packets) have deterministic and equal service times, i.e. we have an M/D/ queue. λ Queue µ Queue2 µ Average packet delay for first queue is given by ollaczek- Khinchine formula.
20 Network of Queues, M/D/ first queue The interarrival times of the second queue must be at least /µ Why? Now, each packet arriving at either queue takes /µ time to process. The first packet being finished by first queue is immediately sent to second server It takes at least another /µ amount of time for first queue to get and finish the next packet/customer. So, first packet will be finished by second server at or before the next packet arrives to second server. Result: No queue (waiting) at second system!
21 Two Queues, correlated service times Earlier we considered the service times independent of each other and independent of the arrival times. Reality: A big packet at the first system is probably still a big packet at the second system! Interarrival times at the second queue are strongly correlated with packet lengths! Long packets at first system will typically find the queue at the second server more empty Shorter packets from the first system will typically find the queue at the second server more busy because the second server is processing some prior big packet It is tough to find an analytical solution for joint pmf under dependence assumptions!
22 The Kleinrock Independence Approximation We have argued that in practice there is dependence upon the interarrival times and service times. Independence is lost after the first system! Reality hurt us, but reality provides us one more gift Reality: Real networks typically involve more than one stream of packets merging at a node The combination of multiple streams helps restore independence in many cases! This observation is due to Kleinrock. Kleinrock s Approximation: It is often appropriate to use M/M/ queues for each communication link when the arrivals at entry points are oisson, packet lengths are roughly exponentially distributed, network is dense and traffic is heavy.
23 Quick Look at Jackson s Theorem Many queuing networks, a packet/customer may visit a queue more than once. Burke s theorem does not apply! Typical example: Queue with feedback p α λ µ -p If the arrival rate is much less than departure rate, then net arrival process has a few, isolated external arrivals followed by a burst of feedback arrivals (dependent on packet length).
24 Jackson s Theorem, (Open) pg. Consider a queuing network consisting of M separate service stations, each with its own queue. Define the vector process: N t = N (t), N (t),, N (t) ( ) [ ] 2 L In an open queuing network, customers may arrive from an external source and eventually may leave the network (as depicted in previous slide). A closed network has no arrivals or departures from the system (total customers is fixed just they may move around) Assumptions: The rate of the source (birth process) is λ, and a customer goes to station i with probability q si. Service time at station k is exponential with rate µ k. Customers are routed according to a Markov chain: robability that a customer departing station i goes to station j is q ij. M
25 Jackson s Theorem, (Open) pg 2. Jackson s Decomposition Theorem: For an open queue as described, the joint distribution of the queue vector n(t) is given by: ( n) = ( N = n ) ( N = n ) L( N ) = 2 2 K n K where (N k =n k ) is the steady state pmf of an M/M/ system with arrival rate λ k and service rate µ k, i.e. n ( N = n ) = ρ ( ) k ρ k k k Where ρ k describes the utilization factor of system k. k
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 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 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 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 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 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 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 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 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 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 informationIntro Refresher Reversibility Open networks Closed networks Multiclass networks Other networks. Queuing Networks. Florence Perronnin
Queuing Networks Florence Perronnin Polytech Grenoble - UGA March 23, 27 F. Perronnin (UGA) Queuing Networks March 23, 27 / 46 Outline Introduction to Queuing Networks 2 Refresher: M/M/ queue 3 Reversibility
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 information6 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationReadings: 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 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 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 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 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 informationMarkov 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 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 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 informationQueueing Networks G. Rubino INRIA / IRISA, Rennes, France
Queueing Networks G. Rubino INRIA / IRISA, Rennes, France February 2006 Index 1. Open nets: Basic Jackson result 2 2. Open nets: Internet performance evaluation 18 3. Closed nets: Basic Gordon-Newell result
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 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 information16:330:543 Communication Networks I Midterm Exam November 7, 2005
l l l l l l l l 1 3 np n = ρ 1 ρ = λ µ λ. n= T = E[N] = 1 λ µ λ = 1 µ 1. 16:33:543 Communication Networks I Midterm Exam November 7, 5 You have 16 minutes to complete this four problem exam. If you know
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 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 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 informationCHAPTER 4. Networks of queues. 1. Open networks Suppose that we have a network of queues as given in Figure 4.1. Arrivals
CHAPTER 4 Networks of queues. Open networks Suppose that we have a network of queues as given in Figure 4.. Arrivals Figure 4.. An open network can occur from outside of the network to any subset of nodes.
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 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 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 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 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 informationUNIVERSITY OF YORK. MSc Examinations 2004 MATHEMATICS Networks. Time Allowed: 3 hours.
UNIVERSITY OF YORK MSc Examinations 2004 MATHEMATICS Networks Time Allowed: 3 hours. Answer 4 questions. Standard calculators will be provided but should be unnecessary. 1 Turn over 2 continued on next
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 informationCHAPTER 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 informationMarkov Processes and Queues
MIT 2.853/2.854 Introduction to Manufacturing Systems Markov Processes and Queues Stanley B. Gershwin Laboratory for Manufacturing and Productivity Massachusetts Institute of Technology Markov Processes
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 informationPerformance analysis of queueing systems with resequencing
UNIVERSITÀ DEGLI STUDI DI SALERNO Dipartimento di Matematica Dottorato di Ricerca in Matematica XIV ciclo - Nuova serie Performance analysis of queueing systems with resequencing Candidato: Caraccio Ilaria
More informationMulti Stage Queuing Model in Level Dependent Quasi Birth Death Process
International Journal of Statistics and Systems ISSN 973-2675 Volume 12, Number 2 (217, pp. 293-31 Research India Publications http://www.ripublication.com Multi Stage Queuing Model in Level Dependent
More informationProbability Models in Electrical and Computer Engineering Mathematical models as tools in analysis and design Deterministic models Probability models
Probability Models in Electrical and Computer Engineering Mathematical models as tools in analysis and design Deterministic models Probability models Statistical regularity Properties of relative frequency
More informationNEW FRONTIERS IN APPLIED PROBABILITY
J. Appl. Prob. Spec. Vol. 48A, 209 213 (2011) Applied Probability Trust 2011 NEW FRONTIERS IN APPLIED PROBABILITY A Festschrift for SØREN ASMUSSEN Edited by P. GLYNN, T. MIKOSCH and T. ROLSKI Part 4. Simulation
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 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 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 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 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 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 informationClassical Queueing Models.
Sergey Zeltyn January 2005 STAT 99. Service Engineering. The Wharton School. University of Pennsylvania. Based on: Classical Queueing Models. Mandelbaum A. Service Engineering course, Technion. http://iew3.technion.ac.il/serveng2005w
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 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 informationTOWARDS BETTER MULTI-CLASS PARAMETRIC-DECOMPOSITION APPROXIMATIONS FOR OPEN QUEUEING NETWORKS
TOWARDS BETTER MULTI-CLASS PARAMETRIC-DECOMPOSITION APPROXIMATIONS FOR OPEN QUEUEING NETWORKS by Ward Whitt AT&T Bell Laboratories Murray Hill, NJ 07974-0636 March 31, 199 Revision: November 9, 199 ABSTRACT
More informationStability and Rare Events in Stochastic Models Sergey Foss Heriot-Watt University, Edinburgh and Institute of Mathematics, Novosibirsk
Stability and Rare Events in Stochastic Models Sergey Foss Heriot-Watt University, Edinburgh and Institute of Mathematics, Novosibirsk ANSAPW University of Queensland 8-11 July, 2013 1 Outline (I) Fluid
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 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 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 informationECE 3511: Communications Networks Theory and Analysis. Fall Quarter Instructor: Prof. A. Bruce McDonald. Lecture Topic
ECE 3511: Communications Networks Theory and Analysis Fall Quarter 2002 Instructor: Prof. A. Bruce McDonald Lecture Topic Introductory Analysis of M/G/1 Queueing Systems Module Number One Steady-State
More informationContents 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 informationExact Simulation of the Stationary Distribution of M/G/c Queues
1/36 Exact Simulation of the Stationary Distribution of M/G/c Queues Professor Karl Sigman Columbia University New York City USA Conference in Honor of Søren Asmussen Monday, August 1, 2011 Sandbjerg Estate
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 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 informationModelling Complex Queuing Situations with Markov Processes
Modelling Complex Queuing Situations with Markov Processes Jason Randal Thorne, School of IT, Charles Sturt Uni, NSW 2795, Australia Abstract This article comments upon some new developments in the field
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 informationBuzen s algorithm. Cyclic network Extension of Jackson networks
Outline Buzen s algorithm Mean value analysis for Jackson networks Cyclic network Extension of Jackson networks BCMP network 1 Marginal Distributions based on Buzen s algorithm With Buzen s algorithm,
More informationBirth-Death Processes
Birth-Death Processes Birth-Death Processes: Transient Solution Poisson Process: State Distribution Poisson Process: Inter-arrival Times Dr Conor McArdle EE414 - Birth-Death Processes 1/17 Birth-Death
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 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 informationLecture 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(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 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 information15 Closed production networks
5 Closed production networks In the previous chapter we developed and analyzed stochastic models for production networks with a free inflow of jobs. In this chapter we will study production networks for
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 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 Networks and Insensitivity
Lukáš Adam 29. 10. 2012 1 / 40 Table of contents 1 Jackson networks 2 Insensitivity in Erlang s Loss System 3 Quasi-Reversibility and Single-Node Symmetric Queues 4 Quasi-Reversibility in Networks 5 The
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 informationNetworks of Queues Models with Several. Classes of Customers and Exponential. Service Times
Applied Mathematical Sciences, Vol. 9, 2015, no. 76, 3789-3796 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2015.53287 Networks of Queues Models with Several Classes of Customers and Exponential
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 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 informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science 6.262 Discrete Stochastic Processes Midterm Quiz April 6, 2010 There are 5 questions, each with several parts.
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 information15 Closed production networks
5 Closed production networks In the previous chapter we developed and analyzed stochastic models for production networks with a free inflow of jobs. In this chapter we will study production networks for
More informationJ. MEDHI STOCHASTIC MODELS IN QUEUEING THEORY
J. MEDHI STOCHASTIC MODELS IN QUEUEING THEORY SECOND EDITION ACADEMIC PRESS An imprint of Elsevier Science Amsterdam Boston London New York Oxford Paris San Diego San Francisco Singapore Sydney Tokyo Contents
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 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 information