admission-control · shipping · also work admission

Admission control

Admission control applies a policy at a specified boundary to decide whether new work may enter a resource or service stage.

Related Observatory article: Read on hesela.com

Local decision: A SEDA stage can reject enqueueing while the upstream stage chooses an alternative, such as waiting, redirecting or returning an error. Rejection by one queue is not necessarily rejection of the whole user request. [1]

Feedback: Adaptive overload control can adjust admission using observed response times. The USITS 2003 controller targeted the 90th percentile with a token bucket and additive-increase/multiplicative-decrease updates. Its tuning and application experiments do not establish a universal deadline guarantee. [2]

Accounting: Name the admission boundary and retain offered, accepted, rejected and unfinished request counts. A latency distribution of successful completions alone excludes rejected work; moving the observation boundary changes the question. [2]

Relations

related
Backpressure, Queue depth, Coordinated omission

Citations

  1. Welsh, Culler and Brewer: SEDA, SOSP 2001, section 3.3 (finite event queues and overload responses). (accessed 2026-11-20)
  2. Welsh and Culler: Adaptive Overload Control for Busy Internet Servers, USITS 2003, sections 2.3, 3.2 and 4.4. (accessed 2026-11-20)
Sources & caveats
  • The 2003 paper evaluates a Web-based email service and a dynamic Web benchmark, not storage-device throughput.
  • The accounting recommendation is an engineering inference from the paper's separate response-time and rejection reporting.

JSON: /data/terms/admission-control.json

Published by Hesela team · Updated

Report a correction · Editorial standards · Reuse guidance

Cite this page
Hesela team. Admission control. Hesela. 2026-11-20. https://hesela.dev/terms/admission-control/