For nondecreasing compound Poisson input , let and . The second supremum is bounded above by the first. For each , the next grid point is at most later, its input is at least , and it offers at most an extra service. Hence . When the workload is finite almost surely, these inequalities give stationary-tail brackets. If its logarithmic exponential tail rate exists, adding the bounded shift does not change that rate.

Articles by others on the same topic (0)

There are currently no matching articles.