The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Multipath Issues in Unicast and Multicast Next-Hop Selection
Abstract
This memo provides information for the Internet community. It does not specify an Internet standard of any kind. Distribution of this memo is unlimited. Copyright Notice Copyright (C) The Internet Society (2000). All Rights Reserved. Various routing protocols, including Open Shortest Path First (OSPF) and Intermediate System to Intermediate System (ISIS), explicitly allow "Equal-Cost Multipath " (ECMP) routing. Some router implementations also allow equal-cost multipath usage with RIP and other routing protocols. The effect of multipath routing on a forwarder is that the forwarder potentially has several next-hops for any given destination and must use some method to choose which nexthop should be used for a given data packet. 1.
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
Allman, M., Paxson, V., & Blanton, E. (2009) · doi:10.17487/rfc5681 · Cited by 2,523
Definition of the Differentiated Services Field (DS Field) in the IPv4 and IPv6 Headers
Nichols, K., Blake, S., Baker, F., & Black, D. (1998) · doi:10.17487/rfc2474 · Cited by 1,530
Analysis of an Equal-Cost Multi-Path Algorithm
Hopps, C. (2000) · doi:10.17487/rfc2992 · Cited by 965
Self-citation
Cited by
A scalable, commodity data center network architecture
Al-Fares, M., Loukissas, A., & Vahdat, A. (2008) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1402946.1402967 · Cited by 3,175
B4: experience with a globally-deployed software defined wan
Jain, S., Kumar, A., Mandal, S., Ong, J., Poutievski, L., Singh, A., Venkata, S., Wanderer, J., Zhou, J., Zhu, M., et al. (2013) · Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM · doi:10.1145/2486001.2486019 · Cited by 1,771
Analysis of an Equal-Cost Multi-Path Algorithm
Hopps, C. (2000) · doi:10.17487/rfc2992 · Cited by 965
Self-citationDesign, implementation and evaluation of congestion control for multipath TCP
Wischik, D., Raiciu, C., Greenhalgh, A., & Handley, M. J. (2011) · doi:10.5555/1972457.1972468 · Cited by 586
GreenCloud: a packet-level simulator of energy-aware cloud computing data centers
Kliazovich, D., Bouvry, P., & Khan, S. U. (2012) · The Journal of Supercomputing · doi:10.1007/s11227-010-0504-1 · Cited by 553
Metadata
- Authors
- Thaler, D., & Hopps, C.
- Publisher
- RFC Editor
- Published
- 2000-11
- OpenAlex
- W1562069137
- Cited by
- 300
- References
- 3
- Type
- report
- 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
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.