BU275 Lecture Notes - Lecture 13: Exponential Distribution, Memorylessness, Probability Distribution
Document Summary
Customers arrive randomly to the system for service, and wait in line if the server is busy. Queueing systems evolve randomly over time, and we study them by looking at average performance measures. We will look at how to design queues, and how to evaluate them: average # of people in line, average wait time, etc. Customers arrive randomly from the pool of potential customers (essentially infinite in size) The time between successive customer arrivals (inter-arrival time) is a random variable. We start by assuming that inter-arrival times are exponentially distributed. Where is the average arrival rate in customers per unit time. E. g. suppose customers arrive to our store at average rate of 12 customers/hour: =12 custs/hour, or: =0. 2 cust/min: then the average inter-arrival time is: If the # of arrivals in an hour is 12, then the average inter- arrival time is 5 minutes.
