The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A Minimum Delay Routing Algorithm Using Distributed Computation
Abstract
An algorithm is defined for establishing routing tables in the individual nodes of a data network. The routing table at a nodeispecifies, for each other nodej, what fraction of the traffic destined for nodejshould leave nodeion each of the links emanating from nodei. The algorithm is applied independently at each node and successively updates the routing table at that node based on information communicated between adjacent nodes about the marginal delay to each destination. For stationary input traffic statistics, the average delay per message through the network converges, with successive updates of the routing tables, to the minimum average delay over all routing assignments. The algorithm has the additional property that the traffic to each destination is guaranteed to be loop free at each iteration of the algorithm. In addition, a new global convergence theorem for noncontinuous iteration algorithms is developed.
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
Pigou, A. C. (1933) · The Economic Journal · doi:10.2307/2224491 · Cited by 5,137
Cited by
Distributed asynchronous deterministic and stochastic gradient optimization algorithms
Tsitsiklis, J., Bertsekas, D., & Athans, M. (1986) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1986.1104412 · Cited by 1,967
DTN routing as a resource allocation problem
Balasubramanian, A., Levine, B., & Venkataramani, A. (2007) · Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1282380.1282422 · Cited by 947
Collective patterns and decision-making
Deneubourg, J. L., & Goss, S. (1989) · Ethology Ecology & Evolution · doi:10.1080/08927014.1989.9525500 · Cited by 672
Selfish Routing and the Price of Anarchy
(2016) · Twenty Lectures on Algorithmic Game Theory · doi:10.1017/cbo9781316779309.012 · Cited by 647
Wellman, M. P. (1993) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2 · Cited by 526
Metadata
- Authors
- Gallager, R.
- Venue
- IEEE Transactions on Communications
- Published
- 1977-01
- Volume
- 25
- Issue
- 1
- Pages
- 73-85
- ISSN
- 0096-2244 (ISSN-L)
- OpenAlex
- W1997996213
- Cited by
- 651
- References
- 1
- FWCI
- 17.80
- 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: A Minimum Delay Routing Algorithm Using Distributed Computation. https://app.cochat.ai/papers/10.1109/tcom.1977.1093711
- The paper
- Gallager, R. (1977). A Minimum Delay Routing Algorithm Using Distributed Computation. IEEE Transactions on Communications. https://doi.org/10.1109/tcom.1977.1093711
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.