The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
An overview of quality of service routing for next-generation high-speed networks: problems and solutions
Abstract
The upcoming gigabit-per-second high-speed networks are expected to support a wide range of communication-intensive real-time multimedia applications. The requirement for timely delivery of digitized audio-visual information raises new challenges for next-generation integrated services broadband networks. One of the key issues is QoS routing. It selects network routes with sufficient resources for the requested QoS parameters. The goal of routing solutions is twofold: (1) satisfying the QoS requirements for every admitted connection, and (2) achieving global efficiency in resource utilization. Many unicast/multicast QoS routing algorithms have been published, and they work with a variety of QoS requirements and resource constraints. Overall, they can be partitioned into three broad classes: (1) source routing, (2) distributed routing, and (3) hierarchical routing algorithms. We give an overview of the QoS routing problem as well as the existing solutions. We present the strengths and weaknesses of different routing strategies, and outline the challenges. We also discuss the basic algorithms in each class, classify and compare them, and point out possible future directions in the QoS routing area.
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
(1979) · Cited by 43,841
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 24,043
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
Shortest Connection Networks And Some Generalizations
Prim, R. C. (1957) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1957.tb01515.x · Cited by 4,565
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
Border Gateway Protocol 3 (BGP-3)
Lougheed, K., & Rekhter, Y. (1991) · doi:10.17487/rfc1267 · Cited by 1,977
Analysis 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
A fast algorithm for Steiner trees
Kou, L., Markowsky, G., & Berman, L. (1981) · Acta Informatica · doi:10.1007/bf00288961 · Cited by 1,188
Multicast routing in datagram internetworks and extended LANs
Deering, S. E., & Cheriton, D. R. (1990) · ACM Transactions on Computer Systems · doi:10.1145/78952.78953 · Cited by 1,173
A self-clocked fair queueing scheme for broadband applications
Golestani, S. J. (2002) · Proceedings of INFOCOM '94 Conference on Computer Communications · doi:10.1109/infcom.1994.337677 · Cited by 1,100
Cited by
Swarm intelligence for routing in communication networks
Kassabalidis, I., El-Sharkawi, M. A., Marks, R. J., Arabshahi, P., & Gray, A. A. (2002) · GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270) · doi:10.1109/glocom.2001.966355 · Cited by 200
Metadata
- Authors
- Chen, S., & Nahrstedt, K.
- Venue
- IEEE Network
- Published
- 1998
- Volume
- 12
- Issue
- 6
- Pages
- 64-79
- ISSN
- 0890-8044 (ISSN-L)
- OpenAlex
- W2112169033
- Cited by
- 874
- References
- 16
- FWCI
- 36.27
- 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: An overview of quality of service routing for next-generation high-speed networks: problems and solutions. https://app.cochat.ai/papers/10.1109/65.752646
- The paper
- Chen, S., & Nahrstedt, K. (1998). An overview of quality of service routing for next-generation high-speed networks: problems and solutions. IEEE Network. https://doi.org/10.1109/65.752646
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.
