The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Supporting real-time applications in an Integrated Services Packet Network: architecture and mechanism
Abstract
This paper considers the support of real-time applications in an Integrated Services Packet Network (ISPN). We first review the characteristics of real-time applications. We observe that, contrary to the popular view that real-time applications necessarily require a fixed delay bound, some real-time applications are more flexible and can adapt to current network conditions. We then propose an ISPN architecture that supports two distinct kinds of real-time service: guaranteed service, which is the traditional form of real-time service discussed in most of the literature and involves pre-computed worst-case delay bounds, and predicted service which uses the measure performance of the network in computing delay bounds. We then propose a packet scheduling mechanism that can support both of these real-time services as well as accommodate datagram traffic. We also discuss two other aspects of an overall ISPN architecture: the service interface and the admission control criteria.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Scheduling algorithms for multiprogramming in a hard-real-time environment
Liu, C. L., & Layland, J. W. (1973) · Journal of the ACM · doi:10.1145/321738.321743 · Cited by 8,433
Parekh, A. K., & Gallager, R. G. (1993) · IEEE/ACM Transactions on Networking · doi:10.1109/90.234856 · Cited by 3,705
Analysis and simulation of a fair queueing algorithm
Demers, A., Keshav, S., & Shenker, S. (1989) · ACM SIGCOMM Computer Communication Review · doi:10.1145/75247.75248 · Cited by 2,614
Self-citationAnalysis and simulation of a fair queueing algorithm
Demers, A., Keshav, S., & Shenker, S. (1989) · Symposium proceedings on Communications architectures & protocols · doi:10.1145/75246.75248 · Cited by 1,729
Self-citationEquivalent 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
VirtualClock: a new traffic control algorithm for packet-switched networks
Zhang, L. (1991) · ACM Transactions on Computer Systems · doi:10.1145/103720.103721 · Cited by 509
Self-citationDelay jitter control for real-time communication in a packet switching network
Verma, D. C., Zhang, H., & Ferrari, D. (2002) · IEEE Conference on Communications Software: Communications for Distributed Applications and Systems (TRICOMM) · doi:10.1109/tricom.1991.152873 · Cited by 227
A new architecture for packet switching network protocols
Zhang, L. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 192
Self-citationDelay jitter control scheme for packet-switching internetworks
Ferrari, D. (1992) · Computer Communications · doi:10.1016/0140-3664(92)90011-3 · Cited by 59
Design and applications of a delay jitter control scheme for packet-switching internetworks
Ferrari, D. (1992) · Lecture notes in computer science · doi:10.1007/3-540-55639-7_7 · Cited by 53
Cited by
Random early detection gateways for congestion avoidance
Floyd, S., & Jacobson, V. (1993) · IEEE/ACM Transactions on Networking · doi:10.1109/90.251892 · Cited by 6,290
“Not only is FIFO scheduling useful for sharing delay among connections , reducing delay for a particular connection during its periods of burstiness [4], but it scales well and i s easy to implement efficiently.”
BackgroundWide 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
Integrated Services in the Internet Architecture: an Overview
Braden, R., Clark, D., & Shenker, S. (1994) · doi:10.17487/rfc1633 · Cited by 3,145
Self-citationSome computer science issues in ubiquitous computing
Weiser, M. (1993) · Communications of the ACM · doi:10.1145/159544.159617 · Cited by 2,373
Metadata
- Authors
- Clark, D. D., Shenker, S., & Zhang, L.
- Venue
- Conference proceedings on Communications architectures & protocols - SIGCOMM '92
- Publisher
- ACM Press
- Published
- 1992
- Pages
- 14-26
- OpenAlex
- W2104820473
- Cited by
- 851
- References
- 11
- FWCI
- 36.46
- 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
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.