Introduction to Markov Chains, Queuing Theory, and Network Performance
|
|
- Millicent Daniels
- 5 years ago
- Views:
Transcription
1 Introduction to Markov Chains, Queuing Theory, and Network Performance Marceau Coupechoux Telecom ParisTech, departement Informatique et Réseaux IT.2403 Modélisation et Performance des Réseaux February 8, 2011
2 Outlines Network Performance 2. Mathematical Background 3. Markov Chains 4. Formalism of Queuing Theory 5. Simple Queues 6. Erlang B and C laws 7. Networks of Queues
3 Formalism of Queuing Theory Arrival process and service time 2. Buffer mechanism 3. Kendall notation 4. Multi-class queues 5. Networks of queues 6. Performance parameters 7. Stability 8. Little law 9. Distributions at arrival and departure instants
4 Formalism of Queuing Theory 53 Simple Queue Arrivals Arrival process Buffer Server Departure of customers How do customers arrive? Example: the inter-arrival times are constant Simple case: the inter-arrival times between customers are iid random variables Poisson arrivals: inter-arrival times are exponentially distributed
5 Formalism of Queuing Theory 54 Simple Queue Service time Arrival process Buffer Server Departure of customers How are customers served? Are there more than one server? How much time will the service take (service time distribution)? Simple case: service times are iid random variables Exponential service: service time is exponentially distributed
6 Formalism of Queuing Theory 55 Simple Queue Buffer mechanism Arrival process Buffer Server Departure of customers How customers are stacked in the buffer and how customers are taken out of the buffer by the server FIFO: first in first out = FCFS : first come first served LIFO: last in first out RANDOM Round Robin: cyclic mechanism etc
7 Formalism of Queuing Theory 56 Simple Queue Kendall notation Arrival process Buffer Server Departure of customers Queue A/B/C/K/m/Z A: inter-arrival distribution B: service distribution C: number of servers K: buffer capacity (default ) m: customer population (default ) Z: buffer mechanism (default FIFO)
8 Formalism of Queuing Theory 57 Simple Queue Arrival process A and B distributions can be : Buffer Server Departure of customers M: exponential G: generic D: constant E k : Erlang-k H k : Hyperexponential-k C k : Cox-k etc
9 Formalism of Queuing Theory 58 Multi-class queues Customers of different classes can experience different arrival process, or service times... Arrival process 1 Service distribution 1 Arrival process 2 Service distribution 2
10 Formalism of Queuing Theory 59 Network of queues Several connected simple queues Open networks: customers can leave the system and are coming from the outside p01 p02 p p13 p23 3 p20 Closed networks: finite population, customers can t leave the system 1 3 2
11 Formalism of Queuing Theory 60 Packet network Is modeled by a network of queues A network node: arrival buffer + processing time + sending buffers A transmission link: transmission time + propagation time Sending buffer... Reception buffer Transmission Propagation Processing...
12 Formalism of Queuing Theory 61 Performance parameters N(t) R1 Queuing System R2 Xe Arrivals Q R Xs Departures 0 A1 D1 A2 D2 T t A k : arrival instant of the kth customer in the system D k : departure instant of the kth customer in the system R k = D k A k : time spent in the system by the kth customer T (n, T ): time during which the system has n customers : n=0 T (n, T ) = T A(T )/D(T ): number of arrivals/departures in [0; T ]
13 Formalism of Queuing Theory 62 Performance parameters Input load: X e (T ) = A(T )/T Throughput: X s (T ) = D(T )/T Mean number of customers: Q(T ) = 1 T n=0 nt (n, T ) Mean time spent in the system: R(T ) = 1 A(T ) A(T ) k=1 R k Utilization ratio: U(T ) = 1 T (0, T )/T
14 Formalism of Queuing Theory 63 Stability A system is stable iff the input load equals the throughput in the stationary regime i.e. lim T X e (T ) = lim T X s (T ) or lim T D(T ) A(T ) = 1 A mono-class open networks of queues is stable iff all queues of the network are stable A finite population system is always stable
15 Formalism of Queuing Theory 64 Little law For a stable system in stationary regime : Q = RX l Q X Q=RX=Rl R l Qw X Qw=WX=Wl l W Qs X Qs=U=SX=Sl S
16 Formalism of Queuing Theory 65 Distributions at arrival and departure instants A(n, T ): number of customers who find n customers in the system at their arrival D(n, T ): number of customers who leave n customers in the system at their departure P (n, T ) = T (n, T )/T : system proportion of time during which there are n customers in the P a (n, T ) = A(n, T )/A(T ): proportion of clients that find n customers in the system P d (n, T ) = D(n, T )/D(T ): proportion of clients that leave n customers in the system p(n) = lim T P (n, T ): stationary probability to have n customers in the system p a (n) = lim T P a (n, T ): stationary probability for a client to find n customers p d (n) = lim T P d (n, T ): stationary probability for a client to leave n customers
17 Formalism of Queuing Theory 66 Properties In a (stable and ergodic) system where customers arrive or leave one by one: p a (n) = p d (n) In a system with Poisson arrivals: p a (n) = p(n)
18 Simple Queues M/M/1 (a) Definition (b) Associated CTMC (c) Stability (d) Analysis 2. M/M/1/K (a) Definition (b) Associated CTMC (c) Stability (d) Analysis 3. Markovian queues
19 Simple Queues 68 M/M/1, Definition Infinite capacity A single server Poisson arrivals of rate λ Exponential service time of rate µ
20 Simple Queues 69 M/M/1, Associated DTMC Generic method: Find the right state description stochastic process analysis performance parameters What is a right state description? The knowledge of the present state is sufficient to predict the evolution of the system = the generated stochastic process is a Markov chain State description for the M/M/1: {n(t)} t 0
21 Simple Queues 70 M/M/1, Associated DTMC Stochastic process with discrete state space and continuous time Memoryless property of the service time: it is not necessary to know for how long time the service has started to predict the remaining service time Memoryless property of the inter-arrival law: it is not necessary to know when the last customer arrived to predict the arrival of the next one
22 Simple Queues 71 M/M/1, Stability Stability condition: λ < µ ρ = λ µ < 1 ρ is referred to as the traffic intensity
23 Simple Queues 72 M/M/1, Analysis We assume that the system is stable Three methods to derive the stationary (or steady-state) probabilities: (1) Solve pq = 0 and n=0 p(n) = 1 (2) Solve the state equations: for each state, input flow=output flow (3) Solve the border equations
24 Simple Queues 73 M/M/1, Analysis pq = 0 Q = λ λ µ (λ + µ) λ µ (λ + µ) λ µ (λ + µ) λ µ (λ + µ) λ µ...
25 Simple Queues 74 M/M/1, Analysis state equations: input flow=output flow p(0)λ = p(1)µ p(1)(λ + µ) = p(0)λ + p(2)µ... p(n)(λ + µ) = p(n 1)λ + p(n + 1)µ for all n 1
26 Simple Queues 75 border equations: p(0)λ = p(1)µ p(1)λ = p(2)µ... p(n)λ = p(n + 1)µ for all n 0 p(n) = ρp(n 1) p(n) = ρ n p(0)
27 Simple Queues 76 border equations: p(0)λ = p(1)µ p(1)λ = p(2)µ... p(n)λ = p(n + 1)µ for all n 0 Normalization : p(0) = 1 n=0 ρ n = 1 ρ Thus, for ρ < 1, n 0 p(n) = (1 ρ)ρ n
28 Simple Queues 77 M/M/1, Performance parameters Throughput: X = P roba[queue non empty]µ = n=1 p(n)µ = ρµ = λ Server utilization: U = 1 p(0) = ρ = λ µ Average number of customers: Q = n=1 np(n) = ρ 1 ρ Average time spent by a customer in the system (Little law): R = Q X = 1 µ(1 ρ) = 1 µ + ρ µ(1 ρ)
29 Simple Queues 78 M/M/1, Performance parameters Q and R:
30 Simple Queues 79 M/M/1/K, Definition The system (buffer and server) is limited to K customers A single server Poisson arrivals of rate λ Exponential service time of rate µ
31 Simple Queues 80 M/M/1/K, Associated CTMC State description: {n(t)} t 0 Stochastic process with continuous time and discrete state space At a given time, when there is 0 < n(t) < K customers in the system, both inter-arrival and service times are memoryless
32 Simple Queues 81 M/M/1/K, Stability The system is limited the system is always stable
33 Simple Queues 82 M/M/1/K, Analysis Border equations: n, 1 n K, p(n 1)λ = p(n)µ n, 1 n K, p(n) = ρp(n 1) n, 0 n K, p(n) = ρ n p(0) Normalization: p(0) = 1 Kn=0 ρ n = 1 ρ 1 ρ K+1
34 Simple Queues 83 M/M/1/K, Performance parameters Throughput X: two methods (1) Departure rate from the server: X s = P roba[queue not empty]µ = (1 p(0))µ = ρ ρk+1 1 ρ K+1µ
35 Simple Queues 84 M/M/1/K, Performance parameters Throughput X: two methods (2) Arrivals in the system (not lost): X e = P roba[queue not full when a customer arrives]λ = = K 1 n=0 K 1 n=0 p a (n)λ p(n)λ = 1 ρk 1 ρ K+1λ
36 Simple Queues 85 M/M/1/K, Performance parameters Server utilization U: U = 1 p(0) = ρ 1 ρk 1 ρ K+1 Average number of customers Q: Q = K n=0 np(n) = ρ 1 ρ 1 (K + 1)ρK + Kρ K+1 1 ρ K+1
37 Simple Queues 86 M/M/1/K, Performance parameters Average time spent by a customers in the system: 2 possible parameters (1) Time spent by a customers admitted in the system: R = Q/X (2) Time spent by all customers trying to enter the system: R T = Q/λ
38 Simple Queues 87 Markovian queues, Definition Infinite buffer A single server Inter-arrival and service times law are memoryless and depends on the number of customers in the system When there are n customers in the system at a given time instant: - the arrival time of the next customer follows an exponential law of rate λ(n) - the service time follows an exponential law of rate µ(n)
39 Simple Queues 88 Markovian queues, Associated CTMC State description: {n(t)} t 0 Stochastic process with continuous time and discrete state space
40 Simple Queues 89 Markovian queues, Stability Stability condition: p(0) > n=1 ( nk=1 λ(k 1) µ(k) n=1 n k=1 ) > 0 λ(k 1) < µ(k)
41 Simple Queues 90 Markovian queues, Analysis Border equations: n > 0, p(n 1)λ(n 1) = p(n)µ(n) p(n) = n k=1 λ(k 1) p(0) µ(k) Normalization: p(0) = n=1 ( nk=1 λ(k 1) µ(k) )
42 Simple Queues 91 Markovian queues, Performance parameters Throughput X: 2 methods (1) At the exit of the system: X = n=1 p(n)µ(n) (2) At the entrance of the system: X = n=0 p a (n)λ(n) = n=0 p(n)λ(n) Average number of customers in the system Q: Q = n=1 np(n) Average time spent by a customer in the system R: R = Q/X
43 Erlang B and C laws 92 Telephonic traffic N junctions/time slots Switch Base station Main issue: (QoS) find the right number of servers associated to a given quality of service Traffic a of a server (ITU-T E-100) : average proportion of occupation time of the server (t is the occupation time between 0 and T, T is the observation time) : a = t T a is in Erlangs US : Cent Call Second (CCS) is the occupation of a machine during 100s per hour 1CCS = 100/3600 = 1/36Erlangs
44 Erlang B and C laws 93 Telephonic traffic ML M1... T Traffic of a group of L servers: A = i t Mi T LErlangs Identical servers, with n: mean number of occupation periods in T and τ: mean occupation time of a server: A = nτ T Ergodicity: statistics of the group at a given time and statistics of a given server in time are equal with x: mean number of occupied servers at a given time and the ergodicity property: x L = a
45 Erlang B and C laws 94 Erlang B model, assumptions We consider S servers serving phone calls Calls arrive according to a Poisson law of rate λ, λ does not depend on the number of occupied servers (infinite population assumption) Calls that cannot be served are lost Service time is distributed according to a decreasing exponential law of rate µ
46 Erlang B and C laws 95 Erlang B, markov chain The system is modeled with a M/M/S/S. Stationary probabilities are given by : p(n) = ρ n /n!p(0) and p(0) = S k=0 ρ k /k! 1 with ρ = λ/µ Blocking probability is given by : P b = p(s) = ρs /S! Sk=0 ρ k k!
47 Erlang B and C laws 96 Erlang B law is not linear:
48 Erlang B and C laws 97 Erlang B law is not linear:
49 Erlang B and C laws 98 A recursive definition of the blocking probability: P b (S + 1) = ρp b (S) S ρp b (S). An approximation of the inverse of the Erlang B law (Claude Rigault ENST) : If E 1,S (A) = ɛ = 10 k then S A + k A Example: consider a traffic of A = 100 Erlangs What is the number of junctions to install in order that the probability of lost call is less than ɛ = 10 4? N 140 servers
50 Erlang B and C laws 99 Erlang C model, assumptions We consider S servers serving phone calls Calls arrive according to a Poisson law of rate λ, λ does not depend on the number of occupied servers (infinite population assumption) Calls that cannot be served are put in an infinite buffer, discipline is FIFO Service time is distributed according to a decreasing exponential law of rate µ
51 Erlang B and C laws 100 Erlang C, markov chain The system is modeled with a M/M/S/. Stationary probabilities are given by : p(n) = ρ n /n!p(0) for 0 n S 1, p(n) = ρ n /(S!S n S )p(0) for n S, p(0) = S 1 k=0 ρ k /k! + ρs /S! 1 ρ/s 1 with ρ = λ/µ
52 Erlang B and C laws 101 Erlang C, waiting probability P w = n S = n S = ρs S! = p(n) ρ S ρ n S p(0) S! Sn S S S ρ p(0) ρ S S! S S ρ S 1 k=0 ρk /k! + ρs /S! 1 ρ/s.
53 Erlang B and C laws 102 Erlang C, some useful results Mean number of customers: ρ/s Q = P w 1 ρ/s Mean waiting time W = P w λ ρ/s 1 ρ/s Distribution of the waiting time: P [T > t] = P w exp( Sµt(1 ρ/s))
54 Erlang B and C laws 103 Erlang C law is not linear:
55 Networks of Queues Definition of the Jackson networks 2. Stability 3. Visit rates 4. Analysis and Jackson theorem 5. Performance parameters
56 Networks of Queues 105 Definition of the Jackson networks Open network M stations A single class of customers Poisson arrivals of rate λ For each station: a single server, an unlimited FIFO buffer, an exponential service time of rate µ i Probabilistic routing: p 0i =probability that a customers arriving in the network goes to station i; p ij =probability that a customer leaving station i goes to station j; p i0 =probability that a customer leaving station i goes out of the system i, 0 i M, M j=0 p ij = 1
57 Networks of Queues 106 Example of Jackson network
58 Networks of Queues 107 Stability Let e i the average number of times that a customer visits station i during its journey in the system e i is the visit rate of station i Arrival rate of customers in the network: λ Arrival rate of customers in station i: λ i = e i λ Stability condition: i = 1,..., M, λ i < µ i
59 Networks of Queues 108 Visit rates The traffic λ i at station i is made of : (1) the outside traffic: λp 0i (2) the traffic coming from station j: λ j p ji for all stations j = 1,..., M λ i = λp 0i + M j=1 λ j p ji With λ i = e i λ: e i = p 0i + M j=1 e j p ji
60 Networks of Queues 109 Analysis State description: {n(t) = [n 1 (t),..., n M (t)]} Stochastic process with continuous time and discrete state space At a given instant, there is n i (t) customers in station i - arrivals are Poisson memoryless - service times are exponential memoryless - routing is probabilistic memoryless
61 Networks of Queues 110 Jackson theorem For a stable Jackson network: p(n) = M i=1 p i (n i ) p i (n i ) is the steady-state probability of a M/M/1 with arrival rate λ i and service rate µ i p i (n i ) = (1 ρ i )ρ n i i with ρ i = λ i /µ i
62 Networks of Queues 111 Performance parameters For station i: X i = λ i Q i = ρ i 1 ρ i R i = Q i X i = 1 µ i λ i U i = ρ i For the network: X = λ Q = M Q i i=1 R = Q X = Q λ = M i=1 Q i M λ = Q e i i = i=1 λ i M i=1 e i R i
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationAdvanced Computer Networks Lecture 3. Models of Queuing
Advanced Computer Networks Lecture 3. Models of Queuing Husheng Li Min Kao Department of Electrical Engineering and Computer Science University of Tennessee, Knoxville Spring, 2016 1/13 Terminology of
More informationStochastic process. X, a series of random variables indexed by t
Stochastic process X, a series of random variables indexed by t X={X(t), t 0} is a continuous time stochastic process X={X(t), t=0,1, } is a discrete time stochastic process X(t) is the state at time t,
More 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 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 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 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 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 informationPerformance analysis of queueing systems with resequencing
UNIVERSITÀ DEGLI STUDI DI SALERNO Dipartimento di Matematica Dottorato di Ricerca in Matematica XIV ciclo - Nuova serie Performance analysis of queueing systems with resequencing Candidato: Caraccio Ilaria
More 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 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 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 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 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 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 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 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 informationContinuous Time Processes
page 102 Chapter 7 Continuous Time Processes 7.1 Introduction In a continuous time stochastic process (with discrete state space), a change of state can occur at any time instant. The associated point
More informationChapter 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 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 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 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 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 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 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 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 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 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 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 informationreversed chain is ergodic and has the same equilibrium probabilities (check that π j =
Lecture 10 Networks of queues In this lecture we shall finally get around to consider what happens when queues are part of networks (which, after all, is the topic of the course). Firstly we shall need
More informationComputer Networks More general queuing systems
Computer Networks More general queuing systems Saad Mneimneh Computer Science Hunter College of CUNY New York M/G/ Introduction We now consider a queuing system where the customer service times have a
More informationQueueing Networks and Insensitivity
Lukáš Adam 29. 10. 2012 1 / 40 Table of contents 1 Jackson networks 2 Insensitivity in Erlang s Loss System 3 Quasi-Reversibility and Single-Node Symmetric Queues 4 Quasi-Reversibility in Networks 5 The
More 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 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 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 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 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 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 informationControl of Fork-Join Networks in Heavy-Traffic
in Heavy-Traffic Asaf Zviran Based on MSc work under the guidance of Rami Atar (Technion) and Avishai Mandelbaum (Technion) Industrial Engineering and Management Technion June 2010 Introduction Network
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationWaiting Line Models: Queuing Theory Basics. Metodos Cuantitativos M. En C. Eduardo Bustos Farias 1
Waiting Line Models: Queuing Theory Basics Cuantitativos M. En C. Eduardo Bustos Farias 1 Agenda Queuing system structure Performance measures Components of queuing systems Arrival process Service process
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 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 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 informationSlides 9: Queuing Models
Slides 9: Queuing Models Purpose Simulation is often used in the analysis of queuing models. A simple but typical queuing model is: Queuing models provide the analyst with a powerful tool for designing
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 informationEfficient Nonlinear Optimizations of Queuing Systems
Efficient Nonlinear Optimizations of Queuing Systems Mung Chiang, Arak Sutivong, and Stephen Boyd Electrical Engineering Department, Stanford University, CA 9435 Abstract We present a systematic treatment
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 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 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 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 informationQUEUING MODELS AND MARKOV PROCESSES
QUEUING MODELS AND MARKOV ROCESSES Queues form when customer demand for a service cannot be met immediately. They occur because of fluctuations in demand levels so that models of queuing are intrinsically
More 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 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 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 informationBasic Queueing Theory
After The Race The Boston Marathon is a local institution with over a century of history and tradition. The race is run on Patriot s Day, starting on the Hopkinton green and ending at the Prudential Center
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 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 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 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 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 informationLittle s result. T = average sojourn time (time spent) in the system N = average number of customers in the system. Little s result says that
J. Virtamo 38.143 Queueing Theory / Little s result 1 Little s result The result Little s result or Little s theorem is a very simple (but fundamental) relation between the arrival rate of customers, average
More informationMAT SYS 5120 (Winter 2012) Assignment 5 (not to be submitted) There are 4 questions.
MAT 4371 - SYS 5120 (Winter 2012) Assignment 5 (not to be submitted) There are 4 questions. Question 1: Consider the following generator for a continuous time Markov chain. 4 1 3 Q = 2 5 3 5 2 7 (a) Give
More information