Scribd
Upload
34 views6 pages

Queueing Models (Summary)

This document summarizes key concepts in queueing models and probability distributions. It describes the exponential distribution and its properties used to model inter-arrival times. The Poisson distribution and its properties are discussed for modeling the number of arrivals in a time period. General queue characteristics like average length, wait time and utilization are introduced. The M/M/1 queue with exponential arrivals and services is analyzed. The M/M/s queue and M/G/1 queue are also summarized.

Uploaded by

Sha Hid
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
34 views6 pages

Queueing Models (Summary)

This document summarizes key concepts in queueing models and probability distributions. It describes the exponential distribution and its properties used to model inter-arrival times. The Poisson distribution and its properties are discussed for modeling the number of arrivals in a time period. General queue characteristics like average length, wait time and utilization are introduced. The M/M/1 queue with exponential arrivals and services is analyzed. The M/M/s queue and M/G/1 queue are also summarized.

Uploaded by

Sha Hid
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

QUEUEING MODELS (SUMMARY)

PROBABILITY DISTRIBUTIONS
http://www.statlect.com/ucdexp1.htm
http://mathworld.wolfram.com/ExponentialDistribution.html
http://www.public.iastate.edu/~riczw/stat330s11/lecture/lec13.pdf
http://www.statlect.com/uddpoi1.htm
http://ms.appliedprobability.org/data/files/Abstracts%2037/37-3-6.pdf
http://en.wikipedia.org/wiki/Exponential_distribution

Exponential Distribution
T

random variable of time between two arrivals

arrival rate

f(t)

e-t

F(t)

Pr(T<=t)

E(T)

mean time between arrivals =

Var(T) =

# of arrivals per time unit

1 - e-t
1/

(1/)2

It has the memoryless property.


Poisson Distribution
t

time interval

arrival rate

random variable of # of arrivals in the interval from 0 to t


(1/x!) (t)x (e-t)

Pr(X=x/t)

E(X)

mean # of arrivals

Var(X)

QUEUES

General characteristics

Pn

Pr(that there are n people in the system)

Mean # of customers in system

Mean customer time spent in system

Lq

Mean # of customers waiting in line

Wq

Mean customer time waiting in line

Server utilization rate (rho)

Mean customer arrival rate

Mean service rate

Littles Formula
L = W

M/M/1 Queues
Exponential Arrivals with rate

Exponential Service Times with rate

Pn

(1 - ) (n)

(P0) (n)

() / (1 - )

/ ( - )

1 / ( - )

Lq

2 / [( ) ( - )]

Wq

/ [( ) ( - )]

Single Server

where P0 = (1 - ) = (1 - /)

M/M/s Queues
Exponential Arrivals with rate

Exponential Service Times with rate

(1/n!) ( / )n P0

P0 ( / )n / (s! sn-s)

1/P0

[(/)s / s!] [1/(1- /s)] + s-1 n = 0 (1/n!) (/)n

Lq + (/)

Wq + (1/)

Lq

(/)s (/s) P0 / [s! (1- /s)2]

Wq

Lq /

/ s

Pn

s = # of servers

0 ns

M/G/1 Queues
Exponential Arrivals with rate . General Service Times with known mean and variance 2
Single Server
P0

P0 = (1 - ) = (1 - /)

Lq + (/)

Wq + (1/)

Lq

[ ()2 + (/)2 ] / [(2) (1- /)]

Wq

Lq /

Other Models

1. 11.10

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy