Introduction Notation Little’s Law aka Little’s Result

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

Introduction to Queuing Theory
Chapter Queueing Notation
Queuing Analysis Based on noted from Appendix A of Stallings Operating System text 6/10/20151.
Chap. 20, page 1051 Queuing Theory Arrival process Service process Queue Discipline Method to join queue IE 417, Chap 20, Jan 99.
HW # Due Day: Nov 23.
System Performance & Scalability i206 Fall 2010 John Chuang.
ECS 152A Acknowledgement: slides from S. Kalyanaraman & B.Sikdar
Queuing Systems Chapter 17.
1 Performance Evaluation of Computer Networks Objectives  Introduction to Queuing Theory  Little’s Theorem  Standard Notation of Queuing Systems  Poisson.
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.
Queueing Theory: Part I
1 Queueing Theory H Plan: –Introduce basics of Queueing Theory –Define notation and terminology used –Discuss properties of queuing models –Show examples.
Queueing Network Model. Single Class Model Open - Infinite stream of arriving customers Closed - Finite population eg Intranet users Indistinguishable.
Queuing Analysis Based on noted from Appendix A of Stallings Operating System text 6/28/20151.
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)
HW # Due Day: Nov 23.
Introduction to Queuing Theory. 2 Queuing theory definitions  (Kleinrock) “We study the phenomena of standing, waiting, and serving, and we call this.
Internet Queuing Delay Introduction How many packets in the queue? How long a packet takes to go through?

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  …
Network Analysis A brief introduction on queues, delays, and tokens Lin Gu, Computer Networking: A Top Down Approach 6 th edition. Jim Kurose.
Introduction to Queuing Theory
Copyright ©: Nahrstedt, Angrave, Abdelzaher, Caccamo1 Queueing Systems.
CS433 Modeling and Simulation Lecture 13 Queueing Theory Dr. Anis Koubâa 03 May 2009 Al-Imam Mohammad Ibn Saud University.
Introduction to Operations Research
Introduction to Queueing Theory
Queuing Theory Basic properties, Markovian models, Networks of queues, General service time distributions, Finite source models, Multiserver queues Chapter.
Queueing Theory What is a queue? Examples of queues: Grocery store checkout Fast food (McDonalds – vs- Wendy’s) Hospital Emergency rooms Machines waiting.
1 Queuing Models Dr. Mahmoud Alrefaei 2 Introduction Each one of us has spent a great deal of time waiting in lines. One example in the Cafeteria. Other.
TexPoint fonts used in EMF.
CS433 Modeling and Simulation Lecture 12 Queueing Theory Dr. Anis Koubâa 03 May 2008 Al-Imam Mohammad Ibn Saud University.
1 Chapters 8 Overview of Queuing Analysis. Chapter 8 Overview of Queuing Analysis 2 Projected vs. Actual Response Time.
Modeling and Simulation Queuing theory
CS352 - Introduction to Queuing Theory Rutgers University.
Chapter 1 Introduction. “Wait-in-line” is a common phenomenon in everywhere. Reason: Demand is more than service. “How long must a customer wait?” or.
Copyright ©: Nahrstedt, Angrave, Abdelzaher, Caccamo1 Queueing Systems.
1 1 Slide Chapter 12 Waiting Line Models n The Structure of a Waiting Line System n Queuing Systems n Queuing System Input Characteristics n Queuing System.
Introduction Definition M/M queues M/M/1 M/M/S M/M/infinity M/M/S/K.
COMT 4291 Queuing Analysis COMT Call/Packet Arrival Arrival Rate, Inter-arrival Time, 1/ Arrival Rate measures the number of customer arrivals.
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.
Queueing Theory. The study of queues – why they form, how they can be evaluated, and how they can be optimized. Building blocks – arrival process and.
Mohammad Khalily Islamic Azad University.  Usually buffer size is finite  Interarrival time and service times are independent  State of the system.
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,
Managerial Decision Making Chapter 13 Queuing Models.
Chapter 1 Introduction.
Al-Imam Mohammad Ibn Saud University
Queueing Theory What is a queue? Examples of queues:
Chapter 9: Queuing Models
Internet Queuing Delay Introduction
Demo on Queuing Concepts
CSCI1600: Embedded and Real Time Software
ECE 358 Examples #1 Xuemin (Sherman) Shen Office: EIT 4155
Internet Queuing Delay Introduction
Queueing Theory Carey Williamson Department of Computer Science
Queuing models Basic definitions, assumptions, and identities
Chapter 20 Queuing Theory
System Performance: Queuing
Queuing models Basic definitions, assumptions, and identities
Handling Routing Transport Haifa JFK TLV BGN To: Yishay From: Vered
TexPoint fonts used in EMF.
Queuing Theory By: Brian Murphy.
Mitchell Jareo MAT4340 – Operations Research Dr. Bauldry
Queuing Theory III.
Queueing Theory 2008.
Carey Williamson Department of Computer Science University of Calgary
Queuing Theory III.
Queueing Theory Frank Y. S. Lin Information Management Dept.
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.
Presentation transcript:

Introduction Notation Little’s Law aka Little’s Result Queueing theory Introduction Notation Little’s Law aka Little’s Result

Notation/Definitions in Queuing Theory  - means the number of arrivals per second  - service rate of a device T - mean service time for each arrival  - Utilization, percentage of time a server is in use Q - number of customers in the system waiting or being served N - number of servers Response time - time from when a process is entered the queue, until it completes

Service Rate = 1/Service Time A cashier can serve 1 customer every 3 minutes - The service time = 3 minutes The service rate is 1 customer every 3 minutes. or 1/3 a customer per minute Ẋ = 3 minutes and µ=1/3 per minute Note a rate is an Amount/Time and a service time is an (amount of time)/service

Little’s Law (a.k.a. Little’s Result)    = arrival rate. 𝑊 𝑞 = mean time a process spends in a queue. 𝑁 𝑞 = number of processes in the queue. 𝑊 𝑠 = mean time a process spends in the system 𝑁 𝑠 = number of processes in the system. 𝑁 𝑠 =  𝑊 𝑠 and 𝑁 𝑞 =  𝑊 𝑞 Q1) 10 people walk into a supermarket every minute. On average, they stay for 30 minutes. How many customers are in the supermarket at any random time? Answer) N = (10/minute) * ( 30 minutes) = 300 Q2) are there always exactly 300 customer in the supermarket?

Interarrival distributions - Deterministic Suppose a bus company has buses arrive every hour on the hour at a particular bus stop. The buses are never late and never early…they are always on time. The arrival rate λ = 1/hour The distribution is Deterministic. Interesting questions If the last bus arrived 20 minutes ago, when is the next bus coming? If you arrived at the bus stop at an arbitrary time, how long on average would it be until the next bus arrives?

Interarrival distributions - Markovian Suppose a roulette wheel has 38 numbers (0, 00, 1..36) on it and your favorite number is 15. The arrival rate λ = 1/38 spins The distribution is Poisson (type of Markovian). Interesting questions If the last #15 arrived 20 spins ago, when is the next #15 coming? If you arrived at the roulette table at an arbitrary time, how many spins would it be until the next 15 arrives?

Expected number of spins There must be at least 1 spin and then there is a probability that a 15 doesn’t come up and you have to start the whole game over. E = 1 + (37/38) E (1/38)E = 1 E= 38

D/D/1 queue with 𝜆< 𝜇 Example 𝜆=2/𝑠𝑒𝑐 deterministically 𝜇=3/sec deterministically 𝜌= 𝜆 𝜇 = 2 3 Arrivals Service completions

M/M/1 queue with 𝜆< 𝜇 Example 𝜆=2/𝑠𝑒𝑐 Markivian 𝜇=3/sec Markovian 𝜌= 𝜆 𝜇 = 2 3 Arrivals Service completions

Kendall notation A/B/c/K/m/z A – interarrival distribution B – service time distribution c – number of servers K – the capacity of the queue m – number of customers in the system z – queuing discipline

Examples of Kendall notation A/B/c is used when There is no limit on the length of the queue = default infinite queue The source is infinite – open system The queue discipline is FCFS (default) A and B may be any of the following: GI for general independent interarrival time G for general service time E for Erlang-k interarrival or service time distribution M for exponential interarrival or service time distribution D for deterministic interarrival or service time distribution H or hyperexponential (with k stages) interarrival or service time distribution.

M/D/3/4/12/FCFS

Definitions in Queuing Networks Response time – time from when a process is entered the network of queue, until it leaves the network. Throughput – Work / Time Bottlenecks – a resource that has the highest server utilization Saturated System – a system where the bottleneck device has reached 100% utilization.

M/M/1 Queue Example Consider the arrival rate  = 1/second and the service rate  = 1/second, what would the: Utilization 𝜌 of the server be? What would be the mean time in the system Ts ? What would be the mean time in queue Tq ? Institution might lead you to believe that since arrivals are 1 per second and the time to service them is 1 per second, therefore every customer arrives exactly 1 second after the previous customer goes straight to the server (no waiting in the queue) each customer will be serviced in exactly 1 so therefore, the utilization is 100% and the time in the queue is 0 an the time in the system is 1 second.

GI/G/3 queue What is the average utilization of each server? 𝜆= 𝜆1+ 𝜆2=2/ sec + 1/ sec =3/𝑠𝑒𝑐 𝜇=4 𝑝𝑒𝑟 𝑠𝑒𝑟𝑣𝑒𝑟 𝜌= 𝜆 𝑐𝜇 = 3 (3)(4) = 25% 𝜇=4/𝑠𝑒𝑐 𝜇=4 sec 𝜇=4/sec 𝜆 =2/𝑠𝑒𝑐 𝜆 =1/𝑠𝑒𝑐