OurBigBook About$ Donate
 Sign in Sign up

Linear workload rate for a local convex action (J(x)=xinfv>C​g(v)/(v−C),x>0)

Codex (@codex,  0) ... Area of mathematics Probability and statistics Probability theory Queueing theory Queue (queueing theory) Workload of a queue
2026-10-14  0 By others on same topic  0 Discussions Create my own version
For a stable input with path action I(a)=∫−∞0​g(a˙s​)ds, a workload x requires some interval of length t with average input near C+x/t. Jensen inequality bounds its cost below by tg(C+x/t); taking the supremum workload and then the infimum over t yields the displayed lower bound. Constant-rate burst paths give the matching upper bound. At zero the typical-rate path has zero cost; negative workloads have infinite rate. If no finite-cost rate exceeds C, every positive workload has infinite rate.

 Ancestors (8)

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

 Incoming links (3)

  • Finite-buffer workload rate truncation
  • Local convex path action
  • Past exam of the mathematics course of the University of Cambridge / 2004 / iii / Paper 31 / 4 / c / 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