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.
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.
Integrity signals
Registry
Cites
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.
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
Dynamic Source Routing in Ad Hoc Wireless Networks
Johnson, D. B., & Maltz, D. A. (2007) · The Kluwer International Series in Engineering and Computer Science · doi:10.1007/978-0-585-29603-6_5 · Cited by 8,518
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
Perkins, C. E., & Bhagwat, P. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/190809.190336 · Cited by 6,678
Taming the underlying challenges of reliable multihop routing in sensor networks
Woo, A., Tong, T., & Culler, D. (2003) · Proceedings of the 1st international conference on Embedded networked sensor systems · doi:10.1145/958491.958494 · Cited by 1,512
Multicast routing in datagram internetworks and extended LANs
Deering, S. E., & Cheriton, D. R. (1990) · ACM Transactions on Computer Systems · doi:10.1145/78952.78953 · Cited by 1,173
Chen, S., & Nahrstedt, K. (1998) · IEEE Network · doi:10.1109/65.752646 · Cited by 874
SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks
Hu, Y.-C., Johnson, D. B., & Perrig, A. (2003) · Ad Hoc Networks · doi:10.1016/s1570-8705(03)00019-2 · Cited by 830
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
SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks
Hu, Y.-C., Johnson, D. B., & Perrig, A. (2003) · Proceedings Fourth IEEE Workshop on Mobile Computing Systems and Applications · doi:10.1109/mcsa.2002.1017480 · Cited by 636
Security problems in the TCP/IP protocol suite
Bellovin, S. M. (1989) · ACM SIGCOMM Computer Communication Review · doi:10.1145/378444.378449 · Cited by 550
The stable paths problem and interdomain routing
Griffin, T. G., Shepherd, F. B., & Wilfong, G. (2002) · IEEE/ACM Transactions on Networking · doi:10.1109/90.993304 · Cited by 518
Multipath Routing in Mobile Ad Hoc Networks: Issues and Challenges
Mueller, S., Tsang, R. P., & Ghosal, D. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24663-3_10 · Cited by 462
Multicast routing in internetworks and extended LANs
Deering, S. E. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205457 · Cited by 425
An analysis of BGP convergence properties
Griffin, T. G., & Wilfong, G. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316231 · Cited by 369
A Survey of BGP Security Issues and Solutions
Butler, K., Farley, T. R., McDaniel, P., & Rexford, J. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2009.2034031 · Cited by 350
A˚ström, K. J., & Kumar, P. R. (2014) · Automatica · doi:10.1016/j.automatica.2013.10.012 · Cited by 304
A survey of application-layer multicast protocols
Hosseini, M., Ahmed, D. T., Shirmohammadi, S., & Georganas, N. D. (2007) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2007.4317616 · Cited by 283
PLAN: a packet language for active networks
Hicks, M., Kakkar, P., Moore, J. T., Gunter, C. A., & Nettles, S. (1998) · Proceedings of the third ACM SIGPLAN international conference on Functional programming · doi:10.1145/289423.289431 · Cited by 266
A Survey on Opportunistic Routing in Wireless Communication Networks
Chakchouk, N. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2411335 · Cited by 260
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
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.