Bufferless queue 2026-10-14
A queue which retains no unfinished work between slots. Given nonnegative input and capacity , its bufferless queue output is and its lost work is .
The bufferless queue output is
Put . Since , we have for all sufficiently large . Consequently the two queue overflow events are exactly equal eventually:
Apply the Poisson moderate deviation principle with exponent to obtain
There is also an exponential equivalence proof, which describes the whole output law at this smaller scale. For each ,
The right side has strictly negative logarithmic exponent at speed . Dividing instead by multiplies that negative exponent by , giving . Thus the centered, scaled input and output are exponentially equivalent and have the same good rate function. This is the moderate deviations below a bufferless queue cap.
The downstream service rate of a queue now exceeds the upstream cap for all sufficiently large , since
But the bufferless queue output is always at most . Therefore the downstream queue overflow probability is eventually exactly zero, and
This is a deterministic cap argument, stronger than merely proving superexponentially small probability.
The input admits positive moderate deviations on every scale with . The bufferless queue output retains exactly the same overflow events at thresholds below the cap, so clipping does not improve the exponents on the smaller scale. It removes every positive burst at thresholds on the larger scale.
At the cap's own scale , apply the contraction principle for large deviations to the map . The output has good rate function
At the cost is . Thus the burstiness of queue input has been reduced in its sufficiently large positive tail, while its smaller-scale rare fluctuations persist. These are the moderate deviation scales of a clipped Poisson aggregate.
Figure 1.
Exponential-mean minimum costs, moment optimization, and the moderate-deviation rate of clipped Poisson input
. Details.