Beneš method

Uses your system voice; voice and rate in settings.

Snapshot

≈ 1 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In queueing theory, a discipline within the mathematical theory of probability, Beneš approach or Beneš method is a result for an exact or good approximation to the probability distribution of queue length. It was introduced by Václav E. Beneš in 1963.

In queueing theory, a discipline within the mathematical theory of probability, Beneš approach or Beneš method is a result for an exact or good approximation to the probability distribution of queue length. It was introduced by Václav E. Beneš in 1963.

Overview

The method introduces a quantity referred to as the "virtual waiting time" to define the remaining workload in the queue at any time. This process is a step function which jumps upward with new arrivals to the system and otherwise is linear with negative gradient. By giving a relation for the distribution of unfinished work in terms of the excess work, the difference between arrivals and potential service capacity, it turns a time-dependent virtual waiting time problem into "an integral that, in principle, can be solved."

References

Text derived from https://en.wikipedia.org/w/index.php?oldid=1303073896 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001303073896 · captured 1753740198.0 · version history

Cite this page as: encyclopegia.org, “Beneš method”, snapshot enwiki-001303073896. https://encyclopegia.org/a/bene-method

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.