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

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

A measurement-based admission control algorithm for integrated services packet networks

Jamin, Sugih, Danzig, Peter B., Shenker, Scott, Zhang, Lixia · 1995 · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication

Abstract

Many designs for integrated service networks offer a bounded delay packet delivery service to support real-time applications. To provide bounded delay service, networks must use admission control to regulate their load. Previous work on admission control mainly focused on algorithms that compute the worst case theoretical queueing delay to guarantee an absolute delay bound for all packets. In this paper we describe a measurement-based admission control algorithm for predictive service, which allows occasional delay violations. We have tested our algorithm through simulations on a wide variety of network topologies and driven with various source models, including some that exhibit long-range dependence, both in themselves and in their aggregation. Our simulation results suggest that, at least for the scenarios studied here, the measurement-based approach combined with the relaxed service commitment of predictive service enables us to achieve a high level of network utilization while still reliably meeting the delay bound.

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.1145/217382.217396

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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

Cites

Cited by

See all 237

Metadata

Authors
Jamin, S., Danzig, P. B., Shenker, S., & Zhang, L.
Venue
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Publisher
ACM
Published
1995-10
Pages
2-13
OpenAlex
W2148810932
Cited by
237
References
1
FWCI
12.73
Type
conference paper
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: A measurement-based admission control algorithm for integrated services packet networks. https://app.cochat.ai/papers/10.1145/217382.217396
The paper
Jamin, S., Danzig, P. B., Shenker, S., & Zhang, L. (1995). A measurement-based admission control algorithm for integrated services packet networks. Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication. https://doi.org/10.1145/217382.217396

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.