The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
A measurement-based admission control algorithm for integrated service packet networks
Abstract
Many designs for integrated services networks offer a bounded delay packet delivery service to support real-time applications. To provide a 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 (ACA) 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 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.
Integrity signals
Registry
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.
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
Time Series Analysis: Forecasting and Control
Geurts, M., Box, G. E. P., & Jenkins, G. M. (1977) · Journal of Marketing Research · doi:10.2307/3150485 · Cited by 19,186
On the self-similar nature of Ethernet traffic (extended version)
Leland, W. E., Taqqu, M. S., Willinger, W., & Wilson, D. V. (1994) · IEEE/ACM Transactions on Networking · doi:10.1109/90.282603 · Cited by 5,233
Wide area traffic: the failure of Poisson modeling
Paxson, V., & Floyd, S. (1995) · IEEE/ACM Transactions on Networking · doi:10.1109/90.392383 · Cited by 3,708
Parekh, A. K., & Gallager, R. G. (1993) · IEEE/ACM Transactions on Networking · doi:10.1109/90.234856 · Cited by 3,705
Statistics for Long-Memory Processes.
Ray, W. D., & Beran, J. (1996) · Journal of the Royal Statistical Society. Series A (Statistics in Society) · doi:10.2307/2983481 · Cited by 2,686
Willinger, W., Taqqu, M. S., Sherman, R., & Wilson, D. V. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.554723 · Cited by 1,654
Equivalent capacity and its application to bandwidth allocation in high-speed networks
Guerin, R., Ahmadi, H., & Naghshineh, M. (1991) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.103545 · Cited by 1,311
A scheme for real-time channel establishment in wide-area networks
Ferrari, D., & Verma, D. C. (1990) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.53013 · Cited by 1,029
Analysis, modeling and generation of self-similar VBR video traffic
Garrett, M. W., & Willinger, W. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/190809.190339 · Cited by 953
Clark, D. D., Shenker, S., & Zhang, L. (1992) · Conference proceedings on Communications architectures & protocols - SIGCOMM '92 · doi:10.1145/144179.144199 · Cited by 851
Self-citation
Cited by
Willinger, W., Taqqu, M. S., Sherman, R., & Wilson, D. V. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.554723 · Cited by 1,654
Managing energy and server resources in hosting centers
Chase, J. S., Anderson, D. C., Thakar, P. N., Vahdat, A. M., & Doyle, R. P. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502045 · Cited by 1,284
Bulusu, N., Heidemann, J., & Estrin, D. (2002) · Proceedings 21st International Conference on Distributed Computing Systems · doi:10.1109/icdsc.2001.918979 · Cited by 289
Managing energy and server resources in hosting centers
Chase, J. S., Anderson, D. C., Thakar, P. N., Vahdat, A. M., & Doyle, R. P. (2001) · ACM SIGOPS Operating Systems Review · doi:10.1145/502059.502045 · Cited by 288
Metadata
- Authors
- Jamin, S., Danzig, P. B., Shenker, S. J., & Zhang, L.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 1997
- Volume
- 5
- Issue
- 1
- Pages
- 56-70
- ISSN
- 1063-6692 (ISSN-L)
- OpenAlex
- W2126421073
- Cited by
- 382
- References
- 17
- FWCI
- 41.87
- 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: A measurement-based admission control algorithm for integrated service packet networks. https://app.cochat.ai/papers/10.1109/90.554722
- The paper
- Jamin, S., Danzig, P. B., Shenker, S. J., & Zhang, L. (1997). A measurement-based admission control algorithm for integrated service packet networks. IEEE/ACM Transactions on Networking. https://doi.org/10.1109/90.554722
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.