Effects of leaky bucket parameters on the average queueing delay: worst case analysis

Abstract

Studies a single server queueing system with deterministic service time in which arrivals are regulated by the leaky-bucket control. The worst traffic of arrivals passing the leaky-bucket regulation is discussed. The performance measure considered is queueing delay averaged over all packets. The worst traffic is characterized as the repetition of the following three phases: bulky arrival with bulk size related to the bucket size, arrival at every token generation for a specified length of interval, and then no arrival till the token bucket is full. The average queueing delay for the worst traffic, i.e. tight performance bound, is expressed in explicit form as a function of leaky bucket parameters (bucket size and token generation rate). The authors expect that this function will provide insights into the relationship between leaky bucket parameters and the corresponding network resources allocated.>

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 20 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.