The DOI matches its Crossref record.
Routing Information Protocol
Open accessAbstract
Status of this MemoThis RFC describes an existing protocol for exchanging routing information among gateways and other hosts.It is intended to be used as a basis for developing gateway software for use in the Internet community.Distribution of this memo is unlimited.Table of Contents RFC 1058 Routing Information Protocol June 1988all implementations of this protocol.-Suggest some optional features to allow greater configurability and control.These features were developed specifically to solve problems that have shown up in actual use by the NSFnet community.However, they should have more general utility.The Routing Information Protocol (RIP) described here is loosely based on the program "routed", distributed with the 4.3 Berkeley Software Distribution.However, there are several other implementations of what is supposed to be the same protocol.Unfortunately, these various implementations disagree in various details.The specifications here represent a combination of features taken from various implementations.We believe that a program designed according to this document will interoperate with routed, and with all other implementations of RIP of which we are aware.Note that this description adopts a different view than most existing implementations about when metrics should be incremented.By making a corresponding change in the metric used for a local network, we have retained compatibility with other existing implementations.See section 3.6 for details on this issue.
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
Multicast routing in internetworks and extended LANs
Deering, S. E. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205457 · Cited by 425
Digest: Fast and communication efficient decentralized learning with local updates
Gholami, P., & Seferoglu, H. (2024) · IEEE Transactions on Machine Learning in Communications and Networking · doi:10.1109/tmlcn.2024.3354236 · Cited by 14
Metadata
- Authors
- Hedrick, C. L.
- Publisher
- RFC Editor
- Published
- 1988-06
- OpenAlex
- W1728701145
- Cited by
- 765
- References
- 0
- Type
- report
- Language
- en
- Open access
- gold
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: Routing Information Protocol. https://app.cochat.ai/papers/10.17487/rfc1058
- The paper
- Hedrick, C. L. (1988). Routing Information Protocol. https://doi.org/10.17487/rfc1058
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.