Open book, 85 minutes(start 10: 30) Chapter 4 coverage: Sections 4.1through 4.7 (inclusive); Section 4.(skim through .9.4)[Up to lecture of 10/22] Review Problem Set 3 Review some old quizzes Prof. Barnett: Quiz review today
Lecture Outline Introduction to queuing systems Conceptual representation of queuing systems Codes for queuing models Terminology and notation Little's Law and basic relationships Birth-and-death processes The M/M/1 queuing system State transition diagrams Steady-state probabilities
Suppose that two aerial routes--one Eastbound and one Northbound--cross at an altitude of 35,000 feet at junction(Figure 1). In the absence of air-traffic control, the times at which eastbound planes would arrive at the junction would reflect a Poisson process with parameter(per minute)
two -Server- Hypercube” Queueing Model Distinguishable servers Different workloads(due to geography) Can appear with or without queueing With-- usually FCFS Without--usually means a backup contract service is in place
Ambulance always returns home with each service; standard M/G/1 applies a But suppose we have an emergency repair vehicle that travels directly from one customer to the next?