Performance Modelling of Computer Systems
|
|
- Matthew Jefferson
- 6 years ago
- Views:
Transcription
1 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 Systems Queueing Theory 1 / 30
2 Some Notable Infinite Series For any real x < 1, k=0 x k k! = ex, (1) x k = kx k = x 1 x, (2) x (1 x) 2. (3) Tribastone (IFI LMU) Performance Modelling of Computer Systems Queueing Theory 2 / 30
3 Birth-Death Processes Continuous-time Markov chain with states labelled 0, 1,..., k,... Jumps are only allowed between neighbouring states: State 0 may only make a transition to 1. A state k > 0 may make transitions to k 1 and k + 1. Population increases (births) happen at rate λ k > 0. Population decreases (deaths) happen at rate k > 0. Births and deaths are independent. Model assumptions P(exactly one birth in (t, t + t) X (t) = k) = λ k t + o( t), P(exactly zero births in (t, t + t) X (t) = k) = 1 λ k t + o( t), P(exactly one death in (t, t + t) X (t) = k) = k t + o( t), P(exactly zero deaths in (t, t + t) X (t) = k) = 1 k t + o( t). Tribastone (IFI LMU) Performance Modelling of Computer Systems Queueing Theory 3 / 30
4 Chapman-Kolmogorov Equations of Birth-Death Processes Denote By the law of total probability: p k (t) := P(X (t) = k), k 0. p 0 (t + t) = p 0 (t)(1 λ 0 t) + 1 p 1 (t) t + o( t), p k (t + t) = p k 1 (t)λ k 1 t + p k (t)(1 λ k t)(1 k t) Rearranging yields + p k+1 (t) k t + o( t) = p k 1 (t)λ k 1 t + p k (t) [ 1 k t λ k t + λ k k t 2] + p k+1 (t) k+1 t + o( t), for k > 0. p 0 (t + t) p 0 (t) = λ 0 p 0 (t) + 1 p 1 (t) + o( t), t t p k (t + t) p k (t) = λ k 1 p k 1 (t) (λ k + k )p k (t) t + k+1 p k+1 (t) + o( t), for k > 0. t Tribastone (IFI LMU) Performance Modelling of Computer Systems Queueing Theory 4 / 30
5 Chapman-Kolmogorov Equations of Birth-Death Processes p 0 (t + t) p 0 (t) = λ 0 p 0 (t) + 1 p 1 (t) + o( t), t t p k (t + t) p k (t) = λ k 1 p k 1 (t) (λ k + k )p k (t) t + k+1 p k+1 (t) + o( t), for k > 0. t Taking the limit t 0 yields dp 0 (t) = λ 0 p 0 (t) + 1 p 1 (t), dt dp k (t) = λ k 1 p k 1 (t) (λ k + k )p k (t) + k+1 p k+1 (t), k > 0. dt λ 0 λ 1 λ 2 λ k 1 λ k k k k+1 Tribastone (IFI LMU) Performance Modelling of Computer Systems Queueing Theory 5 / 30
6 A Generic Recursive Stationary Solution (1/2) λ 0 λ 1 λ 2 λ k 1 λ k k k k+1 dp 0 (t) = λ 0 p 0 (t) + 1 p 1 (t), dt dp k (t) = λ k 1 p k 1 (t) (λ k + k )p k (t) + k+1 p k+1 (t), k > 0. dt Setting dp k (t)/dt = 0 for all k 0 yields λ k 1 π k 1 (λ k + k )π k + k+1 π k+1 = 0, with λ i = i = 0 for all i < 0. Tribastone (IFI LMU) Performance Modelling of Computer Systems Queueing Theory 6 / 30
7 A Generic Recursive Stationary Solution (2/2) Rearranging λ k 1 π k 1 (λ k + k )π k + k+1 π k+1 = 0 gives Observe that λ k 1 π k 1 k π k = λ k π k k+1 π }{{ k+1. } g(k) g(k 1) = g(k), for all k, therefore g(k) must be constant with k. From dp 0 (t)/dt = 0 we get that g(k) = 0. Therefore, we obtain the recursive solution λ k π k+1 = π k = π k = π 0 k+1 k 1 λ i i+1 i=0 } {{ } product form type Question: How to compute π 0? 1 π 0 = 1 π k = 1 + k 1 i 0, k = 0, 1, 2,.... λ i i+1 Tribastone (IFI LMU) Performance Modelling of Computer Systems Queueing Theory 7 / 30
8 The Poisson Process Consider a pure-birth process with λ k = λ for k 0 and k = 0 for k > 0, and assume that p 0 (0) = 1 and p k (0) = 0 for all k > 0. The equations simplify to dp 0 (t) = λp 0 (t) dt dp k (t) = λp k 1 (t) λp k (t), k > 0. dt Solving the first equation p 0 (t) = e λt, by induction it is proven that p k (t) = e λt (λt) k, k 0. k! This is the Poisson process, a counting process with exponentially distributed increments with mean 1/λ. λ λ λ λ λ k Tribastone (IFI LMU) Performance Modelling of Computer Systems Queueing Theory 8 / 30
9 Properties of Poisson Process Mean: E[N(t)] = kp k (t) = k=0 = e λt k=0 k=0 k e λt (λt) k k! (λt) k (k 1)! = e λt k=0 (λt) k (k 1)! = e λt (λt) k (λt) = e λt (λt)e λt = λt. k! Variance: Var[N(t)] = λt. Memoryless property: P(N(s, s + t) = k) = (λt)k e λt, k! where N(s, s + t) is defined as the number of arrivals between s and s + t. Tribastone (IFI LMU) Performance Modelling of Computer Systems Queueing Theory 9 / 30
10 Why Are Poisson Processes Relevant? In addition to mathematical tractability, they model many phenomena: Arrivals of calls in a telephone network; Decay of radioactive elements (gamma-ray emissions); Army soldiers killed due to being kicked by their horses; 1 A large number of independent renewal processes will tend to a Poisson process. The birth-death process may be interpreted as a queueing system where increments (with rate λ) denote arrivals of request and decrements (with rate ) are related to services. It is denoted in Kendall notation as the M/M/1 system: Exponentially distributed interarrival times; Exponentially distributed services; Single-server system. 1 Kleinrock, Queueing Systems: Volume I Theory, Wiley Interscience, NY, Tribastone (IFI LMU) Performance Modelling of Computer Systems Queueing Theory 10 / 30
11 Kendall s Notation A queueing system is often denoted by A/B/C/X /Y /Z, where: A gives the distribution of interarrival times (e.g., M, E, G, D,... ); B gives the service time distribution; C gives the service multiplicity (1, 2,..., ); X gives the system capacity; Y gives the customer population; Z gives the queue discipline (i.e., FIFO, LIFO, RANDOM, etc.). Tribastone (IFI LMU) Performance Modelling of Computer Systems Queueing Theory 11 / 30
12 Stationary Distribution of the M/M/1 System (1/2) Consider again the equations of motion: dp 0 (t) = λp 0 (t) + p 1 (t), dt dp k (t) = λp k 1 (t) (λ + )p k (t) + p k+1 (t), k > 0. dt We look for a probability vector π = [π 0, π 1,..., π k,...] such that λπ 0 + π 1 = 0, λπ k 1 (λ + )π k + π k+1 = 0, k > 0, π i = 1. i=0 From the first equation, π 1 = (λ/)π 0. For k = 1, λπ 0 (λ + )π 1 + π 2 = 0, from which π 2 = (λ/ + 1)π 1 (λ/)π 0 = (λ/) 2 π 0. Tribastone (IFI LMU) Performance Modelling of Computer Systems Queueing Theory 12 / 30
13 Stationary Distribution of the M/M/1 System (2/2) By induction one can prove that π k = (λ/) k π 0, for k > 0. ) π 0 = 1 π k = 1 (λ/) k π 0 = π 0 (1 + (λ/) k = 1. If λ < then the series converges. Therefore π 0 = Setting ρ = λ/ we obtain λ/ 1 λ/ = 1 λ/. π k = ρ k (1 ρ), for all k > 0. Tribastone (IFI LMU) Performance Modelling of Computer Systems Queueing Theory 13 / 30
14 Performance Metrics for the M/M/1 Queue (1/2) Mean queue length: average number of customers in the system. L = kπ k = kρ k (1 ρ) = (1 ρ)ρ kρ k 1 k=0 = (1 ρ)ρ = (1 ρ)ρ d dρ k=0 d dρ ρk = (1 ρ)ρ d dρ k=0 [ ] ρ 1 ρ k=0 ρ k = (1 ρ)ρ 1 ρ + ρ (1 ρ) 2 = ρ (1 ρ). Utilisation: probability that the server is busy. Formally, it may be defined as the expected value of a function of the random variable that underlies the stationary distribution. { 0 if X = 0, u(x ) = 1 otherwise. U := E[u(X )] = ρ k (1 ρ) = 1 π 0 = ρ. Tribastone (IFI LMU) Performance Modelling of Computer Systems Queueing Theory 14 / 30
15 Performance Metrics for the M/M/1 Queue (2/2) Average response time. We invoke Little s law, which states that for a system in steady state L = λw, where: L is the average number of users in the system; λ is the steady-state rate of arrivals into the system (which is equal to the throughput, i.e., the steady-state rate of departures from the system); W is the average response time. In the M/M/1 queue, W = L/λ = ρ (1 ρ)λ = 1 (1 ρ) = 1 λ. Tribastone (IFI LMU) Performance Modelling of Computer Systems Queueing Theory 15 / 30
16 M/M/1 Performance, Pictorially L Tribastone (IFI LMU) Performance Modelling of Computer Systems Queueing Theory 16 / 30
17 The M/M/ System Service capacity is proportional to the number of customers in the system. λ λ λ λ λ λ k 1 k 2 3 (k 1) k λπ 0 = π 1 = π 1 = λ π 0 λπ 1 + π 1 = λπ 0 + 2π 2 = π 2 = 1 ( ) λ 2 π 0 2 By induction, π k = 1 k! (λ/)k π 0, k > 0. From the normalisation condition, ( ) [ 1 λ k ( ) ] 1 λ k ( ) 1 λ k 1=π 0 + π 0 =π =π 0 =π 0 e λ/ k! k! k! = π k = 1 k! k=0 ( ) λ k e λ/, k 0. Tribastone (IFI LMU) Performance Modelling of Computer Systems Queueing Theory 17 / 30
18 Performance of the M/M/ System Average queue length L = kπ k = k 1 ( ) λ k e λ/ = k 1 k! k! k=0 k=0 ( ) = e λ/ 1 λ k ( ) λ = e λ/ (k 1)! ( ) λ ( ) = e λ/ 1 λ n ( λ = e λ/ n! n=0 Average response time: W = 1/. Question: What is the utilisation? ( ) λ k e λ/ 1 (k 1)! ) e λ/ = λ. ( ) λ k 1 Tribastone (IFI LMU) Performance Modelling of Computer Systems Queueing Theory 18 / 30
19 The M/M/m System A multi-server system with finite capacity m. λ λ λ λ λ k min(m, 2) min(m, 3) min(m, k) min(m, k + 1) If in the k-th state there are fewer clients than servers then the balance equations are as in the M/M/ system, thus yielding π k = 1 «k λ π 0, for all 1 k m. k! In state m, λπ m 1 + mπ m+1 = mπ m + λπ m leads to: π m+1 = 1 + λ «π m λ m m πm 1 = 1 + λ ««m 1 λ π 0 λ «m 1 1 λ π 0 = m 1 + λ m m! «1 m! λ «m π 0 1 m! m (m 1)! «m λ π 0 = λ 1 m m! «m λ π 0 = 1 m «m+1 λ π 0. Tribastone (IFI LMU) Performance Modelling of Computer Systems Queueing Theory 19 / 30
20 The M/M/m System In general, it holds that ( ) 1 λ k π 0, 1 k m, k! π k = ( ) λ k ( ) 1 1 n m π 0, k > m, m! m from which one obtains [ π 0 = 1 + m 1 1 k! ( ) λ k + 1 m! ( ) ] 1 λ m 1. 1 λ/(m) Performance Measures [ (λ/) m ] W = (m 1)!(m λ) 2 π 0 + 1, [ (λ/) m ] λ L = (m 1)!(m λ) 2 π 0 + λ. Tribastone (IFI LMU) Performance Modelling of Computer Systems Queueing Theory 20 / 30
21 Comparison = M/M/1 M/M/2 M/M/ W X: 0.93 Y: Tribastone (IFI LMU) Performance Modelling of Computer Systems Queueing Theory 21 / 30
22 Finite Capacity: The M/M/1/K System π 0 + λ λ λ λ K K π k = π 0 + = π 0 = λπ 0 = π 1, λπ k + π k = λπ k 1 + π k+1, 0 < k < K, λπ K 1 = π K. ( ) λ k π k = π 0, k 0. [ K k=0 K ( λ ) k π 0 = π 0 K k=0 ( ) λ k = 1 ( ) ] 1 { λ k (1 λ/)/(1 (λ/) K+1 ) if λ, = 1/(K + 1) if λ =. Tribastone (IFI LMU) Performance Modelling of Computer Systems Queueing Theory 22 / 30
23 Performance Measures for the M/M/1/K System From λ λ λ λ K π 0 = ( 1 λ/ ) / ( 1 (λ/) K+1) and π k = and setting ρ = λ/, ( ) λ k π 0, k 0, 1 π 0 1 π K = 1 (1 ρ)/(1 ρk+1 ) 1 (1 ρ)ρ K /(1 ρ K+1 ) = (1 ρk+1 ) (1 ρ) (1 ρ K+1 ) (1 ρ)ρ K = ρ ρk+1 1 ρ K = ρ, which yields the relationship λ(1 π K ) = (1 π 0 ) [effective arrival rate = effective service rate]. Tribastone (IFI LMU) Performance Modelling of Computer Systems Queueing Theory 23 / 30
24 Measures as Rewards Consider the following function of a r.v. over the state space of the M/M/1/K system: { λ, if k K, X a (k) = 0, if k = K. Similarly, define E[X a ] = E[X s ] = K k=0 K 1 X a (k)π k = λ π k = λ(1 π K ). X s (k) = k=0 k=0 {, if k 0, 0, if k = 0. S K X s (k)π k = π k = (1 π 0 ) Tribastone (IFI LMU) Performance Modelling of Computer Systems Queueing Theory 24 / 30
25 Comparison K = 0.9 = 0.5 = K Tribastone (IFI LMU) Performance Modelling of Computer Systems Queueing Theory 25 / 30
26 The Erlang Distribution Exponential service phases in tandem Begin End Each phase is defined by a r.v. Y with pdf f Y (y) = e y, y 0. The total service time is given by X = Y + Y, which has pdf f X (x) = = + x 0 f Y (y)f Y (x y)dy e y e (x y) dy x = 2 e x dy = 2 xe x, x 0. X is called the Erlang-2 distribution (E 2 ). 0 Tribastone (IFI LMU) Performance Modelling of Computer Systems Queueing Theory 26 / 30
27 Properties of the Erlang Distribution Mean and Variance E[X ] = + 0 Var[X ] = 2/ 2. + xf X (x)dx = 2 x 2 e x dx = 2/, Compare now an exponentially distributed r.v. with rate and an Erlang distribution with phase Mean : 1/ Variance : 1/ 2 Mean : 1/ Variance : 1/2 2 Generalisation: the Erlang-r distribution Mean : r/ Variance : r/ 2 Tribastone (IFI LMU) Performance Modelling of Computer Systems Queueing Theory 27 / 30
28 Pdfs of Some Erlang Distributions Mean = r = 1 r = 5 r = 20 r = Tribastone (IFI LMU) Performance Modelling of Computer Systems Queueing Theory 28 / 30
29 The M/E r /1 System Features: Poisson arrivals; Erlang-distributed service with r phases: if a customer is currently served at phase i, 1 i r then no other customer may be served in any of the other phases; Single-server model. Model description: a state is described by the pair (k, i) where k denotes the number of customer in the system, including the one in service; i denotes the phase of service being received by the customer, 0 i r; i = 0 when the queue is empty. Tribastone (IFI LMU) Performance Modelling of Computer Systems Queueing Theory 29 / 30
30 State Transition Diagram for the M/E r /1 System (0, 0) λ r (1, 1) r r (1, 2) r (1, r) r λ λ λ r r (2, 1) (2, 2) (2, r) r λ λ λ r λ λ λ r r (k, 1) (k, 2) (k, r) r λ λ λ Analysis techniques: 1. Quasi-birth-death (QBD) form for the transition rate matrix a B 00 B B 10 A 1 A A 0 A 1 A 2 0 Q = 0 0 A 0 A 1 A A 0 A Using z-transforms b a W.J. Stewart. Probability, Markov Chains, Queues, and Simulation, 2009, Princeton University Press. b Kleinrock, Queueing Systems: Volume I Theory, Wiley Interscience, NY, Tribastone (IFI LMU) Performance Modelling of Computer Systems Queueing Theory 30 / 30
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 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 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 informationContinuous Time Processes
page 102 Chapter 7 Continuous Time Processes 7.1 Introduction In a continuous time stochastic process (with discrete state space), a change of state can occur at any time instant. The associated point
More informationQueueing 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 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 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 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 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 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 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 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 informationBIRTH DEATH PROCESSES AND QUEUEING SYSTEMS
BIRTH DEATH PROCESSES AND QUEUEING SYSTEMS Andrea Bobbio Anno Accademico 999-2000 Queueing Systems 2 Notation for Queueing Systems /λ mean time between arrivals S = /µ ρ = λ/µ N mean service time traffic
More informationLECTURE #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 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 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 informationLink Models for Packet Switching
Link Models for Packet Switching To begin our study of the performance of communications networks, we will study a model of a single link in a message switched network. The important feature of this model
More 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 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 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 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 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 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 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 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 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 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 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 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 informationExponential Distribution and Poisson Process
Exponential Distribution and Poisson Process Stochastic Processes - Lecture Notes Fatih Cavdur to accompany Introduction to Probability Models by Sheldon M. Ross Fall 215 Outline Introduction Exponential
More informationSimple queueing models
Simple queueing models c University of Bristol, 2012 1 M/M/1 queue This model describes a queue with a single server which serves customers in the order in which they arrive. Customer arrivals constitute
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 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 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 informationSystems Simulation Chapter 6: Queuing Models
Systems Simulation Chapter 6: Queuing Models Fatih Cavdur fatihcavdur@uludag.edu.tr April 2, 2014 Introduction Introduction Simulation is often used in the analysis of queuing models. A simple but typical
More 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 informationStochastic Models in Computer Science A Tutorial
Stochastic Models in Computer Science A Tutorial Dr. Snehanshu Saha Department of Computer Science PESIT BSC, Bengaluru WCI 2015 - August 10 to August 13 1 Introduction 2 Random Variable 3 Introduction
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 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 informationThe exponential distribution and the Poisson process
The exponential distribution and the Poisson process 1-1 Exponential Distribution: Basic Facts PDF f(t) = { λe λt, t 0 0, t < 0 CDF Pr{T t) = 0 t λe λu du = 1 e λt (t 0) Mean E[T] = 1 λ Variance Var[T]
More informationECE 313 Probability with Engineering Applications Fall 2000
Exponential random variables Exponential random variables arise in studies of waiting times, service times, etc X is called an exponential random variable with parameter λ if its pdf is given by f(u) =
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 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 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 informationRenewal theory and its applications
Renewal theory and its applications Stella Kapodistria and Jacques Resing September 11th, 212 ISP Definition of a Renewal process Renewal theory and its applications If we substitute the Exponentially
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 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 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 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 informationBulk input queue M [X] /M/1 Bulk service queue M/M [Y] /1 Erlangian queue M/E k /1
Advanced Markovian queues Bulk input queue M [X] /M/ Bulk service queue M/M [Y] / Erlangian queue M/E k / Bulk input queue M [X] /M/ Batch arrival, Poisson process, arrival rate λ number of customers in
More informationAll models are wrong / inaccurate, but some are useful. George Box (Wikipedia). wkc/course/part2.pdf
PART II (3) Continuous Time Markov Chains : Theory and Examples -Pure Birth Process with Constant Rates -Pure Death Process -More on Birth-and-Death Process -Statistical Equilibrium (4) Introduction to
More 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 informationChapter 2. Poisson Processes. Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan
Chapter 2. Poisson Processes Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan Outline Introduction to Poisson Processes Definition of arrival process Definition
More 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 informationPage 0 of 5 Final Examination Name. Closed book. 120 minutes. Cover page plus five pages of exam.
Final Examination Closed book. 120 minutes. Cover page plus five pages of exam. To receive full credit, show enough work to indicate your logic. Do not spend time calculating. You will receive full credit
More informationQueuing Theory. Queuing Theory. Fatih Cavdur April 27, 2015
Queuing Theory Fatih Cavdur fatihcavdur@uludag.edu.tr April 27, 2015 Introduction Introduction Simulation is often used in the analysis of queuing models. A simple but typical model is the single-server
More 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 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 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 informationλ λ λ In-class problems
In-class problems 1. Customers arrive at a single-service facility at a Poisson rate of 40 per hour. When two or fewer customers are present, a single attendant operates the facility, and the service time
More 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 informationNICTA Short Course. Network Analysis. Vijay Sivaraman. Day 1 Queueing Systems and Markov Chains. Network Analysis, 2008s2 1-1
NICTA Short Course Network Analysis Vijay Sivaraman Day 1 Queueing Systems and Markov Chains Network Analysis, 2008s2 1-1 Outline Why a short course on mathematical analysis? Limited current course offering
More 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 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 informationChapter 8 Queuing Theory Roanna Gee. W = average number of time a customer spends in the system.
8. Preliminaries L, L Q, W, W Q L = average number of customers in the system. L Q = average number of customers waiting in queue. W = average number of time a customer spends in the system. W Q = average
More 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 informationCS418 Operating Systems
CS418 Operating Systems Lecture 14 Queuing Analysis Textbook: Operating Systems by William Stallings 1 1. Why Queuing Analysis? If the system environment changes (like the number of users is doubled),
More 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 informationEE126: Probability and Random Processes
EE126: Probability and Random Processes Lecture 18: Poisson Process Abhay Parekh UC Berkeley March 17, 2011 1 1 Review 2 Poisson Process 2 Bernoulli Process An arrival process comprised of a sequence of
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 informationP (L d k = n). P (L(t) = n),
4 M/G/1 queue In the M/G/1 queue customers arrive according to a Poisson process with rate λ and they are treated in order of arrival The service times are independent and identically distributed with
More informationM/G/1 queues and Busy Cycle Analysis
queues and Busy Cycle Analysis John C.S. Lui Department of Computer Science & Engineering The Chinese University of Hong Kong www.cse.cuhk.edu.hk/ cslui John C.S. Lui (CUHK) Computer Systems Performance
More informationStationary remaining service time conditional on queue length
Stationary remaining service time conditional on queue length Karl Sigman Uri Yechiali October 7, 2006 Abstract In Mandelbaum and Yechiali (1979) a simple formula is derived for the expected stationary
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 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 informationStat410 Probability and Statistics II (F16)
Stat4 Probability and Statistics II (F6 Exponential, Poisson and Gamma Suppose on average every /λ hours, a Stochastic train arrives at the Random station. Further we assume the waiting time between two
More informationAssignment 3 with Reference Solutions
Assignment 3 with Reference Solutions Exercise 3.: Poisson Process Given are k independent sources s i of jobs as shown in the figure below. The interarrival time between jobs for each source is exponentially
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 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 informationChapter 5: Special Types of Queuing Models
Chapter 5: Special Types of Queuing Models Some General Queueing Models Discouraged Arrivals Impatient Arrivals Bulk Service and Bulk Arrivals OR37-Dr.Khalid Al-Nowibet 1 5.1 General Queueing Models 1.
More 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 informationRenewal processes and Queues
Renewal processes and Queues Last updated by Serik Sagitov: May 6, 213 Abstract This Stochastic Processes course is based on the book Probabilities and Random Processes by Geoffrey Grimmett and David Stirzaker.
More informationLecture 4a: Continuous-Time Markov Chain Models
Lecture 4a: Continuous-Time Markov Chain Models Continuous-time Markov chains are stochastic processes whose time is continuous, t [0, ), but the random variables are discrete. Prominent examples of continuous-time
More 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 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 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 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 informationSystem Simulation Part II: Mathematical and Statistical Models Chapter 5: Statistical Models
System Simulation Part II: Mathematical and Statistical Models Chapter 5: Statistical Models Fatih Cavdur fatihcavdur@uludag.edu.tr March 20, 2012 Introduction Introduction The world of the model-builder
More informationClassification of Queuing Models
Classification of Queuing Models Generally Queuing models may be completely specified in the following symbol form:(a/b/c):(d/e)where a = Probability law for the arrival(or inter arrival)time, b = Probability
More 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 informationTHE QUEEN S UNIVERSITY OF BELFAST
THE QUEEN S UNIVERSITY OF BELFAST 0SOR20 Level 2 Examination Statistics and Operational Research 20 Probability and Distribution Theory Wednesday 4 August 2002 2.30 pm 5.30 pm Examiners { Professor R M
More informationMultiaccess Problem. How to let distributed users (efficiently) share a single broadcast channel? How to form a queue for distributed users?
Multiaccess Problem How to let distributed users (efficiently) share a single broadcast channel? How to form a queue for distributed users? z The protocols we used to solve this multiaccess problem are
More 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 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 informationSTAT 380 Markov Chains
STAT 380 Markov Chains Richard Lockhart Simon Fraser University Spring 2016 Richard Lockhart (Simon Fraser University) STAT 380 Markov Chains Spring 2016 1 / 38 1/41 PoissonProcesses.pdf (#2) Poisson Processes
More informationComputer Systems Modelling
Computer Systems Modelling Computer Laboratory Computer Science Tripos, Part II Lent Term 2010/11 R. J. Gibbens Problem sheet William Gates Building 15 JJ Thomson Avenue Cambridge CB3 0FD http://www.cl.cam.ac.uk/
More informationChapter 5. Statistical Models in Simulations 5.1. Prof. Dr. Mesut Güneş Ch. 5 Statistical Models in Simulations
Chapter 5 Statistical Models in Simulations 5.1 Contents Basic Probability Theory Concepts Discrete Distributions Continuous Distributions Poisson Process Empirical Distributions Useful Statistical Models
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 informationComputer Systems Modelling
Computer Systems Modelling Computer Laboratory Computer Science Tripos, Part II Michaelmas Term 2003 R. J. Gibbens Problem sheet William Gates Building JJ Thomson Avenue Cambridge CB3 0FD http://www.cl.cam.ac.uk/
More information