Abstract
Parallel to the definition of the rate distortion function for source coding, we define a rate distortion function for delay in a queueing system which gives the tradeoff between the capacity of the server and the delay or buffer overflow incurred. This function is decreasing and convex and it is shown to be equal to the 'effective bandwidth' of the input source for exponentially vanishing buffer overflow probability.