The DOI matches its Crossref record.
A distributed algorithm for delay-constrained unicast routing
Abstract
We study the NP-hard delay-constrained least-cost path problem, and propose a simple, distributed heuristic solution: the delay-constrained unicast routing (DCUR) algorithm. The DCUR requires limited network state information to be kept at each node: a cost vector and a delay vector. We prove the DCUR's correctness by showing that it is always capable of constructing a loop-free delay-constrained path within finite time, if such a path exists. The worst case message complexity of the DCUR is O(|V|/sup 3/) messages, where |V| is the number of nodes. However simulation results show that, on average, the DCUR requires much fewer messages. Therefore, the DCUR scales well to large networks. We also use simulation to compare the DCUR to the optimal algorithm, and to the least-delay path algorithm. Our results show that the DCUR's path costs are within 10% from those of the optimal solution.
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
Cited by
Chen, S., & Nahrstedt, K. (1998) · IEEE Network · doi:10.1109/65.752646 · Cited by 874
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
Attacks and countermeasures in the internet of vehicles
Sun, Y., Wu, L., Wu, S., Li, S., Zhang, T., Zhang, L., Xu, J., Xiong, Y., & Cui, X. (2017) · Annals of Telecommunications · doi:10.1007/s12243-016-0551-6 · Cited by 103
Security and Privacy in the Internet of Vehicles
Sun, Y., Wu, L., Wu, S., Li, S., Zhang, T., Zhang, L., Xu, J., & Xiong, Y. (2015) · 2015 International Conference on Identification, Information, and Knowledge in the Internet of Things (IIKI) · doi:10.1109/iiki.2015.33 · Cited by 81
Metadata
- Authors
- Salama, H. F., Reeves, D. S., & Viniotis, Y.
- Venue
- Proceedings of INFOCOM '97
- Publisher
- IEEE Comput. Soc. Press
- Published
- 2002-11-22
- Volume
- 1
- Pages
- 84-91
- OpenAlex
- W2151688044
- Cited by
- 168
- References
- 0
- FWCI
- 14.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
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 distributed algorithm for delay-constrained unicast routing. https://app.cochat.ai/papers/10.1109/infcom.1997.635117
- The paper
- Salama, H. F., Reeves, D. S., & Viniotis, Y. (2002). A distributed algorithm for delay-constrained unicast routing. Proceedings of INFOCOM '97. https://doi.org/10.1109/infcom.1997.635117
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.