Time Reversibility and Burke s Theorem
|
|
- Blaze Greene
- 6 years ago
- Views:
Transcription
1 Queuing Analysis: Time Reversibility and Burke s Theorem Hongwei Zhang Acknowledgement: this lecture is partially based on the slides of Dr. Yannis A. Korilis.
2 Outline Time-Reversal of Markov Chains Reversibility Truncating a Reversible Markov Chain Burke s Theorem Queues in Tandem
3 Outline Time-Reversal of Markov Chains Reversibility Truncating a Reversible Markov Chain Burke s Theorem Queues in Tandem
4 Time-Reversed Markov Chains {X n : n=0,, } irreducible aperiodic Markov chain with transition probabilities P i = 0 P i =, i = 0,,... Unique stationary distribution (π > 0) if and only if GBE holds, i.e., Process in steady state: π = π P, = 0,,... i= 0 i i Pr{ X n = } = π = lim Pr { X n = X 0 = i} n Starts at n=-, that is {X n : n =,-,0,, }, or Choose initial state according to the stationary distribution How does {X n } look reversed in time?
5 Time-Reversed Markov Chains Define Y n =X τ-n, for arbitrary τ>0 => {Y n } is the reversed process. Proposition : {Y n } is a Markov chain with transition probabilities: P Pi =, i, = 0,,... π π * i i {Y n } has the same stationary distribution π with the forward chain {X n } The reversed chain corresponds to the same process, looked at in the reversed-time direction
6 Time-Reversed Markov Chains Proof of Proposition : P = P{ Y = Y = i, Y = i, K, Y = i } * i m m m m k k = P{ X = X = i, X = i, K, X = i } τ m τ m+ τ m+ τ m+ k k = P{ X = X = i, X = i, K, X = i } n n+ n+ n+ k k P{ X n =, X n+ = i, X n+ = i, K, X n+ k = ik} = P { X = i, X = i, K, X = i } n+ n+ n+ k k n+ = K n+ k = k n = n+ n n+ P{ X i,, X i X, X = i} P{ X =, X = i} = P{ X = i, K, X = i X = i} P{ X = i} P{ X =, X = i} P{ X = i} n n+ = = n+ n+ n+ k k n+ n+ P{ X = i X = } P{ X = } Piπ P{ X = i} π n+ n n = = n+ π P * i π π π π 0 ipi = i i 0 i = P i 0 i = = = = πi P{ X = X = i} = P{ Y = Y = i} n n+ m m i
7 Outline Time-Reversal of Markov Chains Reversibility Truncating a Reversible Markov Chain Burke s Theorem Queues in Tandem
8 Reversibility Stochastic process {X(t)} is called reversible if (X(t ), X(t ),, X(t n )) and (X(τ-t ), X(τ-t ),, X(τ-t n )) have the same probability distribution, for all τ, t,, t n Markov chain {X n } is reversible if and only if the transition probabilities of forward and reversed chains are equal, i.e., P i = P * i Detailed Balance Equations Reversibility π P = π P, i, = 0,,... i i i
9 Reversibility Discrete-Time Chains Theorem : If there exists a set of positive numbers {π }, that sum up to and satisfy: π P = π P, i, = 0,,... i i i Then:. {π } is the unique stationary distribution. The Markov chain is reversible Example: Discrete-time birth-death processes are reversible, since they satisfy the DBE
10 Example: Birth-Death Process P 0 S Pn, n S c P n, n + 0 n n+ P 00 P 0 Pn, n P n, n P n +, n One-dimensional Markov chain with transitions only between neighboring states: P i =0, if i- > Detailed Balance Equations (DBE) π P = π P n = 0,,... n n, n+ n+ n+, n Proof: GBE with S ={0,,,n} give: n n π P = π P π P = π P i i i n n, n+ n+ n+, n = 0 i= n+ = 0 i= n+
11 Time-Reversed Markov Chains (Revisited) Theorem : Irreducible Markov chain with transition probabilities P i. If there exist: A set of transition probabilities P i*, with P i* =, i 0, and A set of positive numbers {π }, that sum up to, such that Then: * i π i P = π P, i, i i P i * are the transition probabilities of the reversed chain, and {π } is the stationary distribution of the forward and the reversed chains 0 Remark: Used to find the stationary distribution, by guessing the transition probabilities of the reversed chain even if the process is not reversible
12 Continuous-Time Markov Chains {X(t): - < t < } irreducible aperiodic Markov chain with transition rates q i, i Unique stationary distribution (p i > 0) if and only if: p q = p q, = 0,,... i i i i i Process in steady state e.g., started at t =- : Pr{ X ( t) = } = p = lim Pr{ X ( t) = X (0) = i} If {π } is the stationary distribution of the embedded discrete-time chain: t π / ν p =, ν q i, = 0,,... i π / ν i i i
13 Reversed Continuous-Time Markov Chains Reversed chain {Y(t)}, with Y(t)=X(τ-t), for arbitrary τ>0 Proposition :. {Y(t)} is a continuous-time Markov chain with transition rates: p * q i qi =, i, = 0,,..., i p i. {Y(t)} has the same stationary distribution {p } with the forward chain Remark: The transition rate out of state i in the reversed chain is equal to the transition rate out of state i in the forward chain i p q p q q = = = q = ν, i = 0,,... * i i i i i i i i i pi pi
14 Reversibility Continuous-Time Chains Markov chain {X(t)} is reversible if and only if the transition rates of forward and reversed chains are equal q = q *, or equivalently p q = p q, i, = 0,,..., i i i i i.e., Detailed Balance Equations Reversibility i i Theorem 3: If there exists a set of positive numbers {p }, that sum up to and satisfy: p q = p q, i, = 0,,..., i i i i Then:. {p } is the unique stationary distribution. The Markov chain is reversible
15 Example: Birth-Death Process S S c λ 0 λ λn λ n 0 n n+ n n + Transitions only between neighboring states q = λ, q =, q = 0, i > i, i+ i i, i i i Detailed Balance Equations λ, 0,,... n pn = n + pn + n = Proof: GBE with S ={0,,,n} give: n i i i n n n+ n+ = 0 i= n+ = 0 i= n+ M/M/, M/M/c, M/M/ n p q = p q λ p = p
16 Reversed Continuous-Time Markov Chains (Revisited) Theorem 4: Irreducible continuous-time Markov chain with transition rates q i. If there exist: A set of transition rates q i *, with i q i * = i q i, i 0, and A set of positive numbers {p }, that sum up to, such that Then: p q i * i = p q, i, 0, i q i * are the transition rates of the reversed chain, and i {p } is the stationary distribution of the forward and the reversed chains Remark: Used to find the stationary distribution, by guessing the transition probabilities of the reversed chain even if the process is not reversible
17 Reversibility: Trees Theorem 5: q 0 0 q 0 q q 6 q q 6 6 q 3 q 3 q 67 q 76 Irreducible Markov chain, with transition rates that satisfy q i >0 q i >0 Form a graph for the chain, where states are the nodes, and for each q i >0, there is a directed arc i Then, if graph is a tree contains no loops then Markov chain is reversible Remarks: Sufficient condition for reversibility Generalization of one-dimensional birth-death process
18 Kolmogorov s Criterion (Discrete Chain) Detailed balance equations determine whether a Markov chain is reversible or not, based on stationary distribution and transition probabilities Should be able to derive a reversibility criterion based only on the transition probabilities! Theorem 6: A discrete-time Markov chain is reversible if and only if: P P LP P = P P LP P i i i i i i i i i i i i i i i i 3 n n n n n n 3 for any finite sequence of states: i, i,, i n, and any n Intuition: Probability of traversing any loop i i i n i is equal to the probability of traversing the same loop in the reverse direction i i n i i
19 Kolmogorov s Criterion (Continuous Chain) Detailed balance equations determine whether a Markov chain is reversible or not, based on stationary distribution and transition rates Should be able to derive a reversibility criterion based only on the transition rates! Theorem 7: A continuous-time Markov chain is reversible if and only if: q q Lq q = q q Lq q i i i i i i i i i i i i i i i i 3 n n n n n n 3 for any finite sequence of states: i, i,, i n, and any n Intuition: Product of transition rates along any loop i i i n i is equal to the product of transition rates along the same loop traversed in the reverse direction i i n i i
20 Kolmogorov s Criterion (proof) Proof of Theorem 6: Necessary: If the chain is reversible the DBE hold π π π P i i P i i 3 = π P i i = π Pi i M P P LP P = P P LP P = π P = πp n 3 3 n i i n i i π P n n n n P n i i i i n i i i i i i i i i i i i i i i i 3 n n n n n n 3 Sufficient: Fixing two states i =i, and i n = and summing over all states i,, n- i we have P P LP P = P P LP P P P = P P Taking the limit n n n i, i i i i, i i, i i i i, i i i i i 3 n n 3 n n lim Pi Pi = Pi lim Pi π Pi = Piπ i n n
21 Example: M/M/ Queue with Heterogeneous Servers 0 αλ ( α) λ A B A B B A λ λ M/M/ queue. Servers A and B with service rates A and B respectively. When λ 3 λ A + B A + B the system empty, arrivals go to A with probability α and to B with probability -α. Otherwise, the head of the queue takes the first free server. Need to keep track of which server is busy when there is customer in the system. Denote the two possible states by: A and B. Reversibility: we only need to check the loop 0 A B 0: q0, Aq A,q,Bq B,0 = αλ λ A B q0,bq B,q, Aq A,0 = ( α) λ λ B A Reversible if and only if α=/. What happens when A = B, and α /?
22 Example: M/M/ Queue with Heterogeneous Servers S 3 0 αλ ( α) λ A B A B B A λ λ λ λ 3 + A + B A B S S n λ pn = p, n =,3,... A + B p = p λ p0 = A p A + B p B ( + ) p = λ( p + p ) p = p A 0 λ λ + α ( A + B ) λ + + λ λ + ( α )( + ) A B A B A B B 0 B λ + A + B A + p A = p0 + B p + ( ) A + p = p0 A B λ + A + B ( λ) αλ A A B λ λ α α + ( ) + p0 + p A + pb + p n = p0 = n= + A + B λ A B λ + A + B λ λ λ α A α B B
23 Outline Time-Reversal of Markov Chains Reversibility Truncating a Reversible Markov Chain Burke s Theorem Queues in Tandem
24 Multidimensional Markov Chains Theorem 8: {X (t)}, {X (t)}: independent Markov chains {X i (t)}: reversible {X(t)}, with X(t)=(X (t), X (t)): vector-valued stochastic process {X(t)} is a Markov chain {X(t)} is reversible Multidimensional Chains: Queueing system with two classes of customers, each having its own stochastic properties track the number of customers from each class Study the oint evolution of two queueing systems track the number of customers in each system
25 Example: Two Independent M/M/ Queues Two independent M/M/ queues. The arrival and service rates at queue i are λ i and i respectively. Assume ρ i = λ i / i <. {(N (t), N (t))} is a Markov chain. Probability of n customers at queue, and n at queue, at steady-state Product-form distribution Generalizes for any number K of independent queues, M/M/, M/M/c, or M/M/. If p i (n i ) is the stationary distribution of queue i: p n n ρ ρ ρ ρ p n p n n n (, ) = ( ) ( ) = ( ) ( ) p( n, n, K, n ) = p ( n ) p ( n ) K p ( n ) K K K
26 Example (contd.) Stationary distribution: λ λ λ λ p( n, n ) = Detailed Balance Equations: p( n +, n ) = λ p( n, n ) p( n, n + ) = λ p( n, n ) Verify that the Markov chain is reversible Kolmogorov criterion n n λ λ λ λ λ λ λ λ λ λ 0 3 λ λ λ λ λ λ λ λ λ λ λ λ λ 0 3 λ
27 Truncation of a Reversible Markov Chain Theorem 9: {X(t)} reversible Markov process with state space S, and stationary distribution {p : S}. Truncated to a set E S, such that the resulting chain {Y(t)} is irreducible. Then, {Y(t)} is reversible and has stationary distribution: p p% =, E p p k E k Remark: This is the conditional probability that, in steady-state, the original process is at state, given that it is somewhere in E Proof: Verify that: p pi p% q i = p% iqi q i = qi p q i = piqi, i, S; i p p E p% k E p = = E p k E k k k E k
28 Example: Two Queues with Joint Buffer The two independent M/M/ queues of the previous example share a common buffer of size B arrival that finds B customers waiting is blocked State space restricted to E = {( n, n ) : ( n ) + ( n ) B} + + Distribution of truncated chain: n n ρ ρ p( n, n ) = p(0,0), ( n, n ) E Normalizing: p(0,0) n n = ( n, n ) E ρ ρ Theorem specifies oint distribution up to the normalization constant Calculation of normalization constant is often tedious λ λ λ λ λ λ λ λ λ λ λ λ λ 0 λ λ λ λ λ λ 3 λ State diagram for B =
29 Outline Time-Reversal of Markov Chains Reversibility Truncating a Reversible Markov Chain Burke s Theorem Queues in Tandem
30 Birth-death process {X(t)} birth-death process with stationary distribution {p } Arrival epochs: points of increase for {X(t)} Departure epoch: points of decrease for {X(t)} {X(t)} completely determines the corresponding arrival and departure processes Arrivals Departures
31 Forward & reversed chains of M/M/* queues Poisson arrival process: λ =λ, for all Birth-death process called a (λ, )-process Examples: M/M/, M/M/c, M/M/ queues Poisson arrivals LAA: for any time t, future arrivals are independent of {X(s): s t} (λ, )-process at steady state is reversible: forward and reversed chains are stochastically identical => Arrival processes of the forward and reversed chains are stochastically identical => Arrival process of the reversed chain is Poisson with rate λ + the arrival epochs of the reversed chain are the departure epochs of the forward chain => Departure process of the forward chain is Poisson with rate λ
32 Forward & reversed chains of M/M/* queues (contd.) t t t t Reversed chain: arrivals after time t are independent of the chain history up to time t (LAA) => Forward chain: departures prior to time t and future of the chain {X(s): s t} are independent
33 Burke s Theorem Theorem 0: Consider an M/M/, M/M/c, or M/M/ system with arrival rate λ. Suppose that the system starts at steady-state. Then:. The departure process is Poisson with rate λ. At each time t, the number of customers in the system is independent of the departure times prior to t Fundamental result for study of networks of M/M/* queues, where output process from one queue is the input process of another
34 Outline Time-Reversal of Markov Chains Reversibility Truncating a Reversible Markov Chain Burke s Theorem Queues in Tandem
35 Single-Server Queues in Tandem λ Poisson Station Station λ Customers arrive at queue according to Poisson process with rate λ. Service times exponential with mean /. i Assume service times of a customer in the two queues are independent. Assume ρ=λ/ i < i What is the oint stationary distribution of N and N number of customers in each queue? Result: in steady state the queues are independent and p n n p n p n n n (, ) = ( ρ ) ρ ( ρ ) ρ = ( ) ( )
36 Single-Server Queues in Tandem λ Poisson Station Station λ Q is a M/M/ queue. At steady state its departure process is Poisson with rate λ. Thus Q is also M/M/. Marginal stationary distributions: p n n = ρ ρ = p ( n ) = ( ρ ) ρ, n = 0,,... n ( ) ( ), n 0,,... To complete the proof: establish independence at steady state Q at steady state: at time t, N (t) is independent of departures prior to t, which are arrivals at Q up to t. Thus N (t) and N (t) independent: Letting t, the oint stationary distribution P{ N ( t) = n, N ( t) = n } = P{ N ( t) = n } P{ N ( t) = n } = p ( n ) P{ N ( t) = n } p( n, n ) = p ( n ) p ( n ) = ( ρ ) ρ ( ρ ) ρ n n
37 Queues in Tandem Theorem : Network consisting of K single-server queues in tandem. Service times at queue i exponential with rate, i independent of service times at any queue i. Arrivals at the first queue are Poisson with rate λ. The stationary distribution of the network is: K n p ( n, K, n ) = ( ρ ) ρ i, n = 0,,...; i =,..., K K i i i i= At steady state the queues are independent; the distribution of queue i is that of an isolated M/M/ queue with arrival and service rates λ and i n p ( n ) = ( ρ ) ρ i, n = 0,,... i i i i i Are the queues independent if not in steady state? Are stochastic processes {N (t)} and {N (t)} independent?
38 Queues in Tandem: State-Dependent Service Rates Theorem : Network consisting of K queues in tandem. Service times at queue i exponential with rate i (n i ) when there are n i customers in the queue independent of service times at any queue i. Arrivals at the first queue are Poisson with rate λ. The stationary distribution of the network is: K where {p i (n i )} is the stationary distribution of queue i in isolation with Poisson arrivals with rate λ Examples:./M/c and./m/ queues If queue i is./m/, then: p( n, K, n ) = p ( n ), n = 0,,...; i =,..., K K i i i i= ( λ / ) λ p n e n ni i / i i( i ) =, i = 0,,... ni!
39 Summary Time-Reversal of Markov Chains Reversibility Truncating a Reversible Markov Chain Multi-dimensional Markov chains Burke s Theorem Queues in Tandem
TCOM 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationMarkov Chain Model for ALOHA protocol
Markov Chain Model for ALOHA protocol Laila Daniel and Krishnan Narayanan April 22, 2012 Outline of the talk A Markov chain (MC) model for Slotted ALOHA Basic properties of Discrete-time Markov Chain Stability
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 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 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 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 informationT. Liggett Mathematics 171 Final Exam June 8, 2011
T. Liggett Mathematics 171 Final Exam June 8, 2011 1. The continuous time renewal chain X t has state space S = {0, 1, 2,...} and transition rates (i.e., Q matrix) given by q(n, n 1) = δ n and q(0, n)
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 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 informationExamination paper for TMA4265 Stochastic Processes
Department of Mathematical Sciences Examination paper for TMA4265 Stochastic Processes Academic contact during examination: Andrea Riebler Phone: 456 89 592 Examination date: December 14th, 2015 Examination
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 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 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 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 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 3 January 29, 2003 Prof. Yannis A. Korilis
TCOM 5: Networkig Theory & Fudametals Lecture 3 Jauary 29, 23 Prof. Yais A. Korilis 3-2 Topics Markov Chais Discrete-Time Markov Chais Calculatig Statioary Distributio Global Balace Equatios Detailed Balace
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 informationAdvanced Queueing Theory
Advanced Queueing Theory 1 Networks of queues (reversibility, output theorem, tandem networks, partial balance, product-form distribution, blocking, insensitivity, BCMP networks, mean-value analysis, Norton's
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 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 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 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 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 informationM/M/1 Retrial Queueing System with Negative. Arrival under Erlang-K Service by Matrix. Geometric Method
Applied Mathematical Sciences, Vol. 4, 21, no. 48, 2355-2367 M/M/1 Retrial Queueing System with Negative Arrival under Erlang-K Service by Matrix Geometric Method G. Ayyappan Pondicherry Engineering College,
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 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 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 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 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 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 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 informationLecture Notes 7 Random Processes. Markov Processes Markov Chains. Random Processes
Lecture Notes 7 Random Processes Definition IID Processes Bernoulli Process Binomial Counting Process Interarrival Time Process Markov Processes Markov Chains Classification of States Steady State Probabilities
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 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 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 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 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 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 informationBRAVO for QED Queues
1 BRAVO for QED Queues Yoni Nazarathy, The University of Queensland Joint work with Daryl J. Daley, The University of Melbourne, Johan van Leeuwaarden, EURANDOM, Eindhoven University of Technology. Applied
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 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 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 informationBirth and Death Processes. Birth and Death Processes. Linear Growth with Immigration. Limiting Behaviour for Birth and Death Processes
DTU Informatics 247 Stochastic Processes 6, October 27 Today: Limiting behaviour of birth and death processes Birth and death processes with absorbing states Finite state continuous time Markov chains
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 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 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 informationStructured Markov Chains
Structured Markov Chains Ivo Adan and Johan van Leeuwaarden Where innovation starts Book on Analysis of structured Markov processes (arxiv:1709.09060) I Basic methods Basic Markov processes Advanced Markov
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 informationProbability and Statistics Concepts
University of Central Florida Computer Science Division COT 5611 - Operating Systems. Spring 014 - dcm Probability and Statistics Concepts Random Variable: a rule that assigns a numerical value to each
More informationTMA4265 Stochastic processes ST2101 Stochastic simulation and modelling
Norwegian University of Science and Technology Department of Mathematical Sciences Page of 7 English Contact during examination: Øyvind Bakke Telephone: 73 9 8 26, 99 4 673 TMA426 Stochastic processes
More informationSTA 624 Practice Exam 2 Applied Stochastic Processes Spring, 2008
Name STA 624 Practice Exam 2 Applied Stochastic Processes Spring, 2008 There are five questions on this test. DO use calculators if you need them. And then a miracle occurs is not a valid answer. There
More informationA Study on Performance Analysis of Queuing System with Multiple Heterogeneous Servers
UNIVERSITY OF OKLAHOMA GENERAL EXAM REPORT A Study on Performance Analysis of Queuing System with Multiple Heterogeneous Servers Prepared by HUSNU SANER NARMAN husnu@ou.edu based on the papers 1) F. S.
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 informationInventory Ordering Control for a Retrial Service Facility System Semi- MDP
International Journal of Engineering Science Invention (IJESI) ISS (Online): 239 6734, ISS (Print): 239 6726 Volume 7 Issue 6 Ver I June 208 PP 4-20 Inventory Ordering Control for a Retrial Service Facility
More informationA Simple Memoryless Proof of the Capacity of the Exponential Server Timing Channel
A Simple Memoryless Proof of the Capacity of the Exponential Server iming Channel odd P. Coleman ECE Department Coordinated Science Laboratory University of Illinois colemant@illinois.edu Abstract his
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 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 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 informationDynamic Control of a Tandem Queueing System with Abandonments
Dynamic Control of a Tandem Queueing System with Abandonments Gabriel Zayas-Cabán 1 Jungui Xie 2 Linda V. Green 3 Mark E. Lewis 1 1 Cornell University Ithaca, NY 2 University of Science and Technology
More informationDeparture Processes of a Tandem Network
The 7th International Symposium on perations Research and Its Applications (ISRA 08) Lijiang, China, ctober 31 Novemver 3, 2008 Copyright 2008 RSC & APRC, pp. 98 103 Departure Processes of a Tandem Network
More informationMATH37012 Week 10. Dr Jonathan Bagley. Semester
MATH37012 Week 10 Dr Jonathan Bagley Semester 2-2018 2.18 a) Finding and µ j for a particular category of B.D. processes. Consider a process where the destination of the next transition is determined by
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 informationExercises Solutions. Automation IEA, LTH. Chapter 2 Manufacturing and process systems. Chapter 5 Discrete manufacturing problems
Exercises Solutions Note, that we have not formulated the answers for all the review questions. You will find the answers for many questions by reading and reflecting about the text in the book. Chapter
More informationStationary Analysis of a Multiserver queue with multiple working vacation and impatient customers
Available at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 932-9466 Vol. 2, Issue 2 (December 207), pp. 658 670 Applications and Applied Mathematics: An International Journal (AAM) Stationary Analysis of
More informationTwo Heterogeneous Servers Queueing-Inventory System with Sharing Finite Buffer and a Flexible Server
Two Heterogeneous Servers Queueing-Inventory System with Sharing Finite Buffer and a Flexible Server S. Jehoashan Kingsly 1, S. Padmasekaran and K. Jeganathan 3 1 Department of Mathematics, Adhiyamaan
More informationThe shortest queue problem
The shortest queue problem Ivo Adan March 19, 2002 1/40 queue 1 join the shortest queue queue 2 Where: Poisson arrivals with rate Exponential service times with mean 1/ 2/40 queue 1 queue 2 randomly assign
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 informationMultiserver Queueing Model subject to Single Exponential Vacation
Journal of Physics: Conference Series PAPER OPEN ACCESS Multiserver Queueing Model subject to Single Exponential Vacation To cite this article: K V Vijayashree B Janani 2018 J. Phys.: Conf. Ser. 1000 012129
More informationLIMITS FOR QUEUES AS THE WAITING ROOM GROWS. Bell Communications Research AT&T Bell Laboratories Red Bank, NJ Murray Hill, NJ 07974
LIMITS FOR QUEUES AS THE WAITING ROOM GROWS by Daniel P. Heyman Ward Whitt Bell Communications Research AT&T Bell Laboratories Red Bank, NJ 07701 Murray Hill, NJ 07974 May 11, 1988 ABSTRACT We study the
More informationSTABILIZATION OF AN OVERLOADED QUEUEING NETWORK USING MEASUREMENT-BASED ADMISSION CONTROL
First published in Journal of Applied Probability 43(1) c 2006 Applied Probability Trust STABILIZATION OF AN OVERLOADED QUEUEING NETWORK USING MEASUREMENT-BASED ADMISSION CONTROL LASSE LESKELÄ, Helsinki
More informationAnalysis of a tandem queueing model with GI service time at the first queue
nalysis of a tandem queueing model with GI service time at the first queue BSTRCT Zsolt Saffer Department of Telecommunications Budapest University of Technology and Economics, Budapest, Hungary safferzs@hitbmehu
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 informationFluid Models of Parallel Service Systems under FCFS
Fluid Models of Parallel Service Systems under FCFS Hanqin Zhang Business School, National University of Singapore Joint work with Yuval Nov and Gideon Weiss from The University of Haifa, Israel Queueing
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 informationMath 416 Lecture 11. Math 416 Lecture 16 Exam 2 next time
Math 416 Lecture 11 Math 416 Lecture 16 Exam 2 next time Birth and death processes, queueing theory In arrival processes, the state only jumps up. In a birth-death process, it can either jump up or down
More informationA Joining Shortest Queue with MAP Inputs
The Eighth International Symposium on Operations Research and Its Applications (ISORA 09) Zhangjiajie, China, September 20 22, 2009 Copyright 2009 ORSC & APORC, pp. 25 32 A Joining Shortest Queue with
More information