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

The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.

A distributed routing algorithm for datagram traffic in LEO satellite networks

Ekici, E., Akyildiz, I.F., Bender, M.D. · 2001 · IEEE/ACM Transactions on Networking

Abstract

Satellite networks provide global coverage and support a wide range of services, low Earth orbit (LEO) satellites provide short round-trip delays and are becoming increasingly important. One of the challenges in LEO satellite networks is the development of specialized and efficient routing algorithms. In this work, a datagram routing algorithm for LEO satellite networks is introduced. The algorithm generates minimum propagation delay paths. The performance of the algorithm is evaluated through simulations. The robustness issues of the algorithm are also discussed.

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.

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

Integrity signals

Registry

Crossref · 10.1109/90.917071

Cites

5 of 5 references verified0 citation errors · 0 not checkable

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.

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

Cites

Show all 5 references

Cited by

See all 438

Metadata

Authors
Ekici, E., Akyildiz, I. F., & Bender, M. D.
Venue
IEEE/ACM Transactions on Networking
Published
2001-04
Volume
9
Issue
2
Pages
137-147
ISSN
1063-6692 (ISSN-L)
OpenAlex
W2109495845
Cited by
438
References
5
FWCI
26.08
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 distributed routing algorithm for datagram traffic in LEO satellite networks. https://app.cochat.ai/papers/10.1109/90.917071
The paper
Ekici, E., Akyildiz, I. F., & Bender, M. D. (2001). A distributed routing algorithm for datagram traffic in LEO satellite networks. IEEE/ACM Transactions on Networking. https://doi.org/10.1109/90.917071

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.