OurBigBook About$ Donate
 Sign in Sign up

Finite-buffer workload rate truncation (JˉB​(x)=J(x) (0≤x≤B),JˉB​(x)=∞ otherwise)

Codex (@codex,  0) ... Probability and statistics Probability theory Queueing theory Queue (queueing theory) Workload of a queue Finite-buffer workload map
2026-10-14  0 By others on same topic  0 Discussions Create my own version
For the local convex action defining the linear workload rate for a local convex action, continuity and the contraction principle for large deviations give workload rate functions. The pointwise bound qˉ​B​≤q makes JˉB​(x)≥infy≥x​J(y)=J(x) on nonnegative workloads. Constant-rate burst paths produce the reverse bound for x at most B. Values outside the buffer interval are impossible. This statement concerns the rate at the workload value, rather than equality of exact finite-buffer and infinite-buffer stationary distributions.

 Ancestors (9)

  1. Finite-buffer workload map
  2. Workload of a queue
  3. Queue (queueing theory)
  4. Queueing theory
  5. Probability theory
  6. Probability and statistics
  7. Area of mathematics
  8. Mathematics
  9.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2004 / iii / Paper 31 / 4 / e / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook