Queueing Networks and Insensitivity
|
|
- Mervin George
- 5 years ago
- Views:
Transcription
1 Lukáš Adam / 40
2 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 Arrival Theorem 2 / 40
3 Reminder Birth death process M/M/1 One type of customer One node 3 / 40
4 Jackson networks Series of K nodes, not necessarily linear. Arrivals from external sources are independent Poisson processes with intensities α 1,..., α K. A customer having completed service at node k goes to node l with probability γ kl and leaves the system with probability γ k0. A single exponential server at each node with corresponding service rates δ 1,..., δ K. 4 / 40
5 Closed and open networks Closed network No external inflow of outflow of customers. The number of customers in the network is constant. α k = 0, γ k0 = 0. Open network Opposite to closed network. At least one external inflow α k is nonzero. At least one probability of external outflow γ k0 is nonzero. 5 / 40
6 Examples 6 / 40
7 Proposition Some propositions Any ergodic birth-death process is time reversible. Definition Consider now a doubly infinite stationary version {X t } <t< and define X t = X t = lim s t X s. Then a departure for {X t } at time s corresponds to an arrival for X t at time s. Proposition If the queue is either ergodic birth-death queue with Poisson arrivals or stationary M/G/ queue, then the departure is a Poisson process. 7 / 40
8 Arrivals are Poisson by assumption, thus the departures are Poisson as well. Departures from a node form arrivals to another node. Denote X (k) t number of customers at node k at time t, X t = (X (1) t,..., X (K) t ) and various states n = n 1... n K. Possible evolution of n n n kl n ( ) k n (+) k with intensities on the right hand side. δ k γ kl δ k γ k0 α k 8 / 40
9 Traffic equations Throughput rate β k, the common rate of the input and output processes. The input rate is the sum of rate from external arrivals and arrivals from other nodes. The external rate is α k. Rate from node l to k is equal to β l γ lk. Traffic equations β k = α k + K β l γ lk. l=1 9 / 40
10 Open networks Assumptions Every node k may receive external input, thus either α k > 0 or α k1 γ k1k 2... γ kn 1k n γ knk > 0. Every node k may produce external ouput, thus either γ k0 > 0 or γ kk1... γ kn 1k n γ kn0 > 0 These conditions imply irreducibility. Proposition Traffic equations have unique nonnegative solution, which is moreover positive. 10 / 40
11 Theorem Assume that ρ k = β k δ k < 1 for all k. Then {X t } is ergodic with stationary distribution K π n = π n1...n K = (1 ρ k )ρ n k k=1 11 / 40
12 Closed networks Constant state space E = {n; k n k = N}. Traffic equations simplify to β = βγ, where Γ = (γ kl ) kl 0. Theorem If Γ is irreducible, then {X t } is ergodic with stationary distribution π N = K k=1 ρ n k k. 12 / 40
13 Limiting state for closed networks Assume ρ 1 = 1, ρ 2 < 1,..., ρ K < 1. Define η (N) n = P e (X (1) t = n) = n 2+ +n K =N n π nn2...n K θ n (N) 2...n K = P e (X (2) t = n 2,..., X (K) t = n K ) = π n1n 2...n K Theorem Taking the limit N we obtain η (N) n 0 K (1 ρ k )ρ n k θ (N) n 2...n K k=2 k. 13 / 40
14 Example For high enough N to maximize θ n (N) 2...n K hence to minimize n k. means to maximize ρ n k k, In the limiting case the longest queue should be at the node with highest ρ k. Example with K = 3, ρ 1 = 1, ρ 2 = ρ 3 = 1 2. k=0 1 2 k+1 (k + 1) = P e (X (1) t N 3) / 40
15 Erlang s Loss System K lines with intensity of arrivals β. Duration of a call follows a phasetype distribution B with p phases, initial vector α and phase generator T. Then the exit rate vector is t = T 1. State space E = {i = n 1... n p ; n k {0,..., K}, i = n n p K}, where n k gives the number of lines where the call is currently being handled in phase k. Possible evolution of i i i rs i r ( ) i (+) r n r t rs n r t r βα r 15 / 40
16 Loss probability Theorem Let µ B = αt 1 1 denote the mean of B and let η = βµ B. Then E K = n 1 + +n p=k π n1...n p = η K K! ηk K! 16 / 40
17 Quasi-Reversibility and Single-Node Symmetric Queues Simple queue (K = 1) with multiple customer classes c C, which is of finite or countable number. Assumptions The time evolution of the queue can be modelled by an ergodic Markov process {X t } with a finite or countable state space E. There are A c, D c E E such that i j when ij A c D c and that A c D c =. Interpretation X t = i, X t = j corresponds to an arrival of a customer of class c when ij A c and to a departure when ij D c. Usually ij A c if and only if ji D c. 17 / 40
18 Example State space E = {i = c 1... c n ; n N, c k C}. X t = c 1... c n means that there are n customers in the system. Customer of the type c 1 is being served, the first one in the queue is of type c 2 and so on. ij A c if and only if i = c 1... c n and j = c 1... c n c. Similar for ij D c. 18 / 40
19 Quasi reversibility Definition Define random sets N (+) c (t) = {s t; X s X s A c } the arrival process of class c customers after time t and N ( ) c (t) = {0 s t; X s X s D c } the departure prior to time t. Then the the queue is called quasi-reversible if X t and all N c (+) (t) and N c ( ) (t) are independent in the steady state for any t / 40
20 Proposition For a stationary quasi reversible queue, the arrival processes N c (+) (0), c C are independent Poisson processes, and so are the departure processes N c ( ) ( ), c C. Proposition The timereverse { X (t)} of a quasi reversible queue is itself quasi reversible corresponding to à c = {ij; ji D c } and D c = {ij; ji A c }. 20 / 40
21 Conditions for quasi reversibility Proposition For a stationary quasi reversible queue, the rates µ (+) c N c (+) (0) and N c ( ) ( ) are given by µ (+) c = j;ij A c λ(i, j) µ ( ) c = 1 π j i;ij D c π i λ(i, j). and µ ( ) c of In particular, the first right hand side does not depend on i and the second one on j. Proposition If the nondepandance of the right hand sides is fulfilled, then the queue is quasi reversible. 21 / 40
22 Example Consider a single classed queue modelled by a birth death process. A = {01, 12,... }, B = {10, 21,... }. In order for the queue to be quasi reversible it is necessary and sufficent that β N = β. j;ij A c λ(i, j) = β i 1 π j i;ij D c π i λ(i, j) = 1 π j π j+1 δ j+1 and use local balance equation π j β j = π j+1 δ j+1 to obtain only β i. 22 / 40
23 Example: multiclass M/M/1 queue Let β = c C β c denote the overall arrival rate, assume tha β < and δ c = δ and denote by p c = βc β the probability that an arriving customer is of class c and the traffic intensity is ρ = β δ. The goal is to corfirm that π c1...c n = (1 ρ)ρ n p c1... p cn is a stationary distribution and based on this to prove the quasi reversibility of the queue. Lemma (Kelly) Let Λ and Λ be nonexplosive intensity matrices and π a distribution such that π i λ(i, j) = π j λ (j, i). Then Λ and Λ are ergodic with stationary distribution π for both, and further Λ coincides with the intensity matrix of the time-reversed process { X t }. 23 / 40
24 Λ has only two positive members on every row λ(c 1... c n c, c 1... c n ) = δ λ(c 1... c n, cc 1... c n ) = β c We need to verify that π i λ(i, j) = π j λ(j, i). It is necessary to check two cases. We will show only the first one The stationarity is proven. π i λ(i, j) π j λ(j, i) = π iβ c pi j δ = 1 ρp c β c δ = β ρδ = / 40
25 For the quasi reversibility consider again 1 π j π i λ(i, j) = 1 π j+c δ = ρ p c δ = ρδ = β π j i;ij D c c C c C And the second condition j;ij A c λ(i, j) = β. Hence the system is quasi reversible by one of the previous propositions. 25 / 40
26 More general model Assume that different customer classes have independent Poisson arrivals with rate β c and let β = c C β c denote the overall arrival rate and assume β <. Assume further that class c customers have a phase type service time distribution B c with initial vector α c = (α cr ) r=1,...,pc and phase generator T c = (t crs ) Then the exit rate vector is t c = T c 1 = (t cr ), the mean service time is m c = α c Tc 1 1 and the overall traffic intensity is ρ = c C ρ c, where ρ c = β c m c. Define ν c as the equilibrium distribution of the phase of service of a class c customer and p cr as the probability that a randomly selected customer in service is of class c and in phase r of service ν c = (ν cr ) = α ctc 1 m c, p cr = β cm c ρ ν cr 26 / 40
27 A state of the system has the form i = c 1 r 1... c n r n, which means, where are n = n(i) customers. Customer k is of class c k and in phase r k. Server works ar rate φ(n) depending on the number of customers in the system, devoting ω(n, k) of its capacity to customer k. Thus ω(n, k) = 1. k Customers arriving to a system with n customers take position k {1,..., n + 1} with probability ω(n + 1, k) independently of their class. Upon their arrival, their current phase is chosen based on α c. Thus, ω has two functions, both position allocation and service allocation. This coined the term symmetric to this type of queue. 27 / 40
28 Main theorem Theorem Let Φ(n) = n φ(k), δ = k=1 n=0 ρ n Φ(n). If δ <, then the symmetric multiclass M/PH/ queue is ergodic and the stationary distribution is given by ρn π i = π c1 r 1...c nr n = δ 1 Φ(n) n p ck r k. k=1 Further the queue is quasi-reversible with µ (+) c = µ ( ) c. 28 / 40
29 Proof of the theorem Similar as in the multiclass M/M/1 queue. First it is necessary to compute transition matrix, the rightmost column giving the intensities i(k, s) φ(n)ω(n, k)t ck r k s i = c 1 r 1... c n r n i(k) φ(n)ω(n, k)t ck r k i(k, c, r) β c ω(n + 1, k)α cr. First case: customer k changes phase from r k from s. Second case: customer k leaves the queue. Third case: a new customer of class c in phase r arrives at position k. For arrivals and departures we get A c = {ij; j = i(k, c, r) for some k, c, r} D c = {ij; j = i(k) for some k}. 29 / 40
30 Lemma Sufficient criteria for a process to be nonexplosive are either of 1 sup i E λ(i) < 2 E is finite 3 {Y n } is recurrent. By the previous lemma we obtain nonexplosivity and may use Kelly s lemma. Hence, we need to prove that π i λ(i, j) = π j λ(j, i). 30 / 40
31 The reversed parameters are α cr = m c t cr ν cr t crs = ν cst csr t cr = ν cr α cr m c ν cr, which was shown in the previous presentation (III.5.7). Again, we need to check three cases, j = i(k, s), j = i(k) and j = i(k, c, r). First case Second case π i λ(i, j) π j λ(j, i) = ν c k r k t ck r k s = 1. ν ck s t ck sr k π i λ(i, j) π j λ(j, i) = ρ c k ν ck r k φ(n)ω(n, k)t ck r k = ρ c k = 1. φ(n) β ck ω(n, k) α ck r k β ck m k 31 / 40
32 Third case follows from the second one by interchanging the given system and the tilded one. We verified that π i is a stationary distribution. To verify quasi reversibility one could compute λ(i, j) = λ(i, i(k, c, s)) = = β j;ij A c k,c,s By symmetry the same relationship holds for tilded system, which is the same as the second condtition, which needs to be verified. 32 / 40
33 Examples Multiclass preemptive LIFO M/PH/1 queues. This corresponds to φ(n) = 1, ω(n, 1) = 1, all other ω(n, k) = 0. Multiclass PS (processor sharing) M/PH/1 queues. This corresponds to φ(n) = 1 and all ω(n, k) = 1 n. Multiclass M/PH/ queues. This corresponds to φ(n) = n and all ω(n, k) = 1 n. 33 / 40
34 Quasi-Reversibility in Networks Similar to Jackson networks with the addition of customer classes. K nodes, E (k) state space, A (k) c and D c (k) disjoint classes of transitions that we think of as arrivals and departures. Arrivals at node k are independent Poisson with intensities α kc. Probability of departures to different nodes are γ kc,ld, hence the customer class may change, and the probability of leaving the system is γ kc,0 = 1 l,d γ kc,ld. 34 / 40
35 Example Example, which shows the superiority over Jackson networks. Customer wants to select one of the possible routes R 1, R 2,... with probability q(r r ). After choosing, the class is the set of nodes c = l 1... l t to visit. Upon leaving the first node, the customer class changes to reflect this and becomes only l 2... l t, thus otherwise γ kc,ld = 0. γ l1(l 1...l t),l 2(l 2...l t) = 1, 35 / 40
36 Traffic equations Traffic equations are similar to the Jackson network case β kc = α kc + l,d β ld γ ld,kc. Assume existence, uniqueness is not required. Assume further that the ergodic intensity matrix (λ (k) (i, j)) ij with stationary distribution say (π (k) i ) i E (k), such that the corresponding Markov process on E (k) is quasi-reversible. The state space E = K k=1 E (k). 36 / 40
37 Stationary distribution The derivation method is the same as in previous cases. There are four possible cases, which may happen New customer arrives to the system. A customer leaves the system. A customer changes the node, but keeps his class. A customer changes the node and his class. Theorem The network of quasi-reversible nodes is ergodic with stationary distribution of product form π i = π i1...i K = π (1) i 1... π (K) i K. 37 / 40
38 PASTA property In a singlenode queue with Poisson arrivals, the PASTA property to be formalized in VII.6 implies that the steady-state distribution of the state of the queue seen by a customer just before his arrival is the same as the steady-state distribution of the state of the queue at an arbitrary point of time. We will show here that results of rather similar form hold for networks. In the network we have considered, a customer going to node l after being served at node k does so instantaneously. However, we may imagine that he observes the state of the rest of the network during the infinitesimal interval where the transition takes place. Typically, these transition instants do not form a Poisson process so PASTA does not apply. Nevertheless, we will show here that results of rather similar form hold. 38 / 40
39 Theorems Theorem In the model of previous section, the steadystate distribution η kc,ld of the state seen by a customer in transition from node k as a class c customer to node l as a class d customer coincides with the time-stationary distribution π. Proposition Let H = {kc} and K = {ld} be arbitrary subsets of {0,..., K} C. Then the steady-state distribution of a H customer in transition to become a K customer is π. 39 / 40
40 Theorem For a closed Jackson network with N customers, the steady-state distribution η N;kl of the state seen by a customer in transition from node k to node l coincides with the time-stationary distribution π N 1 of the network with one customer removed. That is, η N;kl n = C N 1 K m=1 ρ nm m when n n K = N / 40
Statistics 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 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 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 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 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 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 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 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 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 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 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 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 informationM/M/3/3 AND M/M/4/4 RETRIAL QUEUES. Tuan Phung-Duc, Hiroyuki Masuyama, Shoji Kasahara and Yutaka Takahashi
JOURNAL OF INDUSTRIAL AND doi:10.3934/imo.2009.5.431 MANAGEMENT OPTIMIZATION Volume 5, Number 3, August 2009 pp. 431 451 M/M/3/3 AND M/M/4/4 RETRIAL QUEUES Tuan Phung-Duc, Hiroyuki Masuyama, Shoi Kasahara
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationOther properties of M M 1
Other properties of M M 1 Přemysl Bejda premyslbejda@gmail.com 2012 Contents 1 Reflected Lévy Process 2 Time dependent properties of M M 1 3 Waiting times and queue disciplines in M M 1 Contents 1 Reflected
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 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 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 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 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 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 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 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 informationModel reversibility of a two dimensional reflecting random walk and its application to queueing network
arxiv:1312.2746v2 [math.pr] 11 Dec 2013 Model reversibility of a two dimensional reflecting random walk and its application to queueing network Masahiro Kobayashi, Masakiyo Miyazawa and Hiroshi Shimizu
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 informationStability of queueing networks. Maury Bramson. University of Minnesota
Probability Surveys Vol. 5 (2008) 169 345 ISSN: 1549-5787 DOI: 10.1214/08-PS137 Stability of queueing networks Received June 2008. Maury Bramson University of Minnesota e-mail: bramson@math.umn.edu Contents
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 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 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 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 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 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 informationStability and Heavy Traffic Limits for Queueing Networks
Maury Bramson University of Minnesota Stability and Heavy Traffic Limits for Queueing Networks May 15, 2006 Springer Berlin Heidelberg New York Hong Kong London Milan Paris Tokyo Contents 1 Introduction...............................................
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 informationCongestion In Large Balanced Fair Links
Congestion In Large Balanced Fair Links Thomas Bonald (Telecom Paris-Tech), Jean-Paul Haddad (Ernst and Young) and Ravi R. Mazumdar (Waterloo) ITC 2011, San Francisco Introduction File transfers compose
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 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 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 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 informationHITTING TIME IN AN ERLANG LOSS SYSTEM
Probability in the Engineering and Informational Sciences, 16, 2002, 167 184+ Printed in the U+S+A+ HITTING TIME IN AN ERLANG LOSS SYSTEM SHELDON M. ROSS Department of Industrial Engineering and Operations
More informationInput-queued switches: Scheduling algorithms for a crossbar switch. EE 384X Packet Switch Architectures 1
Input-queued switches: Scheduling algorithms for a crossbar switch EE 84X Packet Switch Architectures Overview Today s lecture - the input-buffered switch architecture - the head-of-line blocking phenomenon
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 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 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 informationErgodic Theorems. Samy Tindel. Purdue University. Probability Theory 2 - MA 539. Taken from Probability: Theory and examples by R.
Ergodic Theorems Samy Tindel Purdue University Probability Theory 2 - MA 539 Taken from Probability: Theory and examples by R. Durrett Samy T. Ergodic theorems Probability Theory 1 / 92 Outline 1 Definitions
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 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 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 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 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 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 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 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 informationLIMITING PROBABILITY TRANSITION MATRIX OF A CONDENSED FIBONACCI TREE
International Journal of Applied Mathematics Volume 31 No. 18, 41-49 ISSN: 1311-178 (printed version); ISSN: 1314-86 (on-line version) doi: http://dx.doi.org/1.173/ijam.v31i.6 LIMITING PROBABILITY TRANSITION
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 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 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 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 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 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 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 informationMarkov Chains Handout for Stat 110
Markov Chains Handout for Stat 0 Prof. Joe Blitzstein (Harvard Statistics Department) Introduction Markov chains were first introduced in 906 by Andrey Markov, with the goal of showing that the Law of
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 informationDerivation of Formulas by Queueing Theory
Appendices Spectrum Requirement Planning in Wireless Communications: Model and Methodology for IMT-Advanced E dite d by H. Takagi and B. H. Walke 2008 J ohn Wiley & Sons, L td. ISBN: 978-0-470-98647-9
More informationNATCOR: Stochastic Modelling
NATCOR: Stochastic Modelling Queueing Theory II Chris Kirkbride Management Science 2017 Overview of Today s Sessions I Introduction to Queueing Modelling II Multiclass Queueing Models III Queueing Control
More 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 informationTechnical Appendix for: When Promotions Meet Operations: Cross-Selling and Its Effect on Call-Center Performance
Technical Appendix for: When Promotions Meet Operations: Cross-Selling and Its Effect on Call-Center Performance In this technical appendix we provide proofs for the various results stated in the manuscript
More informationStochastic models in product form: the (E)RCAT methodology
Stochastic models in product form: the (E)RCAT methodology 1 Maria Grazia Vigliotti 2 1 Dipartimento di Informatica Università Ca Foscari di Venezia 2 Department of Computing Imperial College London Second
More informationStochastic Processes. Theory for Applications. Robert G. Gallager CAMBRIDGE UNIVERSITY PRESS
Stochastic Processes Theory for Applications Robert G. Gallager CAMBRIDGE UNIVERSITY PRESS Contents Preface page xv Swgg&sfzoMj ybr zmjfr%cforj owf fmdy xix Acknowledgements xxi 1 Introduction and review
More information(K + L)(c x) = K(c x) + L(c x) (def of K + L) = K( x) + K( y) + L( x) + L( y) (K, L are linear) = (K L)( x) + (K L)( y).
Exercise 71 We have L( x) = x 1 L( v 1 ) + x 2 L( v 2 ) + + x n L( v n ) n = x i (a 1i w 1 + a 2i w 2 + + a mi w m ) i=1 ( n ) ( n ) ( n ) = x i a 1i w 1 + x i a 2i w 2 + + x i a mi w m i=1 Therefore y
More informationMarkov Chains and Stochastic Sampling
Part I Markov Chains and Stochastic Sampling 1 Markov Chains and Random Walks on Graphs 1.1 Structure of Finite Markov Chains We shall only consider Markov chains with a finite, but usually very large,
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 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 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 informationOverload Analysis of the PH/PH/1/K Queue and the Queue of M/G/1/K Type with Very Large K
Overload Analysis of the PH/PH/1/K Queue and the Queue of M/G/1/K Type with Very Large K Attahiru Sule Alfa Department of Mechanical and Industrial Engineering University of Manitoba Winnipeg, Manitoba
More informationDynamic resource sharing
J. Virtamo 38.34 Teletraffic Theory / Dynamic resource sharing and balanced fairness Dynamic resource sharing In previous lectures we have studied different notions of fair resource sharing. Our focus
More informationQuality of Real-Time Streaming in Wireless Cellular Networks : Stochastic Modeling and Analysis
Quality of Real-Time Streaming in Wireless Cellular Networs : Stochastic Modeling and Analysis B. Blaszczyszyn, M. Jovanovic and M. K. Karray Based on paper [1] WiOpt/WiVid Mai 16th, 2014 Outline Introduction
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 informationRouting and Staffing in Large-Scale Service Systems: The Case of Homogeneous Impatient Customers and Heterogeneous Servers 1
Routing and Staffing in Large-Scale Service Systems: The Case of Homogeneous Impatient Customers and Heterogeneous Servers 1 Mor Armony 2 Avishai Mandelbaum 3 June 25, 2008 Abstract Motivated by call centers,
More informationInformation Theory and Statistics Lecture 3: Stationary ergodic processes
Information Theory and Statistics Lecture 3: Stationary ergodic processes Łukasz Dębowski ldebowsk@ipipan.waw.pl Ph. D. Programme 2013/2014 Measurable space Definition (measurable space) Measurable space
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 information