Skip to content

Queueing TheoryΒΆ

← Back to Domain-Specific Abstractions by Domain

2 domain-specific abstractions whose origin domain is Queueing Theory.

  • Lindley equation β€” The reflected random-walk recursion W_(n+1)=max(0,W_n+X_n), canonically describing successive waiting times in a single-server queue.
  • Polling system β€” A queueing system in which one server visits multiple queues according to a routing rule and applies a declared service discipline at each visit.