Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 410

The DOI matches its Crossref record.

Optimal control of admission to a quenching system

Stidham, S.·1985·IEEE Transactions on Automatic Control

Abstract

Congestion in a queueing system can sometimes be controlled by restricting arrivals, either by "closing a gate" or by charging an entrance fee or toll. We review both static (open-loop) and dynamic (closed-loop) models for control of admission to a queueing system. The main emphases are on the difference between socially optimal and individually optimal (equilibrium) controls and on the use of dynamic-programming inductive analysis to show that an optimal control is monotonic or characterized by one or more "critical numbers." We discuss the potential for use of these models in the analysis of computer/ communication systems and compare the results to certain others in the literature.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tac.1985.1104054

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 410

Metadata

Authors
Stidham, S.
Venue
IEEE Transactions on Automatic Control
Published
1985-08
Volume
30
Issue
8
Pages
705-713
ISSN
0018-9286 (ISSN-L)
OpenAlex
W2161869110
Cited by
410
References
0
FWCI
21.65
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Optimal control of admission to a quenching system. https://app.cochat.ai/papers/10.1109/tac.1985.1104054
The paper
Stidham, S. (1985). Optimal control of admission to a quenching system. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.1985.1104054

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.