The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Multi-constrained optimal path selection
Abstract
Providing quality-of-service (QoS) guarantees in packet networks gives rise to several challenging issues. One of them is how to determine a feasible path that satisfies a set of constraints while maintaining high utilization of network resources. The latter objective implies the need to impose an additional optimality requirement on the feasibility problem. This can be done through a primary cost function (e.g., administrative weight, hop count) according to which the selected feasible path is optimal. In general, multi-constrained path selection, with or without optimization, is an NP-complete problem that cannot be exactly solved in polynomial-time. Heuristics and approximation algorithms with polynomial and pseudo-polynomial-time complexities are often used to deal with this problem. However, existing solutions suffer either from excessive computational complexities that cannot be used for online network operation or from low performance. Moreover, they only deal with special cases of the problem (e.g., two constraints without optimization, one constraint with optimization, etc.). For the feasibility problem under multiple constraints, some researchers have proposed a nonlinear cost function whose minimization provides a continuous spectrum of solutions ranging from a generalized linear approximation (GLA) to an asymptotically exact solution. We propose an efficient heuristic algorithm for the most general form of the problem. We first formalize the theoretical properties of the above nonlinear cost function. We then introduce our heuristic algorithm (H MCOP), which attempts to minimize both the nonlinear cost function (for the feasibility part) and the primary cost function (for the optimality part). We prove that H MCOP guarantees at least the performance of GLA and often improves upon it. H MCOP has the same order of complexity as Dijkstra's algorithm. Using extensive simulations on random graphs with correlated and uncorrelated link weights, we show that under the same level of computational complexity, H MCOP outperforms its (less general) contenders in its success rate in finding feasible paths and in the cost of such paths.
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
(1979) · Cited by 43,841
Network Flows: Theory, Algorithms, and Applications.
Smith, D. K., Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1994) · The Journal of the Operational Research Society · doi:10.2307/2583863 · Cited by 8,034
Routing of multipoint connections
Waxman, B. M. (1988) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.12889 · Cited by 2,885
Network flows: Theory, algorithms and applications
(1994) · Discrete Applied Mathematics · doi:10.1016/0166-218x(94)90171-6 · Cited by 2,585
Introduction to algorithms: 4. Turtle graphics
Shyamasundar, R. K. (1996) · Resonance · doi:10.1007/bf02837777 · Cited by 1,467
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
Chen, S., & Nahrstedt, K. (1998) · IEEE Network · doi:10.1109/65.752646 · Cited by 874
Xiao, X., & Ni, L. M. (1999) · IEEE Network · doi:10.1109/65.768484 · Cited by 771
A Framework for QoS-based Routing in the Internet
Crawley, E., Nair, R., Rajagopalan, B., & Sandick, H. (1998) · doi:10.17487/rfc2386 · Cited by 647
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
A dual algorithm for the constrained shortest path problem
Handler, G. Y., & Zang, I. (1980) · Networks · doi:10.1002/net.3230100403 · Cited by 457
Eppstein, D. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365697 · Cited by 329
The network inhibition problem
Phillips, C. A. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167286 · Cited by 236
A distributed algorithm for delay-constrained unicast routing
Salama, H. F., Reeves, D. S., & Viniotis, Y. (2002) · Proceedings of INFOCOM '97 · doi:10.1109/infcom.1997.635117 · Cited by 168
Shortest chain subject to side constraints
Aneja, Y. P., Aggarwal, V., & Nair, K. P. K. (1983) · Networks · doi:10.1002/net.3230130212 · Cited by 140
Cited by
Cloud computing service composition: A systematic literature review
Jula, A., Sundararajan, E., & Othman, Z. (2014) · Expert Systems with Applications · doi:10.1016/j.eswa.2013.12.017 · Cited by 402
Modeling the commute mode share of transit using continuous accessibility to jobs
Owen, A., & Levinson, D. M. (2015) · Transportation Research Part A: Policy and Practice · doi:10.1016/j.tra.2015.02.002 · Cited by 279
Concepts of Exact QoS Routing Algorithms
VanMieghem, P., & Kuipers, F. A. (2004) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2004.836112 · Cited by 265
SDN-based game-aware network management for cloud gaming
Amiri, M., Al Osman, H., Shirmohammadi, S., & Abdallah, M. (2015) · 2015 International Workshop on Network and Systems Support for Games (NetGames) · doi:10.1109/netgames.2015.7382989 · Cited by 10
Metadata
- Authors
- Korkmaz, T., & Krunz, M.
- Venue
- Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213)
- Publisher
- IEEE
- Published
- 2002-11-13
- Volume
- 2
- Pages
- 834-843
- OpenAlex
- W2148837283
- Cited by
- 399
- References
- 15
- FWCI
- 14.27
- 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.