The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Concepts of Exact QoS Routing Algorithms
Open accessAbstract
The underlying concepts of an exact QoS routing algorithm are explained. We show that these four concepts, namely 1) nonlinear definition of the path length; 2) a /spl kappa/-shortest path approach; 3) nondominance; and 4) look-ahead, are fundamental building blocks of a multiconstrained routing algorithm. The main reasons to consider exact multiconstrained routing algorithms are as follows. First, the NP-complete behavior seems only to occur in specially constructed graphs, which are unlikely to occur in realistic communication networks. Second, there exist exact algorithms that are equally complex as heuristics in algorithmic structure and in running time on topologies that do not induce NP-complete behavior. Third, by simply restricting the number /spl kappa/ of paths explored during the path computation, the computational complexity can be decreased at the expense of possibly loosing exactness. The presented four concepts are incorporated in SAMCRA, a self-adaptive multiple constraints routing algorithm.
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
Bollobás, B. (1985) · Cited by 6,196
Bollobás, B. (2001) · doi:10.1017/cbo9780511814068 · Cited by 2,639
Computer Solutions of the Traveling Salesman Problem
Lin, S. (1965) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1965.tb04146.x · Cited by 1,986
Quality-of-service routing for supporting multimedia applications
Wang, Z., & Crowcroft, J. (1996) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.536364 · Cited by 1,626
Internet traffic engineering by optimizing OSPF weights
Fortz, B., & Thorup, M. (2002) · Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064) · doi:10.1109/infcom.2000.832225 · Cited by 1,110
Shortest paths algorithms: Theory and experimental evaluation
Cherkassky, B. V., Goldberg, A. V., & Radzik, T. (1996) · Mathematical Programming · doi:10.1007/bf02592101 · Cited by 743
Approximation Schemes for the Restricted Shortest Path Problem
Hassin, R. (1992) · Mathematics of Operations Research · doi:10.1287/moor.17.1.36 · Cited by 557
Multi-constrained optimal path selection
Korkmaz, T., & Krunz, M. (2002) · Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213) · doi:10.1109/infcom.2001.916274 · Cited by 399
The shortest path problem with two objective functions
Henig, M. I. (1986) · European Journal of Operational Research · doi:10.1016/0377-2217(86)90092-5 · Cited by 193
A*Prune: an algorithm for finding K shortest paths subject to multiple constraints
Liu, G., & Ramakrishnan, K. G. (2002) · Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213) · doi:10.1109/infcom.2001.916263 · Cited by 186
Buckets, Heaps, Lists, and Monotone Priority Queues
Cherkassky, B. V., Goldberg, A. V., & Silverstein, C. D. (1999) · SIAM Journal on Computing · doi:10.1137/s0097539796313490 · Cited by 82
The impact of correlated link weights on QoS routing
Kuipers, F. A., & Mieghem, P. V. (2003) · doi:10.1109/infcom.2003.1208978 · Cited by 43
Self-citation
Cited by
OpenNetMon: Network monitoring in OpenFlow Software-Defined Networks
van Adrichem, N. L. M., Doerr, C., & Kuipers, F. A. (2014) · 2014 IEEE Network Operations and Management Symposium (NOMS) · doi:10.1109/noms.2014.6838228 · Cited by 456
Self-citationAnt colony optimization for QoE-centric flow routing in software-defined networks
Dobrijevic, O., Santl, M., & Matijasevic, M. (2015) · 2015 11th International Conference on Network and Service Management (CNSM) · doi:10.1109/cnsm.2015.7367371 · Cited by 44
Metadata
- Authors
- VanMieghem, P., & Kuipers, F. A.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2004-10
- Volume
- 12
- Issue
- 5
- Pages
- 851-864
- ISSN
- 1063-6692 (ISSN-L)
- OpenAlex
- W2119775299
- Cited by
- 265
- References
- 16
- FWCI
- 17.28
- Type
- journal article
- Language
- en
- Open access
- green
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.