Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 175

The DOI matches its Crossref record.

Neural networks for routing communication traffic

Rauch, H.E., Winarske, T.·1988·IEEE Control Systems Magazine

Abstract

The use of neural network computational algorithms to determine optimal traffic routing for communication networks is introduced. The routing problem requires choosing multilink paths for node-to-node traffic to minimize loss, which is represented by expected delay or some other function of traffic. The minimization procedure is implemented using a modification of the neural network traveling-salesman algorithm. Illustrative simulation results on a minicomputer show reasonable convergence in 250 iterations for a 16-node network with up to four links from origin to destination.>

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/37.1870

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.

A few free checks a day · papers already verified open instantly · results are public

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

See all 175

Metadata

Authors
Rauch, H. E., & Winarske, T.
Venue
IEEE Control Systems Magazine
Published
1988-04
Volume
8
Issue
2
Pages
26-31
ISSN
0272-1708 (ISSN-L)
OpenAlex
W2153792349
Cited by
175
References
0
FWCI
5.41
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 routing communication traffic. https://app.cochat.ai/papers/10.1109/37.1870
The paper
Rauch, H. E., & Winarske, T. (1988). Neural networks for routing communication traffic. IEEE Control Systems Magazine. https://doi.org/10.1109/37.1870

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.