WUSTL CSE 567M - Analysis of A Single Queue (23 pages)

Previewing pages 1, 2, 22, 23 of 23 page document View the full content.
View Full Document

Analysis of A Single Queue



Previewing pages 1, 2, 22, 23 of actual document.

View the full content.
View Full Document
View Full Document

Analysis of A Single Queue

78 views


Pages:
23
School:
Washington University in St. Louis
Course:
Cse 567m - Computer Systems Analysis
Computer Systems Analysis Documents

Unformatted text preview:

Analysis of A Single Queue Raj Jain Washington University in Saint Louis Saint Louis MO 63130 Jain cse wustl edu These slides are available on line at http www cse wustl edu jain cse567 06 Washington University in St Louis CSE567M 31 1 2006 Raj Jain Overview Birth Death Processes M M 1 Queue M M m Queue M M m B Queue with Finite Buffers Results for other Queueing systems Washington University in St Louis CSE567M 31 2 2006 Raj Jain Birth Death Processes Jobs arrive one at a time and not as a batch State Number of jobs n in the system Arrival of a new job changes the state to n 1 birth Departure of a job changes the system state to n 1 Death State transition diagram 0 0 1 1 1 2 2 2 Washington University in St Louis 1 J 1 3 J CSE567M 31 3 1 J 1 1 2 2006 Raj Jain Birth Death Processes Cont When the system is in state n it has n jobs in it The new arrivals take place at a rate n The service rate is n We assume that both the inter arrival times and service times are exponentially distributed Washington University in St Louis CSE567M 31 4 2006 Raj Jain Theorem State Probability The steady state probability pn of a birth death process being in state n is given by Here p0 is the probability of being in the zero state Washington University in St Louis CSE567M 31 5 2006 Raj Jain Proof Suppose the system is in state j at time t There are j jobs in the system In the next time interval of a very small duration t the system can move to state j 1 or j 1 with the following probabilities Washington University in St Louis CSE567M 31 6 2006 Raj Jain Proof Cont If there are no arrivals or departures the system will stay in state j and thus t small zero probability of two events two arrivals two departure or a arrival and a departure occurring during this interval pj t probability of being in state j at time t Washington University in St Louis CSE567M 31 7 2006 Raj Jain Proof Cont The jth equation above can be written as follows Under steady state pj t approaches a fixed value pj that is



View Full Document

Access the best Study Guides, Lecture Notes and Practice Exams

Loading Unlocking...
Login

Join to view Analysis of A Single Queue and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Analysis of A Single Queue and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?