Jump to content

Equal-cost multi-path routing

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 192.114.91.231 (talk) at 11:37, 3 January 2021 (I have added a reference to an academic publication from IEEE/ACM Transactions on Networking that provides a formal exposition of ECMP). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
ECMP animation using IEEE 802.1aq protocol

Equal-cost multi-path routing (ECMP) is a routing strategy where packet forwarding to a single destination can occur over multiple best paths with equal routing priority. Multi-path routing can be used in conjunction with most routing protocols because it is a per-hop decision made independently at each router. It can substantially increase bandwidth by load-balancing traffic over multiple paths; however, there may be significant problems in deploying it in practice.[1]

History

Load balancing by per-packet multipath routing was generally disfavored due to the impact of rapidly changing latency, packet reordering and maximum transmission unit (MTU) differences within a network flow, which could disrupt the operation of many Internet protocols, most notably TCP and path MTU discovery. RFC 2992 analyzed one particular multipath routing strategy involving the assignment of flows through hashing flow-related data in the packet header. This solution is designed to avoid these problems by sending all packets from any particular network flow through the same path while balancing multiple flows over multiple paths in general.[2]

Shortest Path Bridging

In 2014, the Institute of Electrical and Electronics Engineers (IEEE) incorporated Equal Cost Multiple Paths (ECMP) or IEEE standard 802.1Qbp into IEEE 802.1Q-2014 for Shortest Path Bridging. Specifying the forward and reverse paths used for unicast and multicast traffic in shortest path bridging as symmetric ensuring flows on deterministic paths, resolving configuration complexities, management functionality and performance issues within original standards implementations.[3][4][5][6][7]

See also

References

  1. ^ Multipath Issues in Unicast and Multicast Next-Hop Selection. doi:10.17487/RFC2991. RFC 2991. Retrieved 16 December 2013.
  2. ^ Analysis of an Equal-Cost Multi-Path Algorithm. doi:10.17487/RFC2992. RFC 2992.
  3. ^ "802.1Q-2014 - Bridges and Bridged Networks". IEEE. 2014. Retrieved 28 November 2011.
  4. ^ "IEEE Standard for Local and Metropolitan Area Networks---Virtual Bridged Local Area Networks - Amendment: Equal Cost Multiple Paths (ECMP)".
  5. ^ "Alcatel-Lucent, Avaya, Huawei, Solana and Spirent Showcase Shortest Path Bridging Interoperability". Huawei. 7 September 2011. Retrieved 11 September 2011.
  6. ^ Luo, Zhen; Suh, Changjin (3 March 2011). "An improved shortest path bridging protocol for Ethernet backbone network". The International Conference on Information Networking 2011 (ICOIN2011). IEEE Xplore. pp. 148–153. doi:10.1109/ICOIN.2011.5723169. ISBN 978-1-61284-661-3. ISSN 1976-7684. {{cite book}}: |journal= ignored (help)
  7. ^ "Lab Testing Summary Report; Data Center Configuration with SPB" (PDF). Miercom. September 2011. Retrieved 2017-11-29.


Stub icon

This computer networking article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Equal-cost_multi-path_routing&oldid=998021773"