Dynamic programming method analyzing a variation of the leaky bucket scheme

This paper studies a discrete-time packet queueing system in which the packet arrival is regulated by a particular variation of the leaky bucket rate and burstiness control scheme used in a later version of the ARPANET. The worst traffic passing through the rate control scheme is characterized. As criteria for traffic comparison, this paper employs the weighted sum of queueing delays with geometric weight factor. This paper uses dynamic programming techniques and convexity argument to characterize the worst traffic.