The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Analysis of an Equal-Cost Multi-Path Algorithm
Abstract
Equal-cost multi-path (ECMP) is a routing technique for routing packets along multiple paths of equal cost. The forwarding engine identifies paths by next-hop. When forwarding a packet the router must decide which next-hop (path) to use. This document gives an analysis of one method for making that decision. The analysis includes the performance of the algorithm and the disruption caused by changes to the set of next-hops.
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
Cites
Multipath Issues in Unicast and Multicast Next-Hop Selection
Thaler, D., & Hopps, C. (2000) · doi:10.17487/rfc2991 · Cited by 300
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
Hedera: dynamic flow scheduling for data center networks
Al-Fares, M., Radhakrishnan, S., Raghavan, B., Huang, N., & Vahdat, A. M. (2010) · doi:10.5555/1855711.1855730 · Cited by 1,450
PortLand: a scalable fault-tolerant layer 2 data center network fabric
Niranjan Mysore, R., Pamboris, A., Farrington, N., Huang, N., Miri, P., Radhakrishnan, S., Subramanya, V., & Vahdat, A. (2009) · Proceedings of the ACM SIGCOMM 2009 conference on Data communication · doi:10.1145/1592568.1592575 · Cited by 929
Data Center Network Virtualization: A Survey
Bari, M. F., Boutaba, R., Esteves, R., Granville, L. Z., Podlesny, M., Rabbani, M. G., Zhang, Q., & Zhani, M. F. (2013) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2012.090512.00043 · Cited by 677
A roadmap for traffic engineering in SDN-OpenFlow networks
Akyildiz, I. F., Lee, A., Wang, P., Luo, M., & Chou, W. (2014) · Computer Networks · doi:10.1016/j.comnet.2014.06.002 · Cited by 536
Mahout: Low-overhead datacenter traffic management using end-host-based elephant detection
Curtis, A. R., Kim, W., & Yalagandula, P. (2011) · 2011 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2011.5934956 · Cited by 402
Software Defined Networking Architecture, Security and Energy Efficiency: A Survey
Rawat, D. B., & Reddy, S. R. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2618874 · Cited by 372
Hybrid SDN Networks: A Survey of Existing Approaches
Amin, R., Reisslein, M., & Shah, N. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2837161 · Cited by 352
Multipath Issues in Unicast and Multicast Next-Hop Selection
Thaler, D., & Hopps, C. (2000) · doi:10.17487/rfc2991 · Cited by 300
Self-citationAuTO: scaling deep reinforcement learning for datacenter-scale automatic traffic optimization
Chen, L., Lingys, J., Chen, K., & Liu, F. (2018) · Proceedings of the 2018 Conference of the ACM Special Interest Group on Data Communication · doi:10.1145/3230543.3230551 · Cited by 282
Network virtualization in multi-tenant datacenters
Koponen, T., Amidon, K., Balland, P., Casado, M., Chanda, A., Fulton, B., Ganichev, I., Gross, J., Gude, N. S., Ingram, P., et al. (2014) · doi:10.5555/2616448.2616468 · Cited by 278
A Survey on Data Center Networking (DCN): Infrastructure and Operations
Xia, W., Zhao, P., Wen, Y., & Xie, H. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2626784 · Cited by 267
Online flow size prediction for improved network routing
Poupart, P., Chen, Z., Jaini, P., Fung, F., Susanto, H., Geng, Y., Chen, L., Chen, K., & Jin, H. (2016) · 2016 IEEE 24th International Conference on Network Protocols (ICNP) · doi:10.1109/icnp.2016.7785324 · Cited by 96
Akamai DNS: Providing Authoritative Answers to the World's Queries
Schomp, K., Bhardwaj, O., Kurdoglu, E., Muhaimen, M., & Sitaraman, R. K. (2020) · Proceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication · doi:10.1145/3387514.3405881 · Cited by 38
Metadata
- Authors
- Hopps, C.
- Publisher
- RFC Editor
- Published
- 2000-11
- OpenAlex
- W2169246522
- Cited by
- 965
- References
- 1
- 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.