The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Neural networks for shortest path computation and routing in computer networks
Abstract
The application of neural networks to the optimum routing problem in packet-switched computer networks, where the goal is to minimize the network-wide average time delay, is addressed. Under appropriate assumptions, the optimum routing algorithm relies heavily on shortest path computations that have to be carried out in real time. For this purpose an efficient neural network shortest path algorithm that is an improved version of previously suggested Hopfield models is proposed. The general principles involved in the design of the proposed neural network are discussed in detail. Its computational power is demonstrated through computer simulations. One of the main features of the proposed model is that it will enable the routing algorithm to be implemented in real time and also to be adaptive to changes in link costs and network topology.
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
Neural networks and physical systems with emergent collective computational abilities.
Hopfield, J. J. (1982) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.79.8.2554 · Cited by 19,270
Hopfield, J. J. (1984) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.81.10.3088 · Cited by 6,918
“Neural” computation of decisions in optimization problems
Hopfield, J. J., & Tank, D. W. (1985) · Biological Cybernetics · doi:10.1007/bf00339943 · Cited by 6,031
Bertsekas, D. P., & Gallager, R. G. (1987) · Cited by 5,561
Advances in Neural Information Processing Systems 37
(2024) · doi:10.52202/079017 · Cited by 2,791
Tank, D., & Hopfield, J. (1986) · IEEE Transactions on Circuits and Systems · doi:10.1109/tcs.1986.1085953 · Cited by 2,194
Telecommunication networks: protocols, modeling and analysis
Schwartz, M. (1986) · Addison-Wesley Longman Publishing Co., Inc. eBooks · Cited by 897
On the stability of the Travelling Salesman Problem algorithm of Hopfield and Tank
Wilson, G. V., & Pawley, G. S. (1988) · Biological Cybernetics · doi:10.1007/bf00363956 · Cited by 546
Neural networks for computation: number representations and programming complexity
Takeda, M., & Goodman, J. W. (1986) · Applied Optics · doi:10.1364/ao.25.003033 · Cited by 213
Neural networks for routing communication traffic
Rauch, H. E., & Winarske, T. (1988) · IEEE Control Systems Magazine · doi:10.1109/37.1870 · Cited by 175
Cited by
Fadlullah, Z. M., Tang, F., Mao, B., Kato, N., Akashi, O., Inoue, T., & Mizutani, K. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2707140 · Cited by 810
A genetic algorithm for shortest path routing problem and the sizing of populations
Ahn, C. W., & Ramakrishna, R. S. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2002.804323 · Cited by 683
Ahn, C. W., & Ramakrishna, R. S. (2004) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2003.822000 · Cited by 68
Metadata
- Authors
- Ali, M. K. M., & Kamoun, F.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 1993
- Volume
- 4
- Issue
- 6
- Pages
- 941-954
- ISSN
- 1045-9227 (ISSN-L)
- OpenAlex
- W2128110222
- Cited by
- 272
- References
- 14
- FWCI
- 2.47
- 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: Neural networks for shortest path computation and routing in computer networks. https://app.cochat.ai/papers/10.1109/72.286889
- The paper
- Ali, M. K. M., & Kamoun, F. (1993). Neural networks for shortest path computation and routing in computer networks. IEEE Transactions on Neural Networks. https://doi.org/10.1109/72.286889
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.