kooooooooo

© All Rights Reserved

2 views

kooooooooo

© All Rights Reserved

- performance appraisal
- Queueing Problems
- pro report
- Fundamentals Probability 08072009
- Capital One Simulation Course
- pqt notes
- OCR Wiley - Kleinrock - Queueing Systems (1975)
- Random
- Predicting Movements On A Plane For Robot With Depth Camera
- spchapt3a
- TutorialMetrologists2011Nov22
- 4700-07-Notes-BM
- Teor_Traf
- 231 Syl Lab Uss 2010
- Andersson DTM1998
- Using Enterprise Architecture Analysis and Interview Data to Estimate Service Response Time 2013 the Journal of Strategic Information Systems
- Markov Chain
- OM-08-ServiceProcessesWaitingLines.ppt
- or2slides
- Adjustment and Application of Transition Matrices in Credit Risk Models

You are on page 1of 21

Queueing Theory

Reference Book:

Introduction to Probability Model – S. Ross

Topics:

Markov Chain

Queueing Models

Steady State Probability

Exponential Models (A single Server Queuing Sys)

Having Infinite Capacity

Having Finite Capacity

Chapter 8

Queueing Theory

What is Queueing Theory?

Queueing theory is the mathematical study of waiting lines, or queues.

In probability theory, a Markov model is a stochastic model used

to model randomly changing systems where it is assumed that future

states depend only on the current state not on the events that occurred

before it (that is, it assumes the Markov property).

In queueing theory, a discipline within the mathematical theory of

probability, an M/M/1 queue represents the queue length in a system

having a single server, where arrivals are determined by a Poisson

process and job service times have an exponential distribution.

Prepared by Lec Wali Md Abdullah, CSE, MIST 2

Chapter 8

Queueing Theory

What is Poisson Process?

In probability, statistics and related fields, a Poisson point

process or Poisson process (also called a Poisson random

measure, Poisson random point field or Poisson point field) is a type

of random mathematical object that consists of points randomly located

on a mathematical space.

In probability theory and statistics, the exponential distribution (also

known as negative exponential distribution) is the probability

distribution that describes the time between events in a Poisson process,

i.e. a process in which events occur continuously and independently at a

constant average rate.

Cost Equation

Steady State Probability

Steady State Probability

Steady State Probability Example

Steady State Probability Proof

Proof.

An arrival will see n in the system whenever the number in the system goes from

n to n + 1;

Similarly, a departure will leave behind n whenever the number in the system

goes from n + 1 to n.

Now in any interval of time T the number of transitions from n to n + 1 must equal

to within 1 the number from n + 1 to n.

(Between any two transitions from n to n + 1, there must be one from n + 1 to n,

and conversely.)

Hence, the rate of transitions from n to n + 1 equals the rate from n + 1 to n;

or, equivalently, the rate at which arrivals find n equals the rate at which

departures leave n.

Steady State Probability Proof

Proof (Contd).

Exponential Models

A Single Server Exponential Queueing System

Having Infinite Capacity

M/M/1 Queue:

with a Poisson process having rate λ.

The times between successive arrivals are independent exponential random

variables having mean 1/λ

Each customer, upon arrival, goes directly into service if the server is free and, if

not, the customer joins the queue.

When the server finishes serving a customer, the customer leaves the system,

and the next customer in line, if there is any, enters service.

The successive service times are assumed to be independent exponential

random variables having mean 1/μ.

The two Ms refer to the fact that both the inter-arrival and the service

distributions are exponential (and thus memory-less, or Markovian), and the 1

to the fact that there is a single server.

Exponential Models

A Single Server Exponential Queueing System

Having Infinite Capacity

Analyze with Limiting Probability Pn

Rate Equality Principle: For each n is greater equal 0, the rate at which the

process enters state n equals the rate at which it leaves state n.

P0 P1

Exponential Models

A Single Server Exponential Queueing System

Having Infinite Capacity

P0 P1 Pn-1 Pn P

n+1

Exponential Models

A Single Server Exponential Queueing System

Having Infinite Capacity

Exponential Models

A Single Server Exponential Queueing System

Having Infinite Capacity

Exponential Models

A Single Server Exponential Queueing System

Having Infinite Capacity

Exponential Models

A Single Server Exponential Queueing System

Having Finite Capacity

M/M/1 Queue:

In the previous model, we assumed that there was no limit on the number of

customers that could be in the system at the same time.

However, in reality there is always a finite system capacity N, in the sense that

there can be no more than N customers in the system at any time.

By this, we mean that if an arriving customer finds that there are already N

customers present, then he does not enter the system.

The two Ms refer to the fact that both the inter-arrival and the service

distributions are exponential (and thus memory-less, or Markovian), and the 1

to the fact that there is a single server.

Exponential Models

A Single Server Exponential Queueing System

Having Finite Capacity

P0 P1 P N-1 PN

Exponential Models

A Single Server Exponential Queueing System

Having Finite Capacity

P0 Pn-1 Pn Pn+1 PN

Exponential Models

A Single Server Exponential Queueing System

Having Finite Capacity

Solution:

We could now either solve the balance equations exactly as we did for the

infinite capacity model, or we could save a few lines by directly using the result that

the rate at which departures leave behind n−1 is equal to the rate at which arrivals

find n − 1. Invoking this result yields

Exponential Models

A Single Server Exponential Queueing System

Having Finite Capacity

THANK YOU

- performance appraisalUploaded byankur9us
- Queueing ProblemsUploaded byNafees A. Siddique
- pro reportUploaded bymh.arab
- Fundamentals Probability 08072009Uploaded bysriharshagadiraju
- Capital One Simulation CourseUploaded bymanidev
- pqt notesUploaded byDot Kidman
- OCR Wiley - Kleinrock - Queueing Systems (1975)Uploaded bylcallesar
- RandomUploaded byeviews
- Predicting Movements On A Plane For Robot With Depth CameraUploaded byFito Rh
- spchapt3aUploaded bygsaqswde
- TutorialMetrologists2011Nov22Uploaded bykearnj
- 4700-07-Notes-BMUploaded bygari_tero
- Teor_TrafUploaded bynemazzeo
- 231 Syl Lab Uss 2010Uploaded byhohonot
- Andersson DTM1998Uploaded bylarita_industria
- Using Enterprise Architecture Analysis and Interview Data to Estimate Service Response Time 2013 the Journal of Strategic Information SystemsUploaded bySatrio Verdianto
- Markov ChainUploaded byAzeemBukhari
- OM-08-ServiceProcessesWaitingLines.pptUploaded byzakria100100
- or2slidesUploaded byEddie Martinez Jr.
- Adjustment and Application of Transition Matrices in Credit Risk ModelsUploaded byErnesto Moreno
- Credit Behavioral ModelUploaded byHoang Dang Nhat
- Exam Timetable Report Subject WiseUploaded byAranya Dan
- Paper Jeon Kim Shin Lee Korea Sur& EeuuUploaded byFernando Lozano
- Random VibrationUploaded byLouc Ing
- Quantized Control Design for Cognitive R20160115-16229-1q88mr6Uploaded byishir babu sharma
- Diploma ThesisUploaded bynavalntua
- Models With Trend (Introduction)Uploaded byJhon Ortega Garcia
- Wi-Fi Static SimulationsUploaded byfelipefandrade
- Downlink Performance Analysis for a Generalized Shotgun Cellular SystemUploaded byAdil
- camp2002.pdfUploaded byTuan Dao Duy

- Power System Protection And SwitchgearUploaded byChaitanya Shah
- Extras.pdfUploaded byKamrun Nahar
- Photonic Crystal FiberUploaded byKamrun Nahar
- g-7Uploaded byKamrun Nahar
- Man Kiw Chapter 03 Solutions ProblemsUploaded byRimi Singh
- g-9.docxUploaded byKamrun Nahar
- g-9Uploaded byKamrun Nahar
- CSL6796_21.pdfUploaded byKamrun Nahar
- bode_plotUploaded byKamrun Nahar
- Communication TheoryUploaded byKamrun Nahar

- 07-key-countUploaded byamadea_nastiti
- Lectura Delery Doty Modos de Teorizacion en GTHUploaded byDiana Martinez
- Computer Assisted TranslationUploaded byAdil Alharthi
- Ex2-ansUploaded byShaheen Tariq
- Tata MotorsUploaded byDeepak Chaudhary
- Z-Hire V5 Administration GuideUploaded byasterisknet
- Collecting Antique Walking Sticks and CanesUploaded bychrissypbshow
- ECTOPIC PREGNANCY.pptUploaded bytaufiq
- Ship Repair ConceptsUploaded byThinkDefence
- Climatology Lec 1Uploaded byAshish Hooda
- Chexsystems Dispute FormUploaded byThomas Starks
- Drill PipeUploaded byKenaouia Bahaa
- Email Da Sturm AsUploaded byluis eustaquio soares
- rt8a(1)Uploaded byJohn Fast
- NCNDA_IMFPA.docUploaded byAnonymous wRVNXdX
- Midea Mg717cfbUploaded bybilly75
- Arno Manual en Dc68-03038b-13Uploaded byPutri Rahmanie
- Vestige Arunachal Pradesh Branches | DLCP | Mini DLCP Office - PDFUploaded byMd Firdosh
- RMRR (cc)Uploaded byBryan Collins
- Microsoft Jet 3.5 PerformanceUploaded byCamilo Salomão
- How to Set JAVA_HOME _ PATH Variables Under Linux Bash ProfileUploaded byprakash9565
- Green Manure in CoconutUploaded byNandakumar Palaparambil
- AT CompanyUploaded byZvele Navigator
- Member Services GuideUploaded byPerri Collins
- Aptitude1Uploaded byapi-3774860
- Lattice Diagram for reflectionUploaded byEarnest Aruj
- Cameron Ebd-380 (001) Syllabus Sp 2010 - WoodUploaded bychivasharan
- Cloud Computing FundamentalsUploaded byBalabharathi Srinivasan
- Unit 3Uploaded byyaivna gopee
- Case StudyUploaded byNaqash Arif

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.