Lecture 12 Notes - /μ ° 1 server ° For system to be...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Space IOE 202: lecture 12 outline ° Announcements ° Last time. .. ° Classifying di f erent types of queueing systems ° Analysis of M/M/s and M/M/s/s queueing systems in steady state IOE 202: Operations Modeling, Fall 2009 Page 1 Space Last time: ° Queue of computer jobs on a server: deterministic vs. stochastic interarrival and service times ° The basic single-server model, a.k.a. the M / M / 1 model ° Exponentially distributed random interarrival times; occur with rate λ (average time between arrivals: 1 / λ ) ° Exponentially distributed random service times; occur with rate μ (average service time: 1
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: /μ ) ° 1 server ° For system to be stable, need server utilization ρ = λ μ < 1 ° Performance measures of a queueing system: ° Time averages: L Q , L Sys , L Serv , P (busy), P n , etc. ° Customer averages: W Q , W Sys , W Serv , etc. ° Relationships between performance measures, including Little’s Law ° Formulae to evaluate performance of an M/M/1 queue in steady state ° See “Resources – Queueing Resources – Q-formulas.pdf” IOE 202: Operations Modeling, Fall 2009 Page 2...
View Full Document

This note was uploaded on 03/17/2010 for the course IOE 202 taught by Professor Marinaepelman during the Fall '09 term at University of Michigan-Dearborn.

Ask a homework question - tutors are online