qlec5 - October 27, 2004 Queueing Systems: Lecture 5 Amedeo...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: October 27, 2004 Queueing Systems: Lecture 5 Amedeo R. Odoni Lecture Outline • Bounds for G/G/1 systems • A fundamental result for queueing networks • State transition diagrams for Markovian queueing systems and networks: examples • Analysis of dynamic systems • Qualitative behavior of dynamic systems Reference: Sections 4.8.3, 4.10, 4.11 + material in handout A general upper bound for G/G/1 systems • • (1) X S • ) 1 ( ) 1 ( 2 ) ( 2 2 < − ⋅ + ⋅ ≤ ρ ρ σ S X q W A number of bounds are available for very general queueing systems (see Section 4.8) A good example is an upper bound for the waiting time at G/G/1 systems: where and are, respectively, the r.v.’s denoting inter- arrival times and service times Under some fairly general conditions, such bounds can be tightened and perform extremely well σ λ Better bounds for a (not so) special case • t , λ 1 ] | [ 0 ≤ > − t X ) 1 ( ) 1 ( 2 ) ( 2 1 2 2 < − ⋅ + ⋅ ≤ + − ρ ρ σ λ ρ S X q B W B ( ) • at most, 1/ λ ρ increases! (2) For G/G/1 systems whose inter-arrival times have the property that for all non-negative values of t X E it has been shown that: = ≤ σ λ what does this mean, intuitively? Note that the upper and lower bounds in (1) differ by, and that the percent difference between the upper and lower bounds decreases as A result which is important in analyses of queuing networks Let the arrival process at a M/M/m queuing parameter λ ....
View Full Document

This note was uploaded on 11/08/2011 for the course AERO 16.72 taught by Professor Hansman during the Fall '06 term at MIT.

Page1 / 9

qlec5 - October 27, 2004 Queueing Systems: Lecture 5 Amedeo...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online