M/G/1 and M/G/1/K systems
|
|
- Bernice Clark
- 5 years ago
- Views:
Transcription
1 M/G/1 and M/G/1/K systems Dmitri A. Moltchanov
2 OUTLINE: Description of M/G/1 system; Methods of analysis; Residual life approach; Imbedded Markov chain approach. Lecture: M/G/1 and M/G/1/K systems: part I 2
3 1. Description of M/G/1 queuing system M/G/1 queuing system stands for: single server; infinite number of waiting positions; Poisson arrival process; interarrival times are exponentially distributed. generally distributed service times: practically, any distribution. What we also assume: first come, first served (FCFS); what it may affect: PDF or pdf of waiting time! Lecture: M/G/1 and M/G/1/K systems: part I 3
4 1.1. Arrival and service processes Arrival process: Poisson with parameter (mean value) λ interarrival times are exponential with mean 1/λ; CDF, pdf and LT are: A(t) = 1 e λt, a(t) = λe λt, A(s) = 0 a(t)e st dt = 0 λe λt e st dt = λ s + λ. (1) Service process: service times are arbitrary with mean 1/µ; PDF, pdf and LT are: B(t), b(t), B(s). (2) Lecture: M/G/1 and M/G/1/K systems: part I 4
5 2. Methods of analysis There are a number of methods: residual life approach: simple to understand: only mean values can be obtained. transform approach based on imbedded Markov chain: harder to deal with; distributions of desired performance parameters can be obtained; the idea: find points at which Markov property holds and use transforms. direct approach based on imbedded Markov chain: harder to deal with; distributions of desired performance parameters can be obtained; the idea: find points at which Markov property holds and use direct integration. method of supplementary variables: the most complicated one: distributions of desired performance parameters can be obtained; the idea: look at arbitrary points and make them Markovian. Lecture: M/G/1 and M/G/1/K systems: part I 5
6 3. Residual life approach: mean waiting time Note the following: we want to find mean queuing time (mean time spent waiting for service); no need to assume FCFS service discipline: service order does not influence mean waiting time; we have to require that the server does not stay idle when there are waiting customers; mean values are the same as for LCFS, RANDOM, PS.... Arrivals: 1 Service: 1 Figure 1: M/G/1 queuing system. Note: we are looking for E[W Q ]: mean waiting time in the buffer. Lecture: M/G/1 and M/G/1/K systems: part I 6
7 Consider arriving customer, we have two choice: customer arrives to non-empty system or; it arrives to empty system. When the customer arrives to non-empty system it finds: n q customers waiting in the buffer; customer which is currently in service: it has R residual service time left to complete its ongoing service; residual service time is the time required to complete the ongoing service. When the customer arrives to empty system: no customers waiting n q = 0; residual service time R is zero; customer can enter service immediately. Lecture: M/G/1 and M/G/1/K systems: part I 7
8 Let us denote: RV R be the RV of residual service time: in case of exponential service times R has exponential distribution. E[R] be it mean. Note the following: PASTA property holds for M/G/1 system; distribution that arrival sees is the same as time-averaged (at arbitrary time); using Little s result we have for the mean waiting time in the buffer, E[W Q ]: E[W Q ] = E[N Q ]E[X] + E[R]. (3) E[N Q ] - mean number of packets waiting in the buffer, E[X] mean service time; E[R] - mean residual service time. Using Little s result E[N Q ] = λe[w Q ] we get: E[W Q ] = λe[w Q ]E[X] + E[R]. (4) Lecture: M/G/1 and M/G/1/K systems: part I 8
9 Denoting ρ = λe[x] and solving for E[W Q ]: E[W Q ] = ρe[w Q ] + E[R], E[W Q ] = E[R] (1 ρ). (5) to find E[W ] we, therefore, have to find mean residual service time E[R]. in what follows we take graphical approach. r(ô) ô Figure 2: Residual service times. R jumps by the amount of service time X when a new customer enters the service; decreases until the customer completes service, duration is X; R = 0 when customer completes its service. Lecture: M/G/1 and M/G/1/K systems: part I 9
10 Time averaged of r(τ) in (0, t) is: E[r[0, t)] = 1 t t 0 r(τ)dτ. (6) Approximate previous equation by the following sum: E[r[0, t)] = 1 t t 0 r(τ)dτ 1 t M(t) X 2 /2 is the square of a service triangle, M(t) arrivals in (0, t). Note the following: we have an error in the last residual service time in [0, t); i=1 1 2 X2 i. (7) approximation becomes better as t (number of components increases!). Multiplying and dividing it by M(t) we get: E[r[0, t)] = M(t) t 1 1 M(t) 2 M(t) i=1 X 2 i. (8) Lecture: M/G/1 and M/G/1/K systems: part I 10
11 Consider the last equation when t we get: lim t lim t M(t) t M(t) λ M(t) i=1 X 2 i 1 2 E[X2 ]. (9) Therefore, we have the following expression for mean residual service time: E[R] = E[r] = 1 2 λe[x2 ], (10) Substituting this result in E[W ] = E[R]/(1 ρ) we get: this result is known as Pollaczek-Khinchine formula: they simultaneously got this result. E[W Q ] = λe[x2 ] 2(1 ρ). (11) Lecture: M/G/1 and M/G/1/K systems: part I 11
12 3.1. Performance parameters Mean time spent in the buffer: E[W Q ] Mean number of customers in the buffer: E[N Q ] Mean time spent in the system: E[W ] E[W Q ] = λe[x2 ] 2(1 ρ). (12) E[N Q ] = λe[w Q ] = λ2 E[X 2 ] 2(1 ρ). (13) E[W ] = E[W Q ] + E[X] = λe[x2 ] 2(1 ρ) Mean number of customers in the system: E[N Q ] + E[X]. (14) E[N] = E[W ]λ = λ2 E[X 2 ] 2(1 ρ) + ρ. (15) Lecture: M/G/1 and M/G/1/K systems: part I 12
13 4. Imbedded Markov chain Recall M/M/-/-/-: let N(t) be the number of customers at time t: we know how the system evolves in time after t in t; arrival may occur with probability λ t: it is independent from previous arrival: memoryless property (A 1 = A 2 )! departure may occur with rate µ t: it is independent from previous departure: memoryless property (D 1 = D 2 )! the resulting process is actually birth-death Markov one! A 1 (t)=a 2 (t) A 2 (t) t D 1 (t)=d 2 (t) D 2 (t) t Figure 3: State of M/M/1 queuing system. Lecture: M/G/1 and M/G/1/K systems: part I 13
14 4.1. Problem with M/G/1 queuing system Let S Q (t) be the number of customers at time t: do we know how the system evolves in time after t in t? arrival may occur with rate λ t: it is independent from previous arrival: memoryless property (A 1 = A 2 )! departure may occur with probability µ t: µ µ as D 2 is not the same as D 1! this process is no longer Markovian! A 1 (t) A 2 (t) t D 2 (t) D ( t) : D ( t) D ( t) t Figure 4: State of M/G/1 queuing system. Lecture: M/G/1 and M/G/1/K systems: part I 14
15 4.2. How to choose the state of M/G/1 system State of the system: M/G/1 queuing system number of customers in the system AND time since the service started: in this case we know how the system evolves in time; we know the distribution of time till the next arrival: it is the same as initial one; we know the distribution of time till the next departure: we track it: D(t + x x) = P r{(t t + x) T > x} = (D(t + x) D(x))/(1 D(x)). (16) t A( t) 1 e t t S ( ), 0,1,... Q t k k D( t x x) D( t x) D( x) 1 D( x) Figure 5: State of M/G/1 queuing system given by (S Q (t), D(t + x x)). Lecture: M/G/1 and M/G/1/K systems: part I 15
16 Are there any problems with such description? two complicated to deal with; we better prefer to avoid it if more simple description is available! State of the system: M/G/1 queuing system number of customers in the system at special time instants d + 1, d + 2,... : choose these instants such that we should not track time since previous service started; which instants: just after service completions as D(t + x x) = D(t) when x = 0! d 1 + A( t) 1 e t d 2 + x 0 D( t) D( t x) D( x) D( t 0) D(0) D( t x x) 0 1 D( x) 1 D(0) t S ( ), 0,1,... Q t k k Figure 6: State of M/G/1 queuing system. Lecture: M/G/1 and M/G/1/K systems: part I 16
17 4.3. Steady-state distribution as seen by departure Doe the following: consider Markov chain imbedded at t i, i = 1, 2,... when i th customer departs from the system; system state: number of customers at t i, i = 1, 2,... denoted by n i, i = 1, 2,... ; departing customer is not included in the system state! Time instant t i -... n i - = k Time instant t i +... n i + = k-1 Just departed at t i Figure 7: Time instants t i and t + i in M/G/1 queuing system. Lecture: M/G/1 and M/G/1/K systems: part I 17
18 Denote: a i+1 be the number of arrivals in (i + 1) th service time. a i+1 t i t i+1 x 0 ith departure D( t) t Figure 8: Arrivals in (i + 1) th service time. Consider time diagram of the system and distinguish between: i th departure leaves non-empty system: n i > 0; i th departure leaves empty system: n i = 0. Lecture: M/G/1 and M/G/1/K systems: part I 18
19 Consider the case when n i > 0. a i+1 arrivals in (i+1) th service time... (i+1) th service time t i th departure (system is not empty; (i+1) th departure (system may be empty may be not; n i >0 n i+1 = n i a i+1 Figure 9: Time diagram of the M/G/1 queuing system when n i > 0. In this case we have the following relation between n i and n i+1 : n i+1 = n i 1 + a i+1, n i = 1, 2,.... (17) Lecture: M/G/1 and M/G/1/K systems: part I 19
20 Consider the case when n i = 0. first arrival after empty period a i+1 arrivals in (i+1) th service time... (i+1) th service time t i th departure system is empty (i+1) th departure system may be empty may be not n i = 0 n i+1 = a i+1 Figure 10: Time diagram of the M/G/1 queuing system when n i = 0. In this case we have the following relation between n i and n i+1 : n i+1 = a i+1, n i = 0. (18) Lecture: M/G/1 and M/G/1/K systems: part I 20
21 Summarizing both cases (n i > 0 and n i = 0) we have: n i+1 = n i 1 + a i+1, n i = 1, 2,..., n i+1 = a i+1, n i = 0. (19) Introducing unit step function U(n i ) rewrite: n i+1 = n i U(n i ) + a i+1, n i = 0, 1,..., (20) where unit step function is given by U(n i ) = 1, n i = 1, 2,..., U(n i ) = 0, n i = 0. (21) this expressin gives us the idea how the system evolves between t i and t i+1 ; recall that t i, i = 0, 1,... are imbedded points of the Markov chain. GENERAL RELATION: n i+1 = n i U(n i ) + a i+1, n i = 0, 1,..., (22) Lecture: M/G/1 and M/G/1/K systems: part I 21
22 Consider imbedded Markov chain at steady-state t : let q ij, i, j = 0, 1,..., be transition probabilities of going from i to j; let a k the number of arrivals in the service time; q ik = α k, i = 0, k = 0, 1,..., q ik = α k i+1, i = 1, 2,..., k = i 1, i, i + 1,... (23) Figure 11: Transition probabilities of imbedded Markov chain at steady-state. Lecture: M/G/1 and M/G/1/K systems: part I 22
23 Observe that α k, k = 0, 1,... fully determine the Markov chain. departure k arrivals... service time departure t Figure 12: k arrivals in a service time. Arrivals come from Poisson process α k, k = 0, 1,..., we can get α k : α k = 0 (λx) k e λx b(x)dx, k = 0, 1,.... (24) k! Lecture: M/G/1 and M/G/1/K systems: part I 23
24 4.4. Transform approach vs. direct integration The difference is twofold: in the way we compute α k, k = 0, 1,... α k = 0 (λx) k e λx b(x)dx, k = 0, 1,.... (25) k! first term number of arrivals from Poisson process in time x (Erlang distribution); b(x) service time distribution equals to x; we integrate over all length of t: from 0 to. in the way we solve linear equations of the Markov chain asking Mathlab to do it for us; trying to get closed-form analytical solution. Let us define the following: q i, i = 0, 1,... : number of customers in the system just after departure; Lecture: M/G/1 and M/G/1/K systems: part I 24
25 4.5. Brute-force direct approach What we do: estimate α k directly via integration; use classic way to get steady-state solution for q i, i = 0, 1,... ; works when capacity is limited M/M/1/K. In vector/matrix form: q 00 q 01 q 02 q q 10 q 11 q 12 q qq = q : (q 0, q 1,... ) = (q 0, q 1,... ) 0 q 21 q 22 q q e = 1 : (q 0, q 1,... ) 1 = 1 (26). Lecture: M/G/1 and M/G/1/K systems: part I 25
26 4.6. Other steady-state distributions What we get: PF and moments of the number as seen by departure... Note: we are usually asked to get state distribution at arbitrary time! Let us define the following: p k, k = 0, 1,... : time-averaged (arbitrary time) steady-state distribution of states; a k, k = 0, 1,... : steady-state distribution of states as seen by arrival; d k, k = 0, 1,... : steady-state distribution of states as seen by departure. Question: how to find p k, k = 0, 1,...? Lecture: M/G/1 and M/G/1/K systems: part I 26
27 Two next results gives us a way to use this PF: Kleinrock s result (!!! remember it as well as PASTA): the following holds for those system when state can change at most ±1 in t 0: d k = a k,..., k = 0, 1,.... (27) PASTA property: the following holds when the arrival process is homogenous Poisson: a k = p k,..., k = 0, 1,.... (28) combining both we have for M/G/1 queuing system: a k = p k = d k,..., k = 0, 1,.... (29) What it gives: we obtained steady-state distribution at any instant of time; q k = a k facilitates derivation of waiting time CDF. Lecture: M/G/1 and M/G/1/K systems: part I 27
28 4.7. Performance parameters Mean time spent in the buffer: E[W Q ] Mean number of customers in the buffer: E[N Q ] Mean time spent in the system: E[W ] E[W Q ] = λe[x2 ] 2(1 ρ). (30) E[N Q ] = λe[w Q ] = λ2 E[X 2 ] 2(1 ρ). (31) E[W ] = E[W Q ] + E[X] = λe[x2 ] 2(1 ρ) Mean number of customers in the system: E[N Q ] + E[X]. (32) E[N] = E[W ]λ = λ2 E[X 2 ] 2(1 ρ) + ρ. (33) Lecture: M/G/1 and M/G/1/K systems: part I 28
29 5. Transform approach Consider n i+1 = n i U(n i ) + a i+1 and take means of both sides to get: E[n i+1 ] = E[n i ] E[U(n i )] + E[a i+1 ]. (34) Since we consider the system at steady-state E[n i+1 ] = E[n i ] = E[n]: E[U(n i )] = E[a i+1 ]. (35) Note the following: assuming that the system is empty with probability d 0 we have: E[U(n i )] = 1 d 0. (36) mean number of arrivals in (i + 1) th service time is given by: E[a i+1 ] = 0 λtb(t)dt = λe[x] = ρ. (37) Therefore, in the steady-state we have: d 0 = 1 ρ. (38) Lecture: M/G/1 and M/G/1/K systems: part I 29
30 Introduce PGFs of n i and n i+1 : P i (z) = E[z n i ] = z k P r{n i = k}, k=0 P i+1 (z) = E[z n i+1 ] = z k P r{n i+1 = k}. (39) Considering n i+1 = n i U(n i ) + a i+1 as the sum of RVs n i U(n i ) and a i+1 : To simplify it, consider the following: k=0 P i+1 (z) = E[z n i U(n i ) ]E[z a i+1 ]. (40) since we consider system at steady-state we can drop subscripts i and write: P (z) = E[z n U(n) ]E[z a ]. (41) defining PGF of number of arriving customers in service time by A(z) = E[z a ], then: A(z) = 0 E[z a X = t]b(t)dt = 0 z n (λt)n e λt b(t)dt = n! 0 e λt(1 z) b(t)dt. (42) Lecture: M/G/1 and M/G/1/K systems: part I 30
31 Rewrite the last result as: A(z) = 0 e λt(1 z) b(t)dt = 0 b(t)e (λ λz)t dt. (43) Recall the definition of the Laplace transform: F (s) = 0 f(t)e st dt, (44) Thus, we have for PGF of arriving customers in service time: A(z) = B(λ λz). (45) where B( ) is the LT. Now we can get moments of number of arrivals in service time: A (1) = λb (0) = λe[x] = ρ; A (1) = λ 2 B (0) = λ 2 E[X 2 ]. (46) we used moments generating properties of PGF and Laplace transform. Lecture: M/G/1 and M/G/1/K systems: part I 31
32 Let us get back to P (z) = E[z n U(n) ]E[z a ]: P (z) = A(z)E[z n U(n) ] = A(z) z k U(k) P r{n = k} = k=0 ( ) ( ) = A(z) z 0 d 0 + z k 1 p k = A(z) d z k p k 1 z z d 0 = k=1 k=0 ( 1 = A(z) z P (z) 1 ) z d 0(1 z). (47) Use d 0 = (1 ρ) to get PGF of the number of customers as seen by departure: P (z) = (1 ρ)(1 z)a(z), (48) A(z) z where A(z) = B(λ λz). Substituting A(z) = B(λ λz), we get Pollaczek-Khinchine transform equation: P (z) = (1 ρ)(1 z)b(λ λz). (49) B(λ λz) z Lecture: M/G/1 and M/G/1/K systems: part I 32
33 5.1. Mean number of customers as seen by departure Using using moment generating properties of PGF and LT: we can get moments of the number of customers as seen by departure. To get mean, rewrite (48) as follows: Taking two derivatives we get: P (z)(a(z) z) = (1 ρ)(1 z)a(z). (50) P (z)(a(z) z) + P (z)(a (z) 1) = (1 ρ)(1 z)a (z) (1 ρ)a(z), P (z)(a(z) z) + 2P (z)(a (z) 1) + P (z)a (z) = (1 ρ)(1 z)a (z) (1 ρ)a (z). (51) Let z = 1 and use A(1) = 1, P (1) = 1, A (1) = ρ and A (1) = λ 2 E[X 2 ] to get: 2P (1)(1 ρ) + λ 2 E[X 2 ] = (1 ρ)( 2ρ) (52) Mean number of customers as seen by departing customer: E[N] = λ2 E[X 2 ] 2(1 ρ). (53) Lecture: M/G/1 and M/G/1/K systems: part I 33
GI/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 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 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 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 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 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 informationClass 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis.
Service Engineering Class 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis. G/G/1 Queue: Virtual Waiting Time (Unfinished Work). GI/GI/1: Lindley s Equations
More 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 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 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 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 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 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 informationECE 3511: Communications Networks Theory and Analysis. Fall Quarter Instructor: Prof. A. Bruce McDonald. Lecture Topic
ECE 3511: Communications Networks Theory and Analysis Fall Quarter 2002 Instructor: Prof. A. Bruce McDonald Lecture Topic Introductory Analysis of M/G/1 Queueing Systems Module Number One Steady-State
More 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 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 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 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 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 Queueing Theory
Introduction to Queueing Theory Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings of this lecture are available at: 30-1 Overview Queueing Notation
More informationQueueing systems. Renato Lo Cigno. Simulation and Performance Evaluation Queueing systems - Renato Lo Cigno 1
Queueing systems Renato Lo Cigno Simulation and Performance Evaluation 2014-15 Queueing systems - Renato Lo Cigno 1 Queues A Birth-Death process is well modeled by a queue Indeed queues can be used to
More 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 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 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 informationIntro to Queueing Theory
1 Intro to Queueing Theory Little s Law M/G/1 queue Conservation Law 1/31/017 M/G/1 queue (Simon S. Lam) 1 Little s Law No assumptions applicable to any system whose arrivals and departures are observable
More 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 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 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 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 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 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 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 Queueing Theory
Introduction to Queueing Theory Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings of this lecture are available at: http://www.cse.wustl.edu/~jain/cse567-11/
More 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 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 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 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 informationM/G/1 and Priority Queueing
M/G/1 and Priority Queueing Richard T. B. Ma School of Computing National University of Singapore CS 5229: Advanced Compute Networks Outline PASTA M/G/1 Workload and FIFO Delay Pollaczek Khinchine Formula
More 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 informationDiscrete-event simulations
Discrete-event simulations Lecturer: Dmitri A. Moltchanov E-mail: moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/elt-53606/ OUTLINE: Why do we need simulations? Step-by-step simulations; Classifications;
More 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 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 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 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 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 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 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 informationStochastic Models of Manufacturing Systems
Stochastic Models of Manufacturing Systems Ivo Adan Systems 2/49 Continuous systems State changes continuously in time (e.g., in chemical applications) Discrete systems State is observed at fixed regular
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 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 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 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 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 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 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 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 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 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 informationLesson 7: M/G/1 Queuing Systems Analysis
Slide supporting material Lesson 7: M/G/ Queuing Sstems Analsis Giovanni Giambene Queuing Theor and Telecommunications: Networks and Applications nd edition, Springer All rights reserved Motivations for
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 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 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 informationChapter 10. Queuing Systems. D (Queuing Theory) Queuing theory is the branch of operations research concerned with waiting lines.
Chapter 10 Queuing Systems D. 10. 1. (Queuing Theory) Queuing theory is the branch of operations research concerned with waiting lines. D. 10.. (Queuing System) A ueuing system consists of 1. a user source.
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 informationLecturer: Olga Galinina
Renewal models Lecturer: Olga Galinina E-mail: olga.galinina@tut.fi Outline Reminder. Exponential models definition of renewal processes exponential interval distribution Erlang distribution hyperexponential
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 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 informationVariance reduction techniques
Variance reduction techniques Lecturer: Dmitri A. Moltchanov E-mail: moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/elt-53606/ OUTLINE: Simulation with a given accuracy; Variance reduction techniques;
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 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 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 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 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 informationAnalysis of Software Artifacts
Analysis of Software Artifacts System Performance I Shu-Ngai Yeung (with edits by Jeannette Wing) Department of Statistics Carnegie Mellon University Pittsburgh, PA 15213 2001 by Carnegie Mellon University
More informationJ. MEDHI STOCHASTIC MODELS IN QUEUEING THEORY
J. MEDHI STOCHASTIC MODELS IN QUEUEING THEORY SECOND EDITION ACADEMIC PRESS An imprint of Elsevier Science Amsterdam Boston London New York Oxford Paris San Diego San Francisco Singapore Sydney Tokyo Contents
More informationQ = (c) Assuming that Ricoh has been working continuously for 7 days, what is the probability that it will remain working at least 8 more days?
IEOR 4106: Introduction to Operations Research: Stochastic Models Spring 2005, Professor Whitt, Second Midterm Exam Chapters 5-6 in Ross, Thursday, March 31, 11:00am-1:00pm Open Book: but only the Ross
More informationIntroduction to Queuing Theory. Mathematical Modelling
Queuing Theory, COMPSCI 742 S2C, 2014 p. 1/23 Introduction to Queuing Theory and Mathematical Modelling Computer Science 742 S2C, 2014 Nevil Brownlee, with acknowledgements to Peter Fenwick, Ulrich Speidel
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 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 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 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 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 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 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 information16:330:543 Communication Networks I Midterm Exam November 7, 2005
l l l l l l l l 1 3 np n = ρ 1 ρ = λ µ λ. n= T = E[N] = 1 λ µ λ = 1 µ 1. 16:33:543 Communication Networks I Midterm Exam November 7, 5 You have 16 minutes to complete this four problem exam. If you know
More informationBasics of Stochastic Modeling: Part II
Basics of Stochastic Modeling: Part II Continuous Random Variables 1 Sandip Chakraborty Department of Computer Science and Engineering, INDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR August 10, 2016 1 Reference
More informationThe discrete-time Geom/G/1 queue with multiple adaptive vacations and. setup/closedown times
ISSN 1750-9653, England, UK International Journal of Management Science and Engineering Management Vol. 2 (2007) No. 4, pp. 289-296 The discrete-time Geom/G/1 queue with multiple adaptive vacations and
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 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 information11 The M/G/1 system with priorities
11 The M/G/1 system with priorities In this chapter we analyse queueing models with different types of customers, where one or more types of customers have priority over other types. More precisely we
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 informationLecture 10: Semi-Markov Type Processes
Lecture 1: Semi-Markov Type Processes 1. Semi-Markov processes (SMP) 1.1 Definition of SMP 1.2 Transition probabilities for SMP 1.3 Hitting times and semi-markov renewal equations 2. Processes with semi-markov
More informationMATH 56A: STOCHASTIC PROCESSES CHAPTER 6
MATH 56A: STOCHASTIC PROCESSES CHAPTER 6 6. Renewal Mathematically, renewal refers to a continuous time stochastic process with states,, 2,. N t {,, 2, 3, } so that you only have jumps from x to x + and
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 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 information2905 Queueing Theory and Simulation PART IV: SIMULATION
2905 Queueing Theory and Simulation PART IV: SIMULATION 22 Random Numbers A fundamental step in a simulation study is the generation of random numbers, where a random number represents the value of a random
More informationVariance reduction techniques
Variance reduction techniques Lecturer: Dmitri A. Moltchanov E-mail: moltchan@cs.tut.fi http://www.cs.tut.fi/ moltchan/modsim/ http://www.cs.tut.fi/kurssit/tlt-2706/ OUTLINE: Simulation with a given confidence;
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 information