As the title suggests, when do we consider the exponentially distributed interarrival (service) times to be reasonable or unreasonable for a queuing system?
I'm pretty clueless about this (or maybe I just can't see the obvious answer) as I'm new to the topic of queuing theory..
Exponentially-distributed inter-arrival times means that the arrivals are a Poisson process. There are three axioms that characterize a Poisson process. There are various formulations, for example:
The probability of two arrivals at the same instant is 0.
The number of arrivals in two non-overlapping time intervals is independent.
The probability of an arrival occurring in a short time interval is proportional to the length of the interval.
So, it come down to the question of whether the arrival process satisfies these axioms, at least approximately. Note that this may be true at some times of day, but not others, or it may be true with different arrival rates in different periods. You should Google "axioms for Poisson process" to see other formulations.
Similar remarks hold for exponential service times. The distribution of the time to completion doesn't depend on how long the service has taken so far. For example if we only have two kinds of jobs, and one takes a short time and the other a long time, then exponential service times doesn't seem like a good fit, because if the service time is already twice the length of a short job, the probability that it's a long job has surely increased.
I'm no queueing theorist, although I took a few courses a long time ago. It always seemed to me that the assumption of exponential service time was mainly motivated by the fact that it greatly simplifies the math. (Of course, there may be good reasons which were simply not discussed in my classes, which focussed on the math. In a particular case, I'd like to get a list of actual service times, and put them on a histogram.)