This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: P system utilization Random Arrivals Poisson Distribution #/time Exponential Distribution Time between arrival Random service-exponential distribution Rate number per period of time Single Channel Single Phase 1. Random Arrivals, Random Service 2. Random Arrivals, Constant Service Multiple channels single phase Server cost is easy to quantify Waiting cost is hard to quantify because every ones time cost is different If the line is longer than the number of server X the maximum the server could serve, the model is useless. Therefore there is no Lq. Multiple priorities some times you could move head of the line. Only work for the selected people that do move head of the line. Finite Source Model small number of customers Rate = $ # / time...
View Full Document
This note was uploaded on 09/08/2010 for the course BUS 140 at San Jose State University .