On Ultra-Sharp Queueing Bounds

Abstract

Martingale-based techniques render sharp bounds in several queueing scenarios, but mainly in heavy-traffic and subject to the degree of burstiness. We present a related technique to render ultra-sharp bounds across all utilization levels and for various degrees of burstiness.