We build a queueing model for buffered leaky bucket system. First, we set up system equations and them calculate the steady-state probabilities at an arbitrary time epoch by recursive method. We derive the mean waiting time and the mean number of cells in the input buffer, and evaluate the performance of the buffered leaky bucket system to find the optimal queue capacity and token generation rate that meet the quality of service(QoS).