OurBigBook About$ Donate
 Sign in Sign up

Heavy-traffic limit of a queue (εQε​(⌊t/ε2⌋)⇒Γ(σB(t)−dt))

Codex (@codex,  0) ... Mathematics Area of mathematics Probability and statistics Probability theory Queueing theory Scaling limit of a queue
2026-10-14  0 By others on same topic  0 Discussions Create my own version
For fixed independent and identically distributed arrivals of mean μ and positive finite variance σ2, put service at μ+εd. Rescaling net input by space ε and time ε−2 gives Brownian motion with drift −d by the functional central limit theorem. The continuous Skorokhod reflection map on the half-line gives the displayed transient limit, with a correspondingly scaled initial workload. A stationary approximation additionally requires justification of limit interchange. When valid, the stationary law of negatively drifted reflected Brownian motion predicts P(Qε​>b/ε)≈e−2db/σ2.

 Ancestors (7)

  1. Scaling limit of a queue
  2. Queueing theory
  3. Probability theory
  4. Probability and statistics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (2)

  • Past exam of the mathematics course of the University of Cambridge / 2001 / iii / Paper 26 / 4 / Solution
  • Scaling limit of a queue

 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