Queueing theory Birth-death Analysis

Slides:



Advertisements
Similar presentations
Lecture 10 Queueing Theory. There are a few basic elements common to almost all queueing theory application. Customers arrive, they wait for service in.
Advertisements

IE 429, Parisay, January 2003 Review of Probability and Statistics: Experiment outcome: constant, random variable Random variable: discrete, continuous.
Capacity Setting and Queuing Theory
Model Antrian Ganda Pertemuan 21 Matakuliah: K0414 / Riset Operasi Bisnis dan Industri Tahun: 2008 / 2009.
Continuous Time Markov Chains and Basic Queueing Theory
Simulation of multiple server queuing systems
Nur Aini Masruroh Queuing Theory. Outlines IntroductionBirth-death processSingle server modelMulti server model.
Chap. 20, page 1051 Queuing Theory Arrival process Service process Queue Discipline Method to join queue IE 417, Chap 20, Jan 99.
Managing Waiting Lines
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Simple queuing models (Sec )
Simulation with ArenaChapter 2 – Fundamental Simulation Concepts Discrete Event “Hand” Simulation of a GI/GI/1 Queue.
1 Queuing Theory 2 Queuing theory is the study of waiting in lines or queues. Server Pool of potential customers Rear of queue Front of queue Line (or.
2003 Fall Queuing Theory Midterm Exam(Time limit:2 hours)
1 Multiple class queueing networks Mean Value Analysis - Open queueing networks - Closed queueing networks.
Queuing. Elements of Waiting Lines  Population –Source of customers Infinite or finite.
On G-network and resource allocation in multimedia systems 報告者 : 王敬育.
Queueing Theory.
Queuing Theory. Queuing theory is the study of waiting in lines or queues. Server Pool of potential customers Rear of queue Front of queue Line (or queue)
Model Antrian By : Render, ect. M/M/1 Example 2 Five copy machines break down at UM St. Louis per eight hour day on average. The average service time.
Internet Queuing Delay Introduction How many packets in the queue? How long a packet takes to go through?
Limiting probabilities. The limiting probabilities P j exist if (a) all states of the Markov chain communicate (i.e., starting in state i, there is.
CS433 Modeling and Simulation Lecture 13 Queueing Theory Dr. Anis Koubâa 03 May 2009 Al-Imam Mohammad Ibn Saud University.
Lecture 10: Queueing Theory. Queueing Analysis Jobs serviced by the system resources Jobs wait in a queue to use a busy server queueserver.
Analysis of M/M/c/N Queuing System With Balking, Reneging and Synchronous Vacations Dequan Yue Department of Statistics, College of Sciences Yanshan University,
Network Design and Analysis-----Wang Wenjie Queueing System IV: 1 © Graduate University, Chinese academy of Sciences. Network Design and Analysis Wang.
Modeling and Analysis of Computer Networks
M/M/1 queue λn = λ, (n >=0); μn = μ (n>=1) λ μ λ: arrival rate
yahoo.com SUT-System Level Performance Models yahoo.com SUT-System Level Performance Models8-1 chapter11 Single Queue Systems.
Machine interference problem: introduction
M/M/1 Queues Customers arrive according to a Poisson process with rate. There is only one server. Service time is exponential with rate  j-1 jj+1...
Structure of a Waiting Line System Queuing theory is the study of waiting lines Four characteristics of a queuing system: –The manner in which customers.
Delays  Deterministic Assumes “error free” type case Delay only when demand (known) exceeds capacity (known)  Stochastic Delay may occur any time Random.
CS 4594 Broadband Intro to Queuing Theory. Kendall Notation Kendall notation: [Kendal 1951] A/B/c/k/m/Z A = arrival probability distribution (most often.
Random Variables r Random variables define a real valued function over a sample space. r The value of a random variable is determined by the outcome of.
Simple Queueing Theory: Page 5.1 CPE Systems Modelling & Simulation Techniques Topic 5: Simple Queueing Theory  Queueing Models  Kendall notation.
QUEUING THEORY 1.  - means the number of arrivals per second   - service rate of a device  T - mean service time for each arrival   = ( ) Utilization,
Modeling and Simulation
The reading is 7.38 mm. The reading is 7.72 mm.
Queuing Theory. Model Customers arrive randomly in accordance with some arrival time distribution. One server services customers in order of arrival.
Model Antrian Tunggal Pertemuan 20
Advanced Higher Mathematics
Models of Traffic Flow 1.
CTMCs & N/M/* Queues.
Al-Imam Mohammad Ibn Saud University
Queueing Theory What is a queue? Examples of queues:
Internet Queuing Delay Introduction
Lecture on Markov Chain
Finite M/M/1 queue Consider an M/M/1 queue with finite waiting room.
Mathematics of Population Growth
Queueing Theory.
Internet Queuing Delay Introduction
Birth-Death Process Birth – arrival of a customer to the system
Queuing Systems Don Sutton.
Solutions Queueing Theory 1
Delays Deterministic Stochastic Assumes “error free” type case
Solutions Hwk Que3 1 The port of Miami has 3 docking berths for loading and unloading ships but is considering adding a 4th berth.
A Queue system based on the bank service
Solutions Queueing Theory 1
Queuing Theory II.
Queuing Theory By: Brian Murphy.
Queuing Theory.
Introduction to Queueing Theory
Discrete Event “Hand” Simulation of a GI/GI/1 Queue
Solutions Hwk Que3 1 The port of Miami has 3 docking berths for loading and unloading ships but is considering adding a 4th berth.
Queuing Theory III.
Queuing Theory III.
Queuing Theory III.
Queuing Theory II.
Waiting Line Models Waiting takes place in virtually every productive process or service. Since the time spent by people and things waiting in line is.
VIRTUE MARYLEE MUGURACHANI QUEING THEORY BIRTH and DEATH.
Presentation transcript:

Queueing theory Birth-death Analysis M/M/1 queues (intro to M/M/c)

Birth Death Processes Consider The M/M/1 queue State 0 – the queue and server is empty State 1 – the server is in use and the queue is empty State 2 – the server is in use and 1 is in the queue State 3 – the server is in use and 2 in the queue n 1 2 3 𝜆 𝜇

Thoughts on Birth death processes The rate of moving from state 2 into state 3 should be the same as the rate from moving from state 3 into state 2. Over the course of a day if the queuing system moved from state 2 to 3 5000/day then the rate that the system goes from state 3 to state 2 must also be 5000/day(or maybe 4999/day). The probability of being in one state i is 𝑃 𝑖 . The probability of being in state i and going to state i+1 is equal to the probability of doing from state i+1 and going to state i. 𝑃 𝑖+1 (𝑑𝑒𝑎𝑡ℎ 𝑖+1 )= 𝑃 𝑖 (𝑏𝑖𝑟𝑡ℎ 𝑖 )

Birth-Death for M/M/1 queues continued 𝑃 0 =1−𝜌=1− 𝜆 𝜇 𝜆𝑃 0 = 𝜇𝑃 1  𝑃 1 = 𝜆 𝜇 𝑃 0 𝑃 𝑛+1 = 𝜆 𝜇 𝑃 𝑛 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑛 𝑃 𝑛 = 𝜆 𝜇 𝑛 𝑃 0 𝑖=0 ∞ 𝑃 𝑛 =1  𝑖=1 ∞ 𝜆 𝜇 𝑛 𝑃 0 =1

Mathematical Summation Recall from Calculus II 𝑖=0 ∞ 𝑥 𝑖 = 1 1−𝑥 𝑓𝑜𝑟 0<𝑥<1 When 𝜆< 𝜇 𝑡ℎ𝑒𝑛 0< 𝜆 𝜇 =𝜌<1 1= 𝑖=0 ∞ 𝜆 𝜇 𝑖 𝑃 0 = 1 1−𝜌 𝑃 0

Expected Values of a roll of dice 𝐸= 𝑖=1 6 𝑖 𝑃 𝑖 = 1 1 6 + 2 1 6 + 3 1 6 + 4 1 6 +(5) 1 6 +(6) 1 6 = 21 6 =3.5

Expected # customers in M/M/1 queue 𝐸= 𝑖=0 ∞ 𝑖 𝑃 𝑖 = 𝑖=0 ∞ 𝑖 𝜆 𝜇 𝑖 𝑃 0 = 𝑃 0 𝑖=0 ∞ 𝑖 𝜆 𝜇 𝑖 Recall from Calculus II 𝑖=0 ∞ 𝑖𝑥 𝑖−1 = 1 1−𝑥 2 𝑓𝑜𝑟 0<𝑥<1 𝐸= 𝑃 0 𝑖=0 ∞ 𝑖 𝜌 𝜌 𝑖−1 =(1−𝜌) 𝜌 𝑖=0 ∞ 𝑖 𝜌 𝑖−1 𝐸= (1−𝜌) 𝜌 1−𝜌 2 = 𝜌 1−𝜌 = 𝜆 𝜇 1− 𝜆 𝜇

Example M/M/1 queue 𝜆=2/ sec 𝑎𝑛𝑑 𝜇=3/𝑠𝑒𝑐 What is the total time in the queueing system? Time in system = time waiting in queue + service time. 𝑇 𝑠 = 𝑊 𝑞 +1/𝜇 𝑇 𝑠 = 𝐸 # (1/𝜇)+1/𝜇 𝑇 𝑠 = 𝜆 𝜇 1− 𝜆 𝜇 (1/𝜇)+1/𝜇 𝑇 𝑠 = 2 3 1− 2 3 1 3 +(1) 1 3 =2 1 3 +1 1 3 =1 second

M/M/3 queue birth death analysis State 0 – system is empty State 1 – 1 server in use, 2 servers idle, queue empty State 2 – 2 servers in use, 1 server idle, queue empty State 3 – 3 servers in use, queue empty State 4 – 3 servers in use, 1 customer in the queue State 5 – 3 servers in use, 2 customer in the queue X

Birth death equations for M/M/3 𝜆𝑃 0 = 𝜇𝑃 1 𝜆𝑃 1 = 2𝜇𝑃 2 𝜆𝑃 2 = 3𝜇𝑃 3 𝜆𝑃 3 = 3𝜇𝑃 4 𝜆𝑃 𝑛 = 3𝜇𝑃 𝑛+1 𝑎𝑙𝑙 𝑛>3 n 1 2 3 𝜆 𝜇 2𝜇 3𝜇